Online Prediction with Limited Selectivity

Licheng Liu, Mingda Qiao
8/13/2025
cs.LGcs.DS

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{liu2025online,
  title  = {Online Prediction with Limited Selectivity},
  author = {Licheng Liu and Mingda Qiao},
  year   = {2025},
  eprint = {2508.09592},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.09592v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.09592.svg)](https://codeofpaper.com/paper/2508.09592)

Discussion