Randomized prediction of individual sequences
From MaRDI portal
(Redirected from Publication:1733293)
Recommendations
Cites work
- 10.1162/153244303321897654
- 10.1162/153244303321897663
- 10.1162/1532443041424328
- A game of prediction with expert advice
- A general class of adaptive strategies
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- A universal algorithm for sequential data compression
- Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
- An analog of the minimax theorem for vector payoffs
- Analysis of two gradient-based algorithms for on-line regression
- Apple tasting.
- Asymptotic calibration
- Asymptotically efficient adaptive allocation rules
- Coding theorems for individual sequences
- Competitive On-line Statistics
- Derandomizing stochastic prediction strategies
- Distortion-rate theory for individual sequences
- Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding
- Efficient algorithms for online decision problems.
- How to use expert advice
- scientific article; zbMATH DE number 1804105 (Why is no real title available?)
- scientific article; zbMATH DE number 3122013 (Why is no real title available?)
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- scientific article; zbMATH DE number 4078557 (Why is no real title available?)
- scientific article; zbMATH DE number 3538599 (Why is no real title available?)
- scientific article; zbMATH DE number 1233801 (Why is no real title available?)
- scientific article; zbMATH DE number 1795161 (Why is no real title available?)
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- Learning Theory
- Learning Theory
- Learning Theory
- Learning Theory and Kernel Machines
- Minimizing regret: The general case
- On prediction of individual sequences
- On Pseudo-Games
- On repeated games with incomplete information played by non-Bayesian players
- On tail probabilities for martingales
- On the Complexity of Finite Sequences
- Potential-based algorithms in on-line prediction and game theory
- Prediction in the worst case
- Prediction, Learning, and Games
- Probability Inequalities for Sums of Bounded Random Variables
- Regret in the on-line decision problem
- Regret Minimization Under Partial Monitoring
- Sequential prediction of individual sequences under general loss functions
- Some aspects of the sequential design of experiments
- Structural results about on-line learning models with and without queries
- The Nonstochastic Multiarmed Bandit Problem
- The on-line shortest path problem under partial monitoring
- The weighted majority algorithm
- Tracking the best expert
- Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence
- Universal prediction
- Universal prediction of individual binary sequences in the presence of noise
- Universal prediction of individual sequences
- Universal schemes for sequential decision from individual data sequences
- Weighted sums of certain dependent random variables
Cited in
(5)- Prediction of stochastic sequences
- Aggregation of estimators and stochastic optimization
- Finite-Memory Universal Prediction of Individual Sequences
- scientific article; zbMATH DE number 4123114 (Why is no real title available?)
- A simple randomized algorithm for sequential prediction of ergodic time series
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)
