Logarithmic regret algorithms for online convex optimization
Top Cited Papers
- 8 August 2007
- journal article
- research article
- Published by Springer Nature in Machine Learning
- Vol. 69 (2-3) , 169-192
- https://doi.org/10.1007/s10994-007-5016-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Prediction, Learning, and GamesPublished by Cambridge University Press (CUP) ,2006
- Efficient algorithms for online decision problemsJournal of Computer and System Sciences, 2004
- Convex OptimizationPublished by Cambridge University Press (CUP) ,2004
- Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Stochastic Nonstationary Optimization for Finding Universal PortfoliosAnnals of Operations Research, 2000
- Averaging Expert PredictionsPublished by Springer Nature ,1999
- Universal portfolios with and without transaction costsPublished by Association for Computing Machinery (ACM) ,1997
- A new algorithm for minimizing convex functions over convex setsMathematical Programming, 1996
- Universal sequential learning and decision from individual data sequencesPublished by Association for Computing Machinery (ACM) ,1992
- Universal PortfoliosMathematical Finance, 1991