ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2306.12383
  4. Cited By
Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and
  Optimal Algorithms
v1v2v3 (latest)

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

21 June 2023
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
539
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
1