scientific article; zbMATH DE number 7415104

MaRDI QIDQ5159437

Tim van Erven, Wouter M. Koolen, Dirk van der Hoeven

Publication date: 27 October 2021

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

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

zbMATH Keywords

adaptivityonline convex optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization ⋮ Stochastic online convex optimization. Application to probabilistic time series forecasting ⋮ MetaGrad

Uses Software

• LIBSVM
• word2vec
• AdaGrad

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• A generalized online mirror descent with applications to classification and regression
• Pegasos: primal estimated sub-gradient solver for SVM
• Logarithmic regret algorithms for online convex optimization
• Introductory lectures on convex optimization. A basic course.
• Scale-free online learning
• Extracting certainty from uncertainty: regret bounded by variation in costs
• Empirical minimization
• Frequent Directions: Simple and Deterministic Matrix Sketching
• Online Learning and Online Convex Optimization

This page was built for publication: