Cover Image

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filmus, Yuval, Hanneke, Steve, Mehalel, Idan, Moran, Shay
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
by: Filmus, Yuval, et al.
Published: (2023)

Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End
by: Hanneke, Steve, et al.
Published: (2026)

Multiclass Online Learnability under Bandit Feedback
by: Raman, Ananth, et al.
Published: (2023)

Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning
by: Attias, Idan, et al.
Published: (2026)

Optimal sets of questions for Twenty Questions
by: Filmus, Yuval, et al.
Published: (2021)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
by: Attias, Idan, et al.
Published: (2025)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
by: Hanneke, Steve, et al.
Published: (2026)

Optimal Reconstruction from Linear Queries
by: Filmus, Yuval, et al.
Published: (2026)

Universal Multiclass Transductive Online Learning
by: Hanneke, Steve, et al.
Published: (2026)

Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
by: Cohen, Alon, et al.
Published: (2025)

The Real Price of Bandit Information in Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)

Fast Rates for Bandit PAC Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)

Beyond Bandit Feedback in Online Multiclass Classification
by: van der Hoeven, Dirk, et al.
Published: (2021)

A Theory of Universal Agnostic Learning
by: Hanneke, Steve, et al.
Published: (2026)

Multiclass Transductive Online Learning
by: Hanneke, Steve, et al.
Published: (2024)

Optimal Mistake Bounds for Transductive Online Learning
by: Chase, Zachary, et al.
Published: (2025)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
by: Chase, Zachary, et al.
Published: (2025)

List Sample Compression and Uniform Convergence
by: Hanneke, Steve, et al.
Published: (2024)

Private List Learnability vs. Online List Learnability
by: Hanneke, Steve, et al.
Published: (2025)

Online Learning of Neural Networks
by: Daniely, Amit, et al.
Published: (2025)

Adversarially Robust PAC Learnability of Real-Valued Functions
by: Attias, Idan, et al.
Published: (2022)

Strategic PAC Learnability via Geometric Definability
by: Filmus, Yuval, et al.
Published: (2026)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
by: Erez, Liad, et al.
Published: (2026)

Deterministic Apple Tasting
by: Chase, Zachary, et al.
Published: (2024)

Most Convolutional Networks Suffer from Small Adversarial Perturbations
by: Daniely, Amit, et al.
Published: (2026)

Online Realizable Regression and Applications for ReLU Networks
by: Doron-Arad, Ilan, et al.
Published: (2026)

A Theory of Online Learning with Autoregressive Chain-of-Thought Reasoning
by: Doron-Arad, Ilan, et al.
Published: (2026)

On the ERM Principle in Meta-Learning
by: Alon, Yannay, et al.
Published: (2024)

Data Selection for ERMs
by: Hanneke, Steve, et al.
Published: (2025)

An Optimal Sauer Lemma Over $k$-ary Alphabets
by: Hanneke, Steve, et al.
Published: (2026)

On Characterizing Learnability for Adversarial Noisy Bandits
by: Hanneke, Steve, et al.
Published: (2026)

Adversarial Resilience in Sequential Prediction via Abstention
by: Goel, Surbhi, et al.
Published: (2023)

Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem
by: Fioravanti, Simone, et al.
Published: (2024)

Sample Compression Scheme Reductions
by: Attias, Idan, et al.
Published: (2024)

A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
by: Attias, Idan, et al.
Published: (2022)

A Complete Characterization of Learnability for Stochastic Noisy Bandits
by: Hanneke, Steve, et al.
Published: (2024)

On the Learning Curves of Revenue Maximization
by: Hanneke, Steve, et al.
Published: (2026)

Optimal Learners for Realizable Regression: PAC Learning and Online Learning
by: Attias, Idan, et al.
Published: (2023)

Online Set Learning from Precision and Recall Feedback
by: Cohen, Lee, et al.
Published: (2026)

A Theory of Optimistically Universal Online Learnability for General Concept Classes
by: Hanneke, Steve, et al.
Published: (2025)