Logarithmic regret algorithms for online convex optimization
暂无分享,去创建一个
[1] James Hannan,et al. 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .
[2] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1989, 30th Annual Symposium on Foundations of Computer Science.
[3] Neil D. Pearson,et al. Consumption and Portfolio Policies With Incomplete Markets and Short‐Sale Constraints: the Finite‐Dimensional Case , 1991 .
[4] Kurt S. Riedel,et al. A Sherman-Morrison-Woodbury Identity for Rank Augmenting Matrices with Application to Centering , 1992, SIAM J. Matrix Anal. Appl..
[5] Neri Merhav,et al. Universal sequential learning and decision from individual data sequences , 1992, COLT '92.
[6] T. Cover. Universal Portfolios , 1996 .
[7] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[8] Manfred K. Warmuth,et al. Averaging Expert Predictions , 1999, EuroCOLT.
[9] Fabio Stella,et al. Stochastic Nonstationary Optimization for Finding Universal Portfolios , 2000, Ann. Oper. Res..
[10] Santosh S. Vempala,et al. Efficient algorithms for universal portfolios , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[11] James C. Spall,et al. Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.
[12] Santosh S. Vempala,et al. Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[13] S. Vempala,et al. The Geometry of Logconcave Functions and an O* (n 3 ) Sampling Algorithm , 2003 .
[14] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[15] Adam Tauman Kalai,et al. Universal Portfolios With and Without Transaction Costs , 1997, COLT '97.
[16] Manfred K. Warmuth,et al. Relative Loss Bounds for Multidimensional Regression Problems , 1997, Machine Learning.
[17] Adam Tauman Kalai,et al. Online convex optimization in the bandit setting: gradient descent without a gradient , 2004, SODA '05.
[18] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, Journal of computer and system sciences (Print).
[19] Elad Hazan,et al. Efficient Algorithms for Online Game Playing and Universal Portfolio Management , 2006, Electron. Colloquium Comput. Complex..
[20] Santosh S. Vempala,et al. Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..
[21] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[22] Elad Hazan,et al. New Algorithms for Repeated Play and Universal Portfolio Management , 2006 .
[23] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[24] Sanjeev Arora,et al. Efficient algorithms for online convex optimization and their applications , 2006 .