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. 1904.01763
  4. Cited By
Batched Multi-armed Bandits Problem

Batched Multi-armed Bandits Problem

3 April 2019
Zijun Gao
Yanjun Han
Zhimei Ren
Zhengqing Zhou
ArXivPDFHTML

Papers citing "Batched Multi-armed Bandits Problem"

33 / 33 papers shown
Title
Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits
Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits
Jiabin Lin
Shana Moothedath
Namrata Vaswani
64
4
0
08 Jan 2025
Batched Stochastic Bandit for Nondegenerate Functions
Batched Stochastic Bandit for Nondegenerate Functions
Yu Liu
Yunlu Shu
Tianyu Wang
52
0
0
09 May 2024
Generalized Linear Bandits with Limited Adaptivity
Generalized Linear Bandits with Limited Adaptivity
Ayush Sawarni
Nirjhar Das
Siddharth Barman
Gaurav Sinha
42
3
0
10 Apr 2024
Batched Nonparametric Contextual Bandits
Batched Nonparametric Contextual Bandits
Rong Jiang
Cong Ma
OffRL
39
1
0
27 Feb 2024
Stochastic contextual bandits with graph feedback: from independence
  number to MAS number
Stochastic contextual bandits with graph feedback: from independence number to MAS number
Yuxiao Wen
Yanjun Han
Zhengyuan Zhou
44
1
0
12 Feb 2024
Replicability is Asymptotically Free in Multi-armed Bandits
Replicability is Asymptotically Free in Multi-armed Bandits
Junpei Komiyama
Shinji Ito
Yuichi Yoshida
Souta Koshino
35
1
0
12 Feb 2024
Best Arm Identification in Batched Multi-armed Bandit Problems
Best Arm Identification in Batched Multi-armed Bandit Problems
Sheng Cao
Simai He
Ruoqing Jiang
Jin Xu
Hongsong Yuan
15
1
0
21 Dec 2023
Optimal Batched Best Arm Identification
Optimal Batched Best Arm Identification
Tianyuan Jin
Yu Yang
Jing Tang
Xiaokui Xiao
Pan Xu
46
3
0
21 Oct 2023
Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal
  Individual Regret and Constant Communication Costs
Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs
L. Yang
Xuchuang Wang
Mohammad Hajiesmaili
Lijun Zhang
John C. S. Lui
Don Towsley
38
5
0
08 Aug 2023
Policy Finetuning in Reinforcement Learning via Design of Experiments
  using Offline Data
Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data
Ruiqi Zhang
Andrea Zanette
OffRL
OnRL
42
7
0
10 Jul 2023
Allocating Divisible Resources on Arms with Unknown and Random Rewards
Allocating Divisible Resources on Arms with Unknown and Random Rewards
Ningyuan Chen
Wenhao Li
24
0
0
28 Jun 2023
Sequential Counterfactual Risk Minimization
Sequential Counterfactual Risk Minimization
Houssam Zenati
Eustache Diemert
Matthieu Martin
Julien Mairal
Pierre Gaillard
OffRL
29
3
0
23 Feb 2023
A Reduction-based Framework for Sequential Decision Making with Delayed
  Feedback
A Reduction-based Framework for Sequential Decision Making with Delayed Feedback
Yunchang Yang
Hangshi Zhong
Tianhao Wu
B. Liu
Liwei Wang
S. Du
OffRL
29
8
0
03 Feb 2023
Communication-Efficient Collaborative Regret Minimization in Multi-Armed
  Bandits
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits
Nikolai Karpov
Qin Zhang
36
1
0
26 Jan 2023
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear
  Bandit Algorithms
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms
Osama A. Hanna
Lin F. Yang
Christina Fragouli
27
11
0
08 Nov 2022
Anonymous Bandits for Multi-User Systems
Anonymous Bandits for Multi-User Systems
Hossein Esfandiari
Vahab Mirrokni
Jon Schneider
PICV
26
0
0
21 Oct 2022
Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning
Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning
Zihan Zhang
Yuhang Jiang
Yuanshuo Zhou
Xiangyang Ji
OffRL
26
9
0
15 Oct 2022
Reward Imputation with Sketching for Contextual Batched Bandits
Reward Imputation with Sketching for Contextual Batched Bandits
Xiao Zhang
Ninglu Shao
Zihua Si
Jun Xu
Wen Wang
Hanjing Su
Jirong Wen
OffRL
25
1
0
13 Oct 2022
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit
  Problem
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
Arpit Agarwal
R. Ghuge
V. Nagarajan
25
1
0
25 Sep 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost
Dan Qiao
Ming Yin
Ming Min
Yu Wang
43
28
0
13 Feb 2022
Stochastic differential equations for limiting description of UCB rule
  for Gaussian multi-armed bandits
Stochastic differential equations for limiting description of UCB rule for Gaussian multi-armed bandits
S. Garbar
16
0
0
13 Dec 2021
Recent Advances in Reinforcement Learning in Finance
Recent Advances in Reinforcement Learning in Finance
B. Hambly
Renyuan Xu
Huining Yang
OffRL
29
168
0
08 Dec 2021
Safe Data Collection for Offline and Online Policy Learning
Safe Data Collection for Offline and Online Policy Learning
Ruihao Zhu
Branislav Kveton
OffRL
19
5
0
08 Nov 2021
Online Learning of Energy Consumption for Navigation of Electric
  Vehicles
Online Learning of Energy Consumption for Navigation of Electric Vehicles
Niklas Åkerblom
Yuxin Chen
M. Chehreghani
30
12
0
03 Nov 2021
Batched Thompson Sampling for Multi-Armed Bandits
Batched Thompson Sampling for Multi-Armed Bandits
Nikolai Karpov
Qin Zhang
19
4
0
15 Aug 2021
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs
Chloé Rouyer
Yevgeny Seldin
Nicolò Cesa-Bianchi
AAML
21
24
0
19 Feb 2021
Provably Efficient Reinforcement Learning with Linear Function
  Approximation Under Adaptivity Constraints
Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints
Chi Jin
Zhuoran Yang
Zhaoran Wang
OffRL
122
167
0
06 Jan 2021
Linear Bandits with Limited Adaptivity and Learning Distributional
  Optimal Design
Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design
Yufei Ruan
Jiaqi Yang
Yuanshuo Zhou
OffRL
102
51
0
04 Jul 2020
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for
  Contextual Bandits under Realizability
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability
D. Simchi-Levi
Yunzong Xu
OffRL
47
107
0
28 Mar 2020
Inference for Batched Bandits
Inference for Batched Bandits
Kelly W. Zhang
Lucas Janson
Susan Murphy
28
80
0
08 Feb 2020
Regret Bounds for Batched Bandits
Regret Bounds for Batched Bandits
Hossein Esfandiari
Amin Karbasi
Abbas Mehrabian
Vahab Mirrokni
33
61
0
11 Oct 2019
Phase Transitions in Bandits with Switching Constraints
Phase Transitions in Bandits with Switching Constraints
D. Simchi-Levi
Yunzong Xu
8
9
0
26 May 2019
Bounded regret in stochastic multi-armed bandits
Bounded regret in stochastic multi-armed bandits
Sébastien Bubeck
Vianney Perchet
Philippe Rigollet
71
91
0
06 Feb 2013
1