Randomized prediction of individual sequences
From MaRDI portal
Publication:1733293
zbMath1409.60063MaRDI QIDQ1733293
Publication date: 21 March 2019
Published in: Journal de la Société Française de Statistique (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analog of the minimax theorem for vector payoffs
- Asymptotically efficient adaptive allocation rules
- On repeated games with incomplete information played by non-Bayesian players
- On tail probabilities for martingales
- A game of prediction with expert advice
- Tracking the best expert
- The weighted majority algorithm
- Potential-based algorithms in on-line prediction and game theory
- On prediction of individual sequences
- Regret in the on-line decision problem
- Minimizing regret: The general case
- Apple tasting.
- Structural results about on-line learning models with and without queries
- Derandomizing stochastic prediction strategies
- Analysis of two gradient-based algorithms for on-line regression
- Prediction in the worst case
- Weighted sums of certain dependent random variables
- Coding theorems for individual sequences
- Adaptive routing with end-to-end feedback
- Distortion-rate theory for individual sequences
- Universal prediction of individual sequences
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Asymptotic calibration
- Universal schemes for sequential decision from individual data sequences
- How to use expert advice
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence
- Universal prediction of individual binary sequences in the presence of noise
- Learning Theory
- Learning Theory
- Sequential prediction of individual sequences under general loss functions
- Universal prediction
- The Nonstochastic Multiarmed Bandit Problem
- 10.1162/1532443041424328
- 10.1162/153244303321897654
- 10.1162/153244303321897663
- Competitive On-line Statistics
- Learning Theory and Kernel Machines
- Learning Theory and Kernel Machines
- Probability Inequalities for Sums of Bounded Random Variables
- Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding
- Regret Minimization Under Partial Monitoring
- Prediction, Learning, and Games
- Learning Theory
- On Pseudo-Games
- Some aspects of the sequential design of experiments
- A general class of adaptive strategies