A closer look at adaptive regret

MaRDI QIDQ2810792zbMATH OpenFDO

Authors Dmitry Adamskiy, Wouter M. Koolen, Alexey Chernov, Vladimir Vovk

Publication date 6 June 2016

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL http://jmlr.csail.mit.edu/papers/v17/13-533.html

zbMATH Keywords

online learningadaptive regretfixed sharespecialist experts

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A closer look at adaptive regret
• Regret to the best vs. regret to the average
• Regret to the Best vs. Regret to the Average
• How to better use expert advice
• Efficient tracking of a growing number of experts

Cited in

(10)

• Aggregating algorithm for prediction of packs
• A closer look at adaptive regret
• Extracting certainty from uncertainty: regret bounded by variation in costs
• Efficient tracking of a growing number of experts
• Towards optimal algorithms for prediction with expert advice
• Tight lower bounds for multiplicative weights algorithmic families
• Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization
• Adaptive Regret Minimization in Bounded-Memory Games
• Approachability, regret and calibration: implications and equivalences
• Online aggregation of unbounded losses using shifting experts with confidence

Describes a project that uses

Uses Software

• AdaBoost.MH

This page was built for publication: A closer look at adaptive regret

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810792)