An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback

31 July 2015

Papers citing "An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback"

7 / 107 papers shown

Title
SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator Cong Fang C. J. Li Zhouchen Lin Tong Zhang 133 580 0 04 Jul 2018
Minimizing Regret of Bandit Online Optimization in Unconstrained Action Spaces T. Tatarenko Maryam Kamgarpour 40 2 0 13 Jun 2018
Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization Sijia Liu B. Kailkhura Pin-Yu Chen Pai-Shun Ting Shiyu Chang Lisa Amini 132 185 0 25 May 2018
Regret Analysis for Continuous Dueling Bandit Wataru Kumagai 127 28 0 21 Nov 2017
Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications Sijia Liu Jie Chen Pin-Yu Chen Alfred Hero 70 83 0 21 Oct 2017
$Non-stationary Stochastic Optimization under $L_{p,q}$-Variation Measures$ Non-stationary Stochastic Optimization under $L_{p,q}$ -Variation Measures Xi Chen Yining Wang Yu Wang 108 12 0 09 Aug 2017
Bandit Convex Optimization for Scalable and Dynamic IoT Management Tianyi Chen G. Giannakis 93 132 0 27 Jul 2017