mlsanityData to 7 Oct 2026

Proactive Routing to Interpretable Surrogates with Distribution-Free Safety Guarantees

arXiv 2603.14623 ↗First posted 15 Mar 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Model routing determines whether to use an accurate black-box model or a simpler surrogate that approximates it at lower cost or greater interpretability. In deployment settings, practitioners often wish to restrict surrogate use to inputs where its degradation relative to a reference model is controlled. We study proactive (input-based) routing, in which a lightweight gate selects the model before either runs, enabling distribution-free control of the fraction of routed inputs whose degradation exceeds a tolerance τ. The gate is trained to distinguish safe from unsafe inputs, and a routing threshold is chosen via Clopper-Pearson conformal calibration on a held-out set, guaranteeing that the routed-set violation rate is at most α with probability 1-δ. We derive a feasibility condition linking safe routing to the base safe rate π and risk budget α, along with sufficient AUC thresholds ensuring that feasible routing exists. Across 35 OpenML datasets and multiple black-box model families, gate-based conformal routing maintains controlled violation while achieving substantially higher coverage than regression conformal and naive baselines. We further show that probabilistic calibration primarily affects routing efficiency rather than distribution-free validity.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 41 references that are in the map. First posted on arXiv 15 Mar 2026.

Builds on

20 of 41 references.

References · 20

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  3. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  4. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  5. 2017On Calibration of Modern Neural Networkscited by 4,860
  6. 2017Selective Classification for Deep Neural Networkscited by 799
  7. 2021A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantificationcited by 777
  8. 2016Distribution-Free Predictive Inference For Regressioncited by 657
  9. 2019Conformalized Quantile Regressioncited by 620
  10. 2014OpenML: networked science in machine learningcited by 523
  11. 2019Conformal Prediction Under Covariate Shiftcited by 511
  12. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
8 more
  1. 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 328
  2. 2021Distribution-Free, Risk-Controlling Prediction Setscited by 278
  3. 2021Learn then Test: Calibrating Predictive Algorithms to Achieve Risk Controlcited by 256
  4. 2017Predict Responsibly: Improving Fairness and Accuracy by Learning to Defercited by 228
  5. 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 185
  6. 2025Conformal Arbitrage: Risk-Controlled Balancing of Competing Objectives in Language Modelscited by 10
  7. 2025C3PO: Optimized Large Language Model Cascades with Probabilistic Cost Constraints for Reasoningcited by 8
  8. 2025LEC: Linear Expectation Constraints for Selection-Conditioned Risk Control in Selective Prediction and Routing Systemscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.