scientific article; zbMATH DE number 6860795

zbMath1435.68277arXiv1403.3465MaRDI QIDQ4637004

H. Brendan McMahan

Publication date: 17 April 2018

Full work available at URL: https://arxiv.org/abs/1403.3465

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

online learningadaptive algorithmsdual averagingmirror descentonline convex optimizationregret analysisfollow-the-regularized-leader

Mathematics Subject Classification ID

Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Online algorithms; streaming algorithms (68W27)

Related Items (10)

Unifying mirror descent and dual averaging ⋮ Comprehensive study of variational Bayes classification for dense deep neural networks ⋮ Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization ⋮ Principal component analysis and optimal portfolio ⋮ Sequential testing for elicitable functionals via supermartingales ⋮ Technical Note—Nonstationary Stochastic Optimization Under L_p,q-Variation Measures ⋮ Accelerated dual-averaging primal–dual method for composite convex minimization ⋮ Kernel-based online regression with canal loss ⋮ A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds ⋮ Make \(\ell_1\) regularization effective in training sparse CNN

Uses Software

• AdaBoost.MH
• AdaGrad

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• On the delay-differential equations x'(t) + a(t)f(x(t - r(t))) = 0 and x(t) + a(t)f(x(t - r(t)))=0
• A decision-theoretic generalization of on-line learning and an application to boosting
• Introductory lectures on convex optimization. A basic course.
• Adaptive and self-confident on-line learning algorithms
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Online Learning and Online Convex Optimization
• On the Generalization Ability of On-Line Learning Algorithms
• 10.1162/153244302760200704
• Online Learning Meets Optimization in the Dual
• Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking
• Prediction, Learning, and Games
• Convex Analysis
• STABILITY RESULTS IN LEARNING THEORY

This page was built for publication: