Optimal learning with Bernstein Online Aggregation
From MaRDI portal
Publication:72768
DOI10.48550/arXiv.1404.1356zbMath1412.68196arXiv1404.1356OpenAlexW1835684196MaRDI QIDQ72768
Olivier Wintenberger, Olivier Wintenberger
Publication date: 4 April 2014
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.1356
Related Items (6)
Exponential weights in multivariate regression and a low-rankness favoring prior ⋮ Stochastic online convex optimization. Application to probabilistic time series forecasting ⋮ CRPS Learning ⋮ profoc ⋮ A quasi-Bayesian perspective to online clustering ⋮ Explainable online ensemble of deep neural network pruning for time series forecasting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kullback-Leibler aggregation and misspecified generalized linear models
- Deviation optimal learning using greedy \(Q\)-aggregation
- Aggregation via empirical risk minimization
- Learning by mirror averaging
- Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
- On tail probabilities for martingales
- Extracting certainty from uncertainty: regret bounded by variation in costs
- Fast learning rates in statistical inference through aggregation
- Optimal learning with \textit{Q}-aggregation
- The Generalization Ability of Online Algorithms for Dependent Data
- Asymptotic evaluation of certain markov process expectations for large time, I
- Sequential prediction of individual sequences under general loss functions
- Learning Theory and Kernel Machines
- Sparsity regret bounds for individual sequences in online linear regression
- Prediction of time series by statistical learning: general losses and fast rates
- Prediction, Learning, and Games
- Learning Theory
- Learning Theory
- Learning Theory
This page was built for publication: Optimal learning with Bernstein Online Aggregation
