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. 1205.4094
  4. Cited By
Bandit Theory meets Compressed Sensing for high dimensional Stochastic
  Linear Bandit

Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit

18 May 2012
Alexandra Carpentier
Rémi Munos
ArXivPDFHTML

Papers citing "Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit"

2 / 2 papers shown
Title
Model Selection in Contextual Stochastic Bandit Problems
Model Selection in Contextual Stochastic Bandit Problems
Aldo Pacchiano
My Phan
Yasin Abbasi-Yadkori
Anup B. Rao
Julian Zimmert
Tor Lattimore
Csaba Szepesvári
156
94
0
03 Mar 2020
Minimax Policies for Combinatorial Prediction Games
Minimax Policies for Combinatorial Prediction Games
Jean-Yves Audibert
Sébastien Bubeck
Gabor Lugosi
OffRL
163
81
0
24 May 2011
1