Zeroth Order Non-convex optimization with Dueling-Choice Bandits

Zeroth Order Non-convex optimization with Dueling-Choice Bandits

3 November 2019

Aparna R. Joshi

Aarti Singh

ArXiv (abs)PDF HTML

Papers citing "Zeroth Order Non-convex optimization with Dueling-Choice Bandits"

5 / 5 papers shown

Title
Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds Aya Kayal Sattar Vakili Laura Toni Da-shan Shiu A. Bernacchia 26 0 0 29 May 2025
Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation Xiaoyu Chen Han Zhong Zhuoran Yang Zhaoran Wang Liwei Wang 180 70 0 23 May 2022
Procrastinated Tree Search: Black-box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback Junxiong Wang D. Basu Immanuel Trummer 127 3 0 14 Oct 2021
Bias-Robust Bayesian Optimization via Dueling Bandits Johannes Kirschner Andreas Krause 48 11 0 25 May 2021
Preference-based Reinforcement Learning with Finite-Time Guarantees Yichong Xu Ruosong Wang Lin F. Yang Aarti Singh A. Dubrawski 106 60 0 16 Jun 2020