Beyond Augmented-Action Surrogates for Multi-Expert Learning-to-Defer
Organizations: School of Computing, National University of Singapore, Singapore, 117418 · Fédération ENAC ISAE-SUPAERO ONERA, Université de Toulouse, Toulouse, 31555, France · Agency for Science, Technology and Research, Institute for Infocomm Research, Singapore, 138634
Abstract
A learning-to-defer (L2D) system decides, for each input, whether to predict on its own or to hand it to one of several available experts. The very well established recipe trains classifier and router jointly by treating the classes and experts as competing actions in one shared -action geometry. Subsequent work has proposed a series of incremental fixes within this geometry; we show that each still suffers, to varying severity, from an optimization-level pathology (target distortion, gradient amplification, winner-take-all starvation, set-mass collapse, or class-expert coupling) even under statistical consistency. We step outside the augmented-action family entirely and propose a decoupled surrogate: a softmax classifier head and an independent sigmoid head per expert, mirroring the two natural objects of the problem. We show that per-sample updates are then coordinatewise and the class-expert Hessian block is identically zero, and prove an excess-risk bound with calibration constant -- to our knowledge the first multi-expert L2D guarantee whose constant does not grow with the expert pool when the per-expert weight is held fixed. On controlled synthetic studies and on CIFAR-10, CIFAR-10H, and Covertype, it is the only method in our comparison that remains stable as the expert pool grows, preserves rare specialists, and improves over a standalone classifier on every real-data benchmark.
Figures & tables
| Add. CE | PiCCE | Mao25 | A-SM | OvA | Decoupled | ||
|---|---|---|---|---|---|---|---|
| Conditional minimizer recovers the Bayes pair | (i) | ✗ ( 14 ) | ✗ ( E.3 ) | ✗ ( 6 ) | ✓ ( 17 ) | ✓ ( 19 ) | ✓ ( 10 ) |
| Per-sample gradient and Hessian free of prefactor | (ii) | ✗ ( 4 ) | ✓ ( E.4 ) | ✓ ( 6 ) | ✓ ( 7 ) | ✓ ( H.3 ) | ✓ ( 9 ) |
| No winner-take-all suppression of correct experts | (ii) | ✓ ( 4 ) | ✗ ( 5 ) | ✓ ( 6 ) | ✓ ( 7 ) | ✓ ( 19 ) | ✓ ( 9 ) |
| No class–expert coupling in the per-sample gradient | (ii) | ✗ ( 4 ) | ✗ ( 5 ) | ✗ ( 6 ) | ✗ ( 7 ) | ✓ ( H.3 ) | ✓ ( 12 ) |
| Class head is a categorical posterior throughout training | (i) | ✗ ( 3 ) | ✗ ( 3 ) | ✗ ( 3 ) | ✓ ( 17 ) | ✗ ( 19 ) | ✓ ( 8 ) |
| Quantitative surrogate-to-target excess-risk bound | (th) | ✓ † | ✗ | ✓ ‡ | ✗ | ✗ | ✓ ( 10 ) |
| Sys. Acc. | Cls. Acc. | |||||
|---|---|---|---|---|---|---|
| Method | ||||||
| Decoupled | ||||||
| Classif. only | ||||||
| OvA | ||||||
| PiCCE | ||||||
| A-SM | ||||||
| Sys. Acc. | Cls. Acc. | |||||
|---|---|---|---|---|---|---|
| Method | ||||||
| Decoupled | ||||||
| OvA | ||||||
| A-SM | ||||||
| PiCCE | ||||||
| Add. CE | ||||||
Appendix figures & tables10 assets
Supplementary material from the paper’s appendix.
Appendix
| Method | Exact defer regret | System accuracy |
|---|---|---|
| Decoupled | ||
| PiCCE | ||
| OvA | ||
| A-SM | ||
| Mao25 | ||
| Add. CE |
| Decoupled defer regret | |||
|---|---|---|---|
| Best non-decoupled defer regret | |||
| Best non-decoupled method | PiCCE | PiCCE | OvA |
| Method | Defer regret | System acc. | Coverage | Spec. sel. on | Shared-correct routing |
|---|---|---|---|---|---|
| Decoupled | |||||
| OvA | |||||
| A-SM | |||||
| Mao25 | |||||
| PiCCE | |||||
| Add. CE |
| Method | Defer regret | System acc. | Coverage | Best expert sel. on |
|---|---|---|---|---|
| Decoupled | ||||
| A-SM | ||||
| OvA | ||||
| PiCCE | ||||
| Add. CE | ||||
| Mao25 |
| Method | Gradient norm | Top eigenvalue | |
|---|---|---|---|
| Add. CE | 1 | ||
| Add. CE | 4 | ||
| Add. CE | 8 | ||
| Add. CE | 16 | ||
| Add. CE | 32 | ||
| Decoupled | 1 |
| Method | Mean gradient | Positive-gradient rate |
|---|---|---|
| Decoupled | ||
| PiCCE |
| Method | Experts | Mixed-block norm |
|---|---|---|
| A-SM | 1 | |
| A-SM | 3 | |
| A-SM | 5 | |
| A-SM | 9 | |
| A-SM | 17 | |
| Decoupled | 1 |
| Validation Metrics | |||||
|---|---|---|---|---|---|
| Method | Sys. Acc. | Defer Loss | Cls. Acc. | Cov. | |
| Decoupled | 8 | ||||
| Classifier only | 8 | ||||
| OvA | 8 | ||||
| PiCCE | 8 | ||||
| A-SM | 8 | ||||
| Test Metrics | |||||
|---|---|---|---|---|---|
| Method | Sys. Acc. | Defer Loss | Cls. Acc. | Cov. | |
| Decoupled | 5 | ||||
| OvA | 5 | ||||
| A-SM | 5 | ||||
| PiCCE | 5 | ||||
| Add. CE | 5 | ||||
| Method | Sys. Acc. | Defer Loss | Cls. Acc. | Cov. |
|---|---|---|---|---|
| Decoupled | ||||
| Classifier only | ||||
| PiCCE | ||||
| OvA | ||||
| A-SM | ||||
| Add. CE |
Learning to Defer
Learning to defer trains AI systems to decide when to predict autonomously and when to route cases to human or machine experts.
See all 26 papers