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. 2103.02729
  4. Cited By
Linear Bandit Algorithms with Sublinear Time Complexity

Linear Bandit Algorithms with Sublinear Time Complexity

3 March 2021
Shuo Yang
Tongzheng Ren
Sanjay Shakkottai
Eric Price
Inderjit S. Dhillon
Sujay Sanghavi
ArXivPDFHTML

Papers citing "Linear Bandit Algorithms with Sublinear Time Complexity"

2 / 2 papers shown
Title
Breaking the Linear Iteration Cost Barrier for Some Well-known
  Conditional Gradient Methods Using MaxIP Data-structures
Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures
Anshumali Shrivastava
Zhao-quan Song
Zhaozhuo Xu
23
28
0
30 Nov 2021
Achieving User-Side Fairness in Contextual Bandits
Achieving User-Side Fairness in Contextual Bandits
Wen Huang
Kevin Labille
Xintao Wu
Dongwon Lee
Neil T. Heffernan
FaML
62
18
0
22 Oct 2020
1