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. 2107.04518
  4. Cited By
Optimal Gradient-based Algorithms for Non-concave Bandit Optimization

Optimal Gradient-based Algorithms for Non-concave Bandit Optimization

9 July 2021
Baihe Huang
Kaixuan Huang
Sham Kakade
Jason D. Lee
Qi Lei
Runzhe Wang
Jiaqi Yang
ArXiv (abs)PDFHTML

Papers citing "Optimal Gradient-based Algorithms for Non-concave Bandit Optimization"

4 / 4 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
Online Learning in Stackelberg Games with an Omniscient Follower
Online Learning in Stackelberg Games with an Omniscient Follower
Geng Zhao
Banghua Zhu
Jiantao Jiao
Michael I. Jordan
417
15
0
27 Jan 2023
Online Low Rank Matrix Completion
Online Low Rank Matrix Completion
Prateek Jain
S. Pal
83
9
0
08 Sep 2022
Going Beyond Linear RL: Sample Efficient Neural Function Approximation
Going Beyond Linear RL: Sample Efficient Neural Function Approximation
Baihe Huang
Kaixuan Huang
Sham Kakade
Jason D. Lee
Qi Lei
Runzhe Wang
Jiaqi Yang
96
8
0
14 Jul 2021
1