Logarithmic Regret Algorithms for Online Convex Optimization
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 499-513
- https://doi.org/10.1007/11776420_37
Abstract
No abstract availableKeywords
This publication has 10 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
- Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Introduction to Stochastic Search and OptimizationPublished by Wiley ,2003
- 10.1162/153244303321897672Applied Physics Letters, 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 PortfoliosMathematical Finance, 1991
- 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAYPublished by Walter de Gruyter GmbH ,1958