Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning

DOI10.1016/j.tcs.2023.113980zbMath1517.68150arXiv2209.01366OpenAlexW4378675206MaRDI QIDQ6162075

No author found.

Publication date: 15 June 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.01366

zbMATH Keywords

learning theoryonline learningmistake-bound modelbandit feedback

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic values for degrees associated with strips of Young diagrams
• On the complexity of function learning
• Multiclass classification with bandit feedback using adaptive regularization
• Structural results about on-line learning models with and without queries
• A note on the price of bandit feedback for mistake-bounded online learning
• New bounds on the price of bandit feedback for mistake-bounded online multiclass learning
• On Learning Mixture Models for Permutations
• Learning Binary Relations and Total Orders

This page was built for publication: Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning