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. 1703.00048
  4. Cited By
Provably Optimal Algorithms for Generalized Linear Contextual Bandits

Provably Optimal Algorithms for Generalized Linear Contextual Bandits

28 February 2017
Lihong Li
Yu Lu
Dengyong Zhou
ArXivPDFHTML

Papers citing "Provably Optimal Algorithms for Generalized Linear Contextual Bandits"

6 / 6 papers shown
Title
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Alekh Agarwal
Daniel J. Hsu
Satyen Kale
John Langford
Lihong Li
Robert Schapire
OffRL
256
504
0
04 Feb 2014
Learning to Optimize Via Posterior Sampling
Learning to Optimize Via Posterior Sampling
Daniel Russo
Benjamin Van Roy
163
699
0
11 Jan 2013
A Contextual-Bandit Approach to Personalized News Article Recommendation
A Contextual-Bandit Approach to Personalized News Article Recommendation
Lihong Li
Wei Chu
John Langford
Robert Schapire
333
2,935
0
28 Feb 2010
Contextual Bandit Algorithms with Supervised Learning Guarantees
Contextual Bandit Algorithms with Supervised Learning Guarantees
A. Beygelzimer
John Langford
Lihong Li
L. Reyzin
Robert Schapire
OffRL
166
324
0
22 Feb 2010
Linearly Parameterized Bandits
Linearly Parameterized Bandits
Paat Rusmevichientong
J. Tsitsiklis
259
558
0
18 Dec 2008
Simultaneous analysis of Lasso and Dantzig selector
Simultaneous analysis of Lasso and Dantzig selector
Peter J. Bickel
Yaácov Ritov
Alexandre B. Tsybakov
388
2,527
0
07 Jan 2008
1