Skip to main content
Search

Ludovic Schwartz

1 related articles

Subscribe to updates
  1. arXiv

    Decision trees learn to hand hard cases to a black box: three training methods tie on average across real data, and deferral-aware splitting pays off on synthetic data

    Partially interpretable models let a simple model decide for itself and defer hard inputs to an accurate black box, trading interpretability for accuracy. Training procedures existed for linear models and decision rules but not for decision trees. Three tree-training algorithms differ on average by amounts within error across many real datasets, and a bound ties this to how uniformly accurate the black box is; on synthetic data built with deliberately inhomogeneous black-box accuracy, the deferral-aware CART variant clearly beats building a tree and then converting it.

You’re all caught up