Logarithmic regret algorithms for online convex optimization

Issue Title: Special Issue on COLT 2006; Guest Editors: Avrim Blum, Gabor Lugosi and Hans Ulrich Simon In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After each point is chosen...

Full description

Saved in:
Bibliographic Details
Published in:Machine learning 2007-12, Vol.69 (2-3), p.169-192
Main Authors: Hazan, Elad, Agarwal, Amit, Kale, Satyen
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Convex analysis
Exact sciences and technology
Studies
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!