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. 1302.1611
  4. Cited By
Bounded regret in stochastic multi-armed bandits

Bounded regret in stochastic multi-armed bandits

6 February 2013
Sébastien Bubeck
Vianney Perchet
Philippe Rigollet
ArXivPDFHTML

Papers citing "Bounded regret in stochastic multi-armed bandits"

17 / 17 papers shown
Title
Communication-Efficient Collaborative Regret Minimization in Multi-Armed
  Bandits
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits
Nikolai Karpov
Qin Zhang
21
1
0
26 Jan 2023
Anonymous Bandits for Multi-User Systems
Anonymous Bandits for Multi-User Systems
Hossein Esfandiari
Vahab Mirrokni
Jon Schneider
PICV
18
0
0
21 Oct 2022
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal
  Regret Bounds
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds
A. Mitra
Arman Adibi
George J. Pappas
Hamed Hassani
44
6
0
06 Jun 2022
Policy Optimization as Online Learning with Mediator Feedback
Policy Optimization as Online Learning with Mediator Feedback
Alberto Maria Metelli
Matteo Papini
P. DÓro
Marcello Restelli
OffRL
27
10
0
15 Dec 2020
Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic
  Optimality
Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality
Kwang-Sung Jun
Chicheng Zhang
10
10
0
15 Jun 2020
Categorized Bandits
Categorized Bandits
Matthieu Jedor
Jonathan Louëdec
Vianney Perchet
12
11
0
04 May 2020
Bounded Regret for Finitely Parameterized Multi-Armed Bandits
Bounded Regret for Finitely Parameterized Multi-Armed Bandits
Kishan Panaganti
D. Kalathil
8
1
0
03 Mar 2020
Online Allocation and Pricing: Constant Regret via Bellman Inequalities
Online Allocation and Pricing: Constant Regret via Bellman Inequalities
Alberto Vera
Siddhartha Banerjee
I. Gurvich
OffRL
14
48
0
14 Jun 2019
Batched Multi-armed Bandits Problem
Batched Multi-armed Bandits Problem
Zijun Gao
Yanjun Han
Zhimei Ren
Zhengqing Zhou
8
138
0
03 Apr 2019
Beating Stochastic and Adversarial Semi-bandits Optimally and
  Simultaneously
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously
Julian Zimmert
Haipeng Luo
Chen-Yu Wei
11
79
0
25 Jan 2019
Regional Multi-Armed Bandits
Regional Multi-Armed Bandits
Zhiyang Wang
Ruida Zhou
Cong Shen
13
18
0
22 Feb 2018
On Explore-Then-Commit Strategies
On Explore-Then-Commit Strategies
Aurélien Garivier
E. Kaufmann
Tor Lattimore
24
104
0
29 May 2016
Refined Lower Bounds for Adversarial Bandits
Refined Lower Bounds for Adversarial Bandits
Sébastien Gerchinovitz
Tor Lattimore
AAML
17
58
0
24 May 2016
Risk-Averse Multi-Armed Bandit Problems under Mean-Variance Measure
Risk-Averse Multi-Armed Bandit Problems under Mean-Variance Measure
Sattar Vakili
Qing Zhao
13
88
0
18 Apr 2016
Batched bandit problems
Batched bandit problems
Vianney Perchet
Philippe Rigollet
Sylvain Chassang
E. Snowberg
OffRL
40
199
0
02 May 2015
Learning Nash Equilibria in Congestion Games
Learning Nash Equilibria in Congestion Games
Walid Krichene
Benjamin Drighès
Alexandre M. Bayen
30
9
0
31 Jul 2014
On the Complexity of Best Arm Identification in Multi-Armed Bandit
  Models
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
E. Kaufmann
Olivier Cappé
Aurélien Garivier
48
1,013
0
16 Jul 2014
1