One-Stage Top-$k$ Learning-to-Defer: Score-Based Surrogates with Theoretical Guarantees

📅 2025-05-15
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
提出一种一阶段Top-k学习延迟框架,通过共享评分模型选择k个最具成本效益的实体或专家,解决了多实体联合优化预测和延迟的问题,并证明了方法的理论一致性。

Technology Category

Application Category

📝 Abstract
We introduce the first one-stage Top-$k$ Learning-to-Defer framework, which unifies prediction and deferral by learning a shared score-based model that selects the $k$ most cost-effective entities-labels or experts-per input. While existing one-stage L2D methods are limited to deferring to a single expert, our approach jointly optimizes prediction and deferral across multiple entities through a single end-to-end objective. We define a cost-sensitive loss and derive a novel convex surrogate that is independent of the cardinality parameter $k$, enabling generalization across Top-$k$ regimes without retraining. Our formulation recovers the Top-1 deferral policy of prior score-based methods as a special case, and we prove that our surrogate is both Bayes-consistent and $mathcal{H}$-consistent under mild assumptions. We further introduce an adaptive variant, Top-$k(x)$, which dynamically selects the number of consulted entities per input to balance predictive accuracy and consultation cost. Experiments on CIFAR-10 and SVHN confirm that our one-stage Top-$k$ method strictly outperforms Top-1 deferral, while Top-$k(x)$ achieves superior accuracy-cost trade-offs by tailoring allocations to input complexity.
Problem

Research questions and friction points this paper is trying to address.

Unifies prediction and deferral via shared score-based model
Optimizes prediction and deferral across multiple entities jointly
Dynamically selects consulted entities to balance accuracy and cost
Innovation

Methods, ideas, or system contributions that make the work stand out.

One-stage Top-k Learning-to-Defer framework
Shared score-based model for prediction and deferral
Cost-sensitive loss with convex surrogate
🔎 Similar Papers
No similar papers found.