Randomized prediction of individual sequences
type: Item
instance of: scholarly article
title: Randomized prediction of individual sequences
zbMATH Open document ID: 1409.60063
author: Gábor Lugosi
published in: Journal de la Société Française de Statistique
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 60G25
zbMATH DE Number: 7040025
MaRDI profile type: Publication
cites work: 10.1162/153244303321897663
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Structural results about on-line learning models with and without queries
cites work: Adaptive routing with end-to-end feedback
cites work: Weighted sums of certain dependent random variables
cites work: On Pseudo-Games
cites work: Q3809068
cites work: An analog of the minimax theorem for vector payoffs
cites work: Q3234879
cites work: 10.1162/153244303321897654
cites work: Analysis of two gradient-based algorithms for on-line regression
cites work: How to use expert advice
cites work: On prediction of individual sequences
cites work: Potential-based algorithms in on-line prediction and game theory
cites work: Prediction, Learning, and Games
cites work: Learning Theory
cites work: Regret Minimization Under Partial Monitoring
cites work: Universal prediction of individual sequences
cites work: Prediction in the worst case
cites work: Asymptotic calibration
cites work: Regret in the on-line decision problem
cites work: On tail probabilities for martingales
cites work: Q4223194
cites work: Q4692329
cites work: Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding
cites work: Q3174159
cites work: Q3245635
cites work: A Simple Adaptive Procedure Leading to Correlated Equilibrium
cites work: A general class of adaptive strategies
cites work: Q4552708
cites work: Sequential prediction of individual sequences under general loss functions
cites work: Apple tasting.
cites work: Tracking the best expert
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Learning Theory and Kernel Machines
cites work: Asymptotically efficient adaptive allocation rules
cites work: On the Complexity of Finite Sequences
cites work: The weighted majority algorithm
cites work: On repeated games with incomplete information played by non-Bayesian players
cites work: Universal schemes for sequential decision from individual data sequences
cites work: Universal prediction
cites work: Q4114574
cites work: Q3148807
cites work: Some aspects of the sequential design of experiments
cites work: Minimizing regret: The general case
cites work: 10.1162/1532443041424328
cites work: A game of prediction with expert advice
cites work: Derandomizing stochastic prediction strategies
cites work: Competitive On-line Statistics
cites work: Universal prediction of individual binary sequences in the presence of noise
cites work: Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence
cites work: Coding theorems for individual sequences
cites work: Distortion-rate theory for individual sequences
cites work: A universal algorithm for sequential data compression
description: scientific article; zbMATH DE number 7040025