Online Prediction with Limited Selectivity
Not on the map. Why?
Abstract (arXiv)
Selective prediction [Dru13, QV19] models the scenario where a forecaster freely decides on the prediction window that their forecast spans. Many data statistics can be predicted to a non-trivial error rate without any distributional assumptions or expert advice, yet these results rely on that the forecaster may predict at any time. We introduce a model of Prediction with Limited Selectivity (PLS) where the forecaster can start the prediction only on a subset of the time horizon. We study the optimal prediction error both on an instance-by-instance basis and via an average-case analysis. We introduce a complexity measure that gives instance-dependent bounds on the optimal error. For a randomly-generated PLS instance, these bounds match with high probability.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 15 references that are in the map. First posted on arXiv 13 Aug 2025.
Builds on
11 of 15 references.
References · 11
- 2017Online Learning with Abstentioncited by 28
- 2020Fast Rates for Online Prediction with Abstentioncited by 19
- 2023Adversarial Resilience in Sequential Prediction via Abstentioncited by 11
- 2016The Extended Littlestone's Dimension for Learning with Mistakes and Abstentionscited by 10
- 2021Online Selective Classification with Limited Feedbackcited by 9
- 2019A Theory of Selective Predictioncited by 4
- 2024Bandits with Abstention under Expert Advicecited by 3
- 2014Why are images smooth?cited by 2
- 2021Exponential Weights Algorithms for Selective Learningcited by 2
- 2014Chasing Ghosts: Competing with Stateful Policiescited by 1
- 2021Faster Algorithms and Constant Lower Bounds for the Worst-Case Expected Errorcited by 1
Built on by
Not cited yet.