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. 2402.12042
  4. Cited By
Linear bandits with polylogarithmic minimax regret
v1v2 (latest)

Linear bandits with polylogarithmic minimax regret

19 February 2024
Josep Lumbreras
Marco Tomamichel
ArXiv (abs)PDFHTML

Papers citing "Linear bandits with polylogarithmic minimax regret"

3 / 3 papers shown
Title
A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
Jingxin Zhan
Yuchen Xin
Kaicheng Jin
Zhihua Zhang
155
0
0
19 Jan 2025
Exploration in Linear Bandits with Rich Action Sets and its Implications
  for Inference
Exploration in Linear Bandits with Rich Action Sets and its Implications for Inference
Debangshu Banerjee
Avishek Ghosh
Sayak Ray Chowdhury
Aditya Gopalan
52
9
0
23 Jul 2022
On the Complexity of Bandit Linear Optimization
On the Complexity of Bandit Linear Optimization
Ohad Shamir
110
14
0
11 Aug 2014
1