Prediction, Learning, and Games
From MaRDI portal
Publication:5470194
DOI10.1017/CBO9780511546921zbMath1114.91001WikidataQ59538584 ScholiaQ59538584MaRDI QIDQ5470194
Nicolò Cesa-Bianchi, Gábor Lugosi
Publication date: 30 May 2006
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational learning theory (68Q32) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Learning and adaptive systems in artificial intelligence (68T05) Memory and learning in psychology (91E40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items (only showing first 100 items - show all)
Robust Bregman clustering ⋮ Robust option pricing: Hannan and Blackwell meet Black and Scholes ⋮ Robust probability updating ⋮ Lower bounds on individual sequence regret ⋮ One-pass AUC optimization ⋮ Optimal control with learning on the fly: a toy problem ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ A general internal regret-free strategy ⋮ Woodroofe's one-armed bandit problem revisited ⋮ Strategic conversations under imperfect information: epistemic message exchange games ⋮ Online passive-aggressive active learning ⋮ Sublinear time algorithms for approximate semidefinite programming ⋮ Consensus in opinion dynamics as a repeated game ⋮ Improving multi-armed bandit algorithms in online pricing settings ⋮ Bandit online optimization over the permutahedron ⋮ The query complexity of correlated equilibria ⋮ Robust mean field games ⋮ Online ordering policies for a two-product, multi-period stationary newsvendor problem ⋮ Using the Bayesian Shtarkov solution for predictions ⋮ A general procedure to combine estimators ⋮ The multi-armed bandit problem with covariates ⋮ Open problems in universal induction \& intelligence ⋮ On data-based optimal stopping under stationarity and ergodicity ⋮ On minimaxity of follow the leader strategy in the stochastic setting ⋮ Wisdom of crowds versus groupthink: learning in groups and in isolation ⋮ Two queues with non-stochastic arrivals ⋮ Exploration and exploitation of scratch games ⋮ \(\lambda \)-perceptron: an adaptive classifier for data streams ⋮ Adaptive and optimal online linear regression on \(\ell^1\)-balls ⋮ Weak aggregating algorithm for the distribution-free perishable inventory problem ⋮ Weakly universally consistent static forecasting of stationary and ergodic time series via local averaging and least squares estimates ⋮ Stochastic optimization for real time service capacity allocation under random service demand ⋮ Reducing reinforcement learning to KWIK online regression ⋮ Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model ⋮ Aggregation of predictors for nonstationary sub-linear processes and online adaptive forecasting of time varying autoregressive processes ⋮ Combining multiple strategies for multiarmed bandit problems and asymptotic optimality ⋮ Stability in large Bayesian games with heterogeneous players ⋮ Classifier evaluation and attribute selection against active adversaries ⋮ Common learning with intertemporal dependence ⋮ Learning noisy linear classifiers via adaptive and selective sampling ⋮ Sharp oracle inequalities for aggregation of affine estimators ⋮ Approximate implementation in Markovian environments ⋮ Online variance minimization ⋮ PAMR: passive aggressive mean reversion strategy for portfolio selection ⋮ Optimization of relative arbitrage ⋮ Risk management strategies for finding universal portfolios ⋮ Forecasting electricity consumption by aggregating specialized experts ⋮ Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs ⋮ QoS commitment between vertically integrated autonomous systems ⋮ How uncertain do we need to be? ⋮ Scale-free online learning ⋮ Combinatorial bandits ⋮ Sparse regression learning by aggregation and Langevin Monte-Carlo ⋮ Learning with stochastic inputs and adversarial outputs ⋮ Model selection for weakly dependent time series forecasting ⋮ Mirror averaging with sparsity priors ⋮ Gaussian process bandits with adaptive discretization ⋮ Online transfer learning ⋮ Real-time model learning using incremental sparse spectrum Gaussian process regression ⋮ Weighted last-step min-max algorithm with improved sub-logarithmic regret ⋮ Regret minimization in repeated matrix games with variable stage duration ⋮ Load balancing without regret in the bulletin board model ⋮ Strong approachability ⋮ Randomized prediction of individual sequences ⋮ Online aggregation of unbounded losses using shifting experts with confidence ⋮ Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD) ⋮ A generalized online mirror descent with applications to classification and regression ⋮ Emergence of information transfer by inductive learning ⋮ Markets, correlation, and regret-matching ⋮ Online estimation of discrete, continuous, and conditional joint densities using classifier chains ⋮ Consistency of discrete Bayesian learning ⋮ On the possibility of learning in reactive environments with arbitrary dependence ⋮ Leading strategies in competitive on-line prediction ⋮ Asymptotic sequential Rademacher complexity of a finite function class ⋮ Learning by mirror averaging ⋮ A continuous-time approach to online optimization ⋮ Smooth calibration, leaky forecasts, finite recall, and Nash dynamics ⋮ Sampled fictitious play is Hannan consistent ⋮ Dominant-set clustering: a review ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ The weak aggregating algorithm and weak mixability ⋮ Note on universal conditional consistency ⋮ CRPS Learning ⋮ Optimal learning with Bernstein Online Aggregation ⋮ How long to equilibrium? The communication complexity of uncoupled equilibrium procedures ⋮ Supermartingales in prediction with expert advice ⋮ Window-games between TCP flows ⋮ Context tree selection: a unifying view ⋮ Quantization and clustering with Bregman divergences ⋮ A quasi-Bayesian perspective to online clustering ⋮ Generalized mirror averaging and \(D\)-convex aggregation ⋮ Robust forecast combinations ⋮ Logarithmic regret algorithms for online convex optimization ⋮ Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity ⋮ Regret to the best vs. regret to the average ⋮ On-line predictive linear regression ⋮ A nonmanipulable test ⋮ Multi-agent learning for engineers ⋮ On universal algorithms for adaptive forecasting ⋮ An asymptotically optimal strategy for constrained multi-armed bandit problems
This page was built for publication: Prediction, Learning, and Games
