Online Learning with Set-Valued Feedback
Not on the map. Why?
Abstract (arXiv)
We study a variant of online multiclass classification where the learner predicts a single label but receives a textitset of labels as feedback. In this model, the learner is penalized for not outputting a label contained in the revealed set. We show that unlike online multiclass learning with single-label feedback, deterministic and randomized online learnability are textitnot equivalent even in the realizable setting with set-valued feedback. Accordingly, we give two new combinatorial dimensions, named the Set Littlestone and Measure Shattering dimension, that tightly characterize deterministic and randomized online learnability respectively in the realizable setting. In addition, we show that the Measure Shattering dimension characterizes online learnability in the agnostic setting and tightly quantifies the minimax regret. Finally, we use our results to establish bounds on the minimax regret for three practical learning settings: online multilabel ranking, online multilabel classification, and real-valued prediction with interval-valued response.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 11 of its 34 references that are in the map. First posted on arXiv 9 Jun 2023.
Builds on
11 of 34 references.
References · 11
- 2015Online Learning with Feedback Graphs: Beyond Banditscited by 79
- 2020Proper Learning, Helly Number, and an Optimal SVM Boundcited by 52
- 2013The price of bandit information in multiclass online classificationcited by 24
- 2023Multiclass Online Learning and Uniform Convergencecited by 19
- 2021Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Gamescited by 18
- 2023Optimal Prediction Using Expert Advice and Randomized Littlestone Dimensioncited by 18
- 2021Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Gamescited by 16
- 2023List Online Classificationcited by 16
- 2021Beyond Bandit Feedback in Online Multiclass Classificationcited by 14
- 2017On Communication Complexity of Classification Problemscited by 11
- 2023On the Learnability of Multilabel Rankingcited by 2
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 1; 2026: 3.
7 papers.
- 2023Multiclass Online Learnability under Bandit Feedbackcited by 12
- 2023Apple Tasting: Combinatorial Dimensions and Minimax Ratescited by 4
- 2026Learning with Multiple Correct Answers -- Regret Bounds under Different Feedback Modelscited by 3
- 2026Multiscale Reward Hedging from Correct Demonstrationscited by 3
- 2026Partial Feedback Online Learningcited by 2
- 2023A Combinatorial Characterization of Supervised Online Learnabilitycited by 0
- 2025Characterizing the Multiclass Learnability of Forgiving 0-1 Loss Functionscited by 0
- 2026Multiscale Reward Hedging from Correct Demonstrations7 Aug 2026
- 2026Learning with Multiple Correct Answers -- Regret Bounds under Different Feedback Models10 Feb 2026
- 2026Partial Feedback Online Learning29 Jan 2026
- 2025Characterizing the Multiclass Learnability of Forgiving 0-1 Loss Functions9 Oct 2025
- 2023Apple Tasting: Combinatorial Dimensions and Minimax Rates29 Oct 2023
- 2023Multiclass Online Learnability under Bandit Feedback8 Aug 2023
- 2023A Combinatorial Characterization of Supervised Online Learnability7 Jul 2023