Sequential prediction of individual sequences under general loss functions
From MaRDI portal
(Redirected from Publication:4701166)
Cited in
(25)- Does snooping help?
- Universal prediction of random binary sequences in a noisy environment
- The fundamental nature of the log loss function
- Prediction with expert evaluators' advice
- Constant regret for sequence prediction with limited advice
- Fast learning rates in statistical inference through aggregation
- Supermartingales in prediction with expert advice
- Sparse regression learning by aggregation and Langevin Monte-Carlo
- Regression Estimation from an Individual Stable Sequence
- Loss functions, complexities, and the Legendre transformation.
- Mirror averaging with sparsity priors
- Network Estimation by Mixing: Adaptivity and More
- Robust forecast combinations
- Generalized mirror averaging and D-convex aggregation
- Sensor networks: from dependence analysis via matroid bases to online synthesis
- How many strings are easy to predict?
- A Bayesian approach to (online) transfer learning: theory and algorithms
- Efficient learning with virtual threshold gates
- Optimal learning with Bernstein online aggregation
- Randomized prediction of individual sequences
- The weak aggregating algorithm and weak mixability
- Learning by mirror averaging
- Competitive On-line Statistics
- Probability theory for the Brier game
- Memoryless sequences for general losses
This page was built for publication: Sequential prediction of individual sequences under general loss functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701166)
