scientific article; zbMATH DE number 7064063
From MaRDI portal
zbMath1489.62017arXiv1809.01382MaRDI QIDQ5381137
Stéphane Gaïffas, Jaouad Mourtada
Publication date: 7 June 2019
Full work available at URL: https://arxiv.org/abs/1809.01382
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sequential statistical analysis (62L10) Online algorithms; streaming algorithms (68W27) Compound decision problems in statistical decision theory (62C25)
Related Items
Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Risk bounds for statistical learning
- A game of prediction with expert advice
- The weighted majority algorithm
- A decision-theoretic generalization of on-line learning and an application to boosting
- Smooth discrimination analysis
- Adaptive and self-confident on-line learning algorithms
- Optimal aggregation of classifiers in statistical learning.
- Fano's inequality for random variables
- Empirical minimization
- Weighted sums of certain dependent random variables
- Theory of Classification: a Survey of Some Recent Advances
- How to use expert advice
- Prediction with Expert Advice under Discounted Loss
- Probability Inequalities for Sums of Bounded Random Variables
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Prediction, Learning, and Games
- Learning Theory
- Introduction to Online Convex Optimization
- Introduction to nonparametric estimation
