Learning Theory
From MaRDI portal
Publication:5473612
DOI10.1007/b137542zbMath1137.68525arXivmath/0602629OpenAlexW4246660828MaRDI QIDQ5473612
Yishay Mansour, Gilles Stoltz, Nicolò Cesa-Bianchi
Publication date: 22 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602629
Related Items (10)
Lower bounds on individual sequence regret ⋮ Fast learning rates in statistical inference through aggregation ⋮ Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback ⋮ Online variance minimization ⋮ Online aggregation of unbounded losses using shifting experts with confidence ⋮ Regret bounded by gradual variation for online convex optimization ⋮ Optimal learning with Bernstein Online Aggregation ⋮ A quasi-Bayesian perspective to online clustering ⋮ Unnamed Item
This page was built for publication: Learning Theory
