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. 2106.10935
  4. Cited By
On Limited-Memory Subsampling Strategies for Bandits

On Limited-Memory Subsampling Strategies for Bandits

21 June 2021
Dorian Baudry
Yoan Russac
Olivier Cappé
ArXivPDFHTML

Papers citing "On Limited-Memory Subsampling Strategies for Bandits"

7 / 7 papers shown
Title
Forced Exploration in Bandit Problems
Forced Exploration in Bandit Problems
Han Qi
Fei-Yu Guo
Li Zhu
23
0
0
12 Dec 2023
Discounted Thompson Sampling for Non-Stationary Bandit Problems
Discounted Thompson Sampling for Non-Stationary Bandit Problems
Han Qi
Yue Wang
Li Zhu
40
4
0
18 May 2023
A General Recipe for the Analysis of Randomized Multi-Armed Bandit
  Algorithms
A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms
Dorian Baudry
Kazuya Suzuki
Junya Honda
29
4
0
10 Mar 2023
Constriction for sets of probabilities
Constriction for sets of probabilities
Michele Caprio
Teddy Seidenfeld
6
6
0
13 Jan 2023
Towards an efficient and risk aware strategy for guiding farmers in
  identifying best crop management
Towards an efficient and risk aware strategy for guiding farmers in identifying best crop management
Romain Gautron
Dorian Baudry
M. Adam
G. Falconnier
M. Corbeels
24
0
0
10 Oct 2022
Efficient Algorithms for Extreme Bandits
Efficient Algorithms for Extreme Bandits
Dorian Baudry
Yoan Russac
E. Kaufmann
19
3
0
21 Mar 2022
From Optimality to Robustness: Dirichlet Sampling Strategies in
  Stochastic Bandits
From Optimality to Robustness: Dirichlet Sampling Strategies in Stochastic Bandits
Dorian Baudry
Patrick Saux
Odalric-Ambrym Maillard
17
7
0
18 Nov 2021
1