暂无分享,去创建一个
[1] B. Klartag. On convex perturbations with a bounded isotropic constant , 2006 .
[2] Sébastien Bubeck,et al. Bandit Convex Optimization : √ T Regret in One Dimension , 2015 .
[3] Sham M. Kakade,et al. Stochastic Convex Optimization with Bandit Feedback , 2011, SIAM J. Optim..
[4] Benjamin Van Roy,et al. An Information-Theoretic Analysis of Thompson Sampling , 2014, J. Mach. Learn. Res..
[5] Robert D. Kleinberg. Nearly Tight Bounds for the Continuum-Armed Bandit Problem , 2004, NIPS.
[6] Benjamin Van Roy,et al. Learning to Optimize via Information-Directed Sampling , 2014, NIPS.
[7] Ricardo G. Durán,et al. An optimal Poincare inequality in L^1 for convex domains , 2003 .
[8] Sébastien Bubeck,et al. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..
[9] Adam Tauman Kalai,et al. Online convex optimization in the bandit setting: gradient descent without a gradient , 2004, SODA '05.