Online Learning with Set-Valued Feedback

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Raman, Vinod, Subedi, Unique, Tewari, Ambuj
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913397158707200
author Raman, Vinod
Subedi, Unique
Tewari, Ambuj
author_facet Raman, Vinod
Subedi, Unique
Tewari, Ambuj
contents We study a variant of online multiclass classification where the learner predicts a single label but receives a \textit{set 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 \textit{not 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.
format Preprint
id arxiv_https___arxiv_org_abs_2306_06247
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Online Learning with Set-Valued Feedback
Raman, Vinod
Subedi, Unique
Tewari, Ambuj
Machine Learning
We study a variant of online multiclass classification where the learner predicts a single label but receives a \textit{set 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 \textit{not 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.
title Online Learning with Set-Valued Feedback
topic Machine Learning
url https://arxiv.org/abs/2306.06247