Summary
This work studies learning to defer, focusing on the single-stage and single-expert setting. It introduces a family of surrogate losses based on comp-sum losses [Mao et al., 2023b] and establishes their realizable H-consistency (under mild conditions). In addition, when the base loss is the logistic loss $\Psi_{log}$ or the generalized cross entropy loss $\Psi_{gce}$, H-consistency bounds are proven (under mild conditions) when the cost function of deferring is classification error. When the base loss is the mean absolute error loss $\Psi_{mae}$, H-consistency bounds are proven (under mild conditions) when the cost function of deferring is general. Note that H-consistency implies Bayes consistency. The results also close an open question raised by Mozannar et al., 2023. The relationship between realizable H-consistency and H-consistency bounds is then analyzed for learning to defer. Finally, the proposed surrogates are evaluated empirically and compared with existing baselines.
Strengths
**Originality**
- A new family of surrogate losses based on comp-sum losses (focusing on $\Psi_{log}$, $\Psi_{gce}$, and $\Psi_{mae}$) [Mao et al., 2023b] for learning to defer (the single-stage and single-expert setting).
- Conditions for realizable H-consistency are identified (Theorem 4.1). In particular, $\Psi_{log}$, $\Psi_{gce}$, and $\Psi_{mae}$ all satisfy the conditions. This result is more general than Mozannar et al. [2023]
- When the cost function of deferring is classification error, H-consistency bounds are proven for base losses $\Psi_{log}$ and $\Psi_{gce}$ (Theorem 4.2).
- When the cost function of deferring is general, an H-consistency bound is proven for base loss $\Psi_{mae}$ (Theorem 4.3).
The results also close an open question raised by Mozannar et al., 2023 (Section 4.4). The relationship between realizable H-consistency and H-consistency bounds is then analyzed for learning to defer (Section 5). Related work is adequately cited and compared.
**Quality**
The submission is technically sound. Claims are well supported by proofs.
**Clarity**
The submission is generally clearly written and well organized.
**Significance**
The work closes an open question raised in previous work. Its work to connect both realizable H-consistency and H-consistency bounds might be useful in other learning settings.
Weaknesses
**Originality**
- The realizable H-consistency result (Theorem 4.1) only applies to a subset of comp-sum losses.
- The H-consistency results (Theorems 4.2 and 4.3) require case-by-case analysis. Is it possible to prove such results for all comp-sum losses?
**Quality**
- Some experiments in realizable settings can help confirm the realizable H-consistency result.
**Clarity**
- Section 5 is a bit unclear. Lines 300-302: Do you mean that in the realizable setting, all surrogate minimizability gaps vanish? Or is it only for comp-sum losses?
**Significance**
- The applicability of this work might be limited to learning to defer.
Questions
Besides my concerns above, here are some other questions:
1. Can constrained losses [1] be used as the base loss?
2. Lines 273-274: Can negative results be proven formally?
[1] Y. Lee, Y. Lin, and G. Wahba. Multicategory support vector machines: Theory and application to the classification of microarray data and satellite radiance data. Journal of the American Statistical Association, 99(465):67–81, 2004.
Limitations
The authors have adequately addressed the limitations.