Online convex optimization in the bandit setting: gradient descent without a gradient
暂无分享,去创建一个
[1] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[2] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[3] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[4] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[5] V. Milman,et al. Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space , 1989 .
[6] Nicolò Cesa-Bianchi,et al. Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[7] T. Cover. Universal Portfolios , 1996 .
[8] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.
[9] Yoram Singer,et al. On‐Line Portfolio Selection Using Multiplicative Updates , 1998, ICML.
[10] Miklós Simonovits,et al. Random walks and an O*(n5) volume algorithm for convex bodies , 1997, Random Struct. Algorithms.
[11] James C. Spall,et al. A one-measurement form of simultaneous perturbation stochastic approximation , 1997, Autom..
[12] M. Simonovits,et al. Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .
[13] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..
[14] A. Frieze,et al. Log-Sobolev inequalities and sampling from log-concave distributions , 1999 .
[15] Thomas de Quincey. [C] , 2000, The Works of Thomas De Quincey, Vol. 1: Writings, 1799–1820.
[16] Santosh S. Vempala,et al. Efficient algorithms for universal portfolios , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[17] O. Granichin. Randomized Algorithms for Stochastic Approximation under Arbitrary Disturbances , 2002 .
[18] Manfred K. Warmuth,et al. Path Kernels and Multiplicative Updates , 2002, J. Mach. Learn. Res..
[19] James C. Spall,et al. Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.
[20] 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..
[21] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[22] Santosh S. Vempala,et al. Solving convex programs by random walks , 2004, JACM.
[23] Baruch Awerbuch,et al. Adaptive routing with end-to-end feedback: distributed learning and geometric approaches , 2004, STOC '04.
[24] Tim Hesterberg,et al. Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control , 2004, Technometrics.
[25] Avrim Blum,et al. Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary , 2004, COLT.
[26] Robert D. Kleinberg. Nearly Tight Bounds for the Continuum-Armed Bandit Problem , 2004, NIPS.
[27] Santosh S. Vempala,et al. Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..
[28] James C. Spall,et al. Introduction to Stochastic Search and Optimization. Estimation, Simulation, and Control (Spall, J.C. , 2007 .