ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 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

Neural Information Processing Systems (NeurIPS), 2021
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"

11 / 11 papers shown
Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits
Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits
Federico Cinus
Yuko Kuroki
Atsushi Miyauchi
Francesco Bonchi
149
1
0
01 Oct 2025
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
984
3
0
06 Mar 2025
Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
Yuzhou Gu
Yanjun Han
Jian Qian
372
1
0
01 Mar 2025
Efficient Low-Rank Matrix Estimation, Experimental Design, and
  Arm-Set-Dependent Low-Rank Bandits
Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits
Kyoungseok Jang
Chicheng Zhang
Kwang-Sung Jun
349
5
0
17 Feb 2024
Toward $L_\infty$-recovery of Nonlinear Functions: A Polynomial Sample
  Complexity Bound for Gaussian Random Fields
Toward L∞L_\inftyL∞​-recovery of Nonlinear Functions: A Polynomial Sample Complexity Bound for Gaussian Random FieldsAnnual Conference Computational Learning Theory (COLT), 2023
Kefan Dong
Tengyu Ma
384
4
0
29 Apr 2023
Statistical Complexity and Optimal Algorithms for Non-linear Ridge
  Bandits
Statistical Complexity and Optimal Algorithms for Non-linear Ridge BanditsAnnals of Statistics (Ann. Stat.), 2023
Nived Rajaraman
Yanjun Han
Jiantao Jiao
Kannan Ramchandran
597
6
0
12 Feb 2023
Online Learning in Stackelberg Games with an Omniscient Follower
Online Learning in Stackelberg Games with an Omniscient FollowerInternational Conference on Machine Learning (ICML), 2023
Geng Zhao
Banghua Zhu
Jiantao Jiao
Michael I. Jordan
768
20
0
27 Jan 2023
Online Low Rank Matrix Completion
Online Low Rank Matrix CompletionInternational Conference on Learning Representations (ICLR), 2022
Prateek Jain
S. Pal
360
12
0
08 Sep 2022
Nearly Minimax Algorithms for Linear Bandits with Shared Representation
Nearly Minimax Algorithms for Linear Bandits with Shared Representation
Jiaqi Yang
Qi Lei
Jason D. Lee
S. Du
349
16
0
29 Mar 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
230
10
0
14 Jul 2021
Bandit Phase Retrieval
Bandit Phase RetrievalNeural Information Processing Systems (NeurIPS), 2021
Tor Lattimore
Botao Hao
190
16
0
03 Jun 2021
1
Page 1 of 1