ResearchTrend.AI
Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms
v1v2v3 (latest)

Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms

Qian-long Yu
Yining Wang
Baihe Huang
Qi Lei
Jason D. Lee
ArXiv (abs)PDFHTML

Papers citing "Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms"

2 / 2 papers shown
Title
Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
Aleksandrs Slivkins
Yunzong Xu
Shiliang Zuo
537
1
0
06 Mar 2025
Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
Qian-long Yu
Yining Wang
Baihe Huang
Qi Lei
Jason D. Lee
ODL
61
1
0
28 Jun 2024