Randomized prediction of individual sequences
From MaRDI portal
Publication:1733293
zbMATH Open1409.60063MaRDI QIDQ1733293FDOQ1733293
Authors: Gábor Lugosi
Publication date: 21 March 2019
Published in: Journal de la Société Française de Statistique (Search for Journal in Brave)
Recommendations
Cites Work
- On tail probabilities for martingales
- Sequential prediction of individual sequences under general loss functions
- Prediction, Learning, and Games
- Probability Inequalities for Sums of Bounded Random Variables
- Asymptotically efficient adaptive allocation rules
- Title not available (Why is that?)
- The Nonstochastic Multiarmed Bandit Problem
- Some aspects of the sequential design of experiments
- The weighted majority algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- Learning Theory
- A general class of adaptive strategies
- An analog of the minimax theorem for vector payoffs
- Weighted sums of certain dependent random variables
- 10.1162/153244303321897663
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Asymptotic calibration
- Tracking the best expert
- On prediction of individual sequences
- How to use expert advice
- 10.1162/153244303321897654
- Regret in the on-line decision problem
- Minimizing regret: The general case
- Title not available (Why is that?)
- Learning Theory and Kernel Machines
- Regret Minimization Under Partial Monitoring
- Title not available (Why is that?)
- Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
- Title not available (Why is that?)
- A game of prediction with expert advice
- Analysis of two gradient-based algorithms for on-line regression
- Universal prediction of individual sequences
- 10.1162/1532443041424328
- Competitive On-line Statistics
- Apple tasting.
- Coding theorems for individual sequences
- The on-line shortest path problem under partial monitoring
- Prediction in the worst case
- On repeated games with incomplete information played by non-Bayesian players
- Potential-based algorithms in on-line prediction and game theory
- Universal prediction
- On Pseudo-Games
- Derandomizing stochastic prediction strategies
- Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding
- Structural results about on-line learning models with and without queries
- Learning Theory
- Efficient algorithms for online decision problems.
- Universal schemes for sequential decision from individual data sequences
- 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
- Distortion-rate theory for individual sequences
- Learning Theory
Cited In (5)
This page was built for publication: Randomized prediction of individual sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733293)