Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Memory and learning in psychology (91E40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Potential-based algorithms in on-line prediction and game theory
- On prediction of individual sequences
- Strategic conversations under imperfect information: epistemic message exchange games
- Consensus in opinion dynamics as a repeated game
- Improving multi-armed bandit algorithms in online pricing settings
- The query complexity of correlated equilibria
- Using the Bayesian Shtarkov solution for predictions
- A general procedure to combine estimators
- Open problems in universal induction \& intelligence
- On minimaxity of follow the leader strategy in the stochastic setting
- Two queues with non-stochastic arrivals
- Risk management strategies for finding universal portfolios
- Scale-free online learning
- Gaussian process bandits with adaptive discretization
- Randomized prediction of individual sequences
- Online estimation of discrete, continuous, and conditional joint densities using classifier chains
- Smooth calibration, leaky forecasts, finite recall, and Nash dynamics
- Sampled fictitious play is Hannan consistent
- Dominant-set clustering: a review
- A quasi-Bayesian perspective to online clustering
- Stochastic optimization for real time service capacity allocation under random service demand
- Common learning with intertemporal dependence
- Sharp oracle inequalities for aggregation of affine estimators
- Forecasting electricity consumption by aggregating specialized experts
- Online multiple kernel classification
- Relational networks of conditional preferences
- Upper bounds and aggregation in bipartite ranking
- Dynamics of Bayesian updating with dependent data and misspecified models
- Training parsers by inverse reinforcement learning
- Extracting certainty from uncertainty: regret bounded by variation in costs
- The security of machine learning
- Derandomizing stochastic prediction strategies
- Designing coalition-based fair and stable pricing mechanisms under private information on consumers' reservation prices
- Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
- Covariance-based dissimilarity measures applied to clustering wide-sense stationary ergodic processes
- Sequential model aggregation for production forecasting
- Convergence of stochastic proximal gradient algorithm
- An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
- Approachability with constraints
- Improved regret for zeroth-order adversarial bandit convex optimisation
- Relative utility bounds for empirically optimal portfolios
- Learning (to disagree?) in large worlds
- Two-armed bandit problem and batch version of the mirror descent algorithm
- Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials
- A general equilibrium model of investor sentiment
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- A unified framework for online trip destination prediction
- Suboptimality of constrained least squares and improvements via non-linear predictors
- MedleySolver: online SMT algorithm selection
- Online joint bid/daily budget optimization of Internet advertising campaigns
- PAC-Bayesian lifelong learning for multi-armed bandits
- The platform design problem
- Testing facility location and dynamic capacity planning for pandemics with demand uncertainty
- Online ordering rules for the multi-period newsvendor problem with quantity discounts
- Constrained no-regret learning
- Handling concept drift via model reuse
- Gaussian two-armed bandit and optimization of batch data processing
- High-dimensional VAR with low-rank transition
- Aggregation of estimators and stochastic optimization
- Optimal probability aggregation based on generalized Brier scoring
- On biased random walks, corrupted intervals, and learning under adversarial design
- Fictitious play in networks
- Fano's inequality for random variables
- Integer programming ensemble of temporal relations classifiers
- On the asymptotic optimality of the comb strategy for prediction with expert advice
- Additive stacking for disaggregate electricity demand forecasting
- Tune and mix: learning to rank using ensembles of calibrated multi-class classifiers
- Regret bounded by gradual variation for online convex optimization
- Generalised entropies and asymptotic complexities of languages
- Probability-free solutions to the non-stationary newsvendor problem
- Committee, expert advice, and the weighted majority algorithm: an application to the pricing decision of a monopolist
- Stable games and their dynamics
- A differential game on Wasserstein space. Application to weak approachability with partial monitoring
- Mistake bounds on the noise-free multi-armed bandit game
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds
- Scale-invariant unconstrained online learning
- A survey of network interdiction models and algorithms
- Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
- Online Bayesian max-margin subspace learning for multi-view classification and regression
- Prediction with expert advice: a PDE perspective
- Exploiting problem structure in optimization under uncertainty via online convex optimization
- Aggregating algorithm for prediction of packs
- Meta-inductive prediction based on attractivity weighting: mathematical and empirical performance evaluation
- New insights on concentration inequalities for self-normalized martingales
- Exponential weight approachability, applications to calibration and regret minimization
- On efficient randomized algorithms for finding the PageRank vector
- On the efficiency of a randomized mirror descent algorithm in online optimization problems
- A normalized value for information purchases
- Improved second-order bounds for prediction with expert advice
- Guest editorial: Learning theory
- Fast learning rates in statistical inference through aggregation
- Approachability with bounded memory
- Hedge algorithm and dual averaging schemes
- Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case
This page was built for publication: Prediction, Learning, and Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470194)
