Prediction with Expert Advice under Discounted Loss
Alexey Chernov, Fedor Zhdanov

TL;DR
This paper extends the prediction with expert advice framework to scenarios with discounted losses, introducing new algorithms and theoretical bounds for this setting.
Contribution
It generalizes existing algorithms to handle discounted loss accumulation and proposes a new exponential weights variant with proven loss bounds.
Findings
Generalized the Aggregating Algorithm for discounted losses
Developed a new exponential weights algorithm variant
Proved theoretical loss bounds for the proposed algorithms
Abstract
We study prediction with expert advice in the setting where the losses are accumulated with some discounting---the impact of old losses may gradually vanish. We generalize the Aggregating Algorithm and the Aggregating Algorithm for Regression to this case, propose a suitable new variant of exponential weights algorithm, and prove respective loss bounds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Auction Theory and Applications · Forecasting Techniques and Applications
