Logarithmic regret algorithms for online convex optimization
type: Item
instance of: scholarly article
title: Logarithmic regret algorithms for online convex optimization
zbMATH Open document ID: 1471.68327
author: Elad Hazan
author: Amit Agarwal
author: Satyen Kale
published in: Machine Learning
publication date: 2009-03-31T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 91G10
zbMATH DE Number: 5537344
zbMATH Keywords: online learning
zbMATH Keywords: online optimization
zbMATH Keywords: regret minimization
zbMATH Keywords: portfolio management
MaRDI profile type: Publication
full work available at URL: s10994-007-5016-8
OpenAlex ID: W2129160848
cites work: Universal portfolios with and without transaction costs.
cites work: Communicating Sequential Processes. The First 25 Years
cites work: Q4821526
cites work: Prediction, Learning, and Games
cites work: Universal Portfolios
cites work: Stochastic nonstationary optimization for finding universal portfolios
cites work: Q3245635
cites work: 10.1162/153244303321897672
cites work: Efficient algorithms for online decision problems
cites work: Relative loss bounds for multidimensional regression problems
cites work: Applications of second-order cone programming
cites work: A new algorithm for minimizing convex functions over convex sets
DOI: 10.1007/S10994-007-5016-8
description: scientific article; zbMATH DE number 5537344