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.4387
  4. Cited By
Online Learning with Switching Costs and Other Adaptive Adversaries

Online Learning with Switching Costs and Other Adaptive Adversaries

18 February 2013
Nicolò Cesa-Bianchi
O. Dekel
Ohad Shamir
ArXivPDFHTML

Papers citing "Online Learning with Switching Costs and Other Adaptive Adversaries"

50 / 73 papers shown
Title
Hybrid Real- and Complex-valued Neural Network Architecture
Hybrid Real- and Complex-valued Neural Network Architecture
Alex Young
L. V. Fiorio
Bo Yang
B. Karanov
Wim J. van Houtum
Ronald M. Aarts
36
0
0
04 Apr 2025
Breaking the $\log(1/\Delta_2)$ Barrier: Better Batched Best Arm Identification with Adaptive Grids
Breaking the log⁡(1/Δ2)\log(1/\Delta_2)log(1/Δ2​) Barrier: Better Batched Best Arm Identification with Adaptive Grids
Tianyuan Jin
Qin Zhang
Dongruo Zhou
87
0
0
29 Jan 2025
The Traveling Bandit: A Framework for Bayesian Optimization with
  Movement Costs
The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs
Qiyuan Chen
Raed Al Kontar
38
1
0
18 Oct 2024
Batched Stochastic Bandit for Nondegenerate Functions
Batched Stochastic Bandit for Nondegenerate Functions
Yu Liu
Yunlu Shu
Tianyu Wang
52
0
0
09 May 2024
Learning-Augmented Algorithms with Explicit Predictors
Learning-Augmented Algorithms with Explicit Predictors
Marek Elias
Haim Kaplan
Yishay Mansour
Shay Moran
51
2
0
12 Mar 2024
Batched Nonparametric Contextual Bandits
Batched Nonparametric Contextual Bandits
Rong Jiang
Cong Ma
OffRL
39
1
0
27 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
Near-Optimal Reinforcement Learning with Self-Play under Adaptivity
  Constraints
Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints
Dan Qiao
Yu Wang
OffRL
29
3
0
02 Feb 2024
Adaptive Online Non-stochastic Control
Adaptive Online Non-stochastic Control
N. Mhaisen
Georgios Iosifidis
26
2
0
02 Oct 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
Understanding the Role of Feedback in Online Learning with Switching
  Costs
Understanding the Role of Feedback in Online Learning with Switching Costs
Duo Cheng
Xingyu Zhou
Bo Ji
11
3
0
16 Jun 2023
A Batch-to-Online Transformation under Random-Order Model
A Batch-to-Online Transformation under Random-Order Model
Jing Dong
Yuichi Yoshida
OffRL
19
1
0
12 Jun 2023
Delayed Bandits: When Do Intermediate Observations Help?
Delayed Bandits: When Do Intermediate Observations Help?
Emmanuel Esposito
Saeed Masoudian
Hao Qiu
Dirk van der Hoeven
Nicolò Cesa-Bianchi
Yevgeny Seldin
17
2
0
30 May 2023
Weighted Tallying Bandits: Overcoming Intractability via Repeated
  Exposure Optimality
Weighted Tallying Bandits: Overcoming Intractability via Repeated Exposure Optimality
Dhruv Malik
Conor Igoe
Yuanzhi Li
Aarti Singh
OffRL
21
1
0
04 May 2023
Streaming Algorithms for Learning with Experts: Deterministic Versus
  Robust
Streaming Algorithms for Learning with Experts: Deterministic Versus Robust
David P. Woodruff
Fred Zhang
Samson Zhou
23
6
0
03 Mar 2023
A Lipschitz Bandits Approach for Continuous Hyperparameter Optimization
A Lipschitz Bandits Approach for Continuous Hyperparameter Optimization
Yasong Feng
Weijian Luo
Yimin Huang
Tianyu Wang
26
8
0
03 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
32
8
0
03 Feb 2023
Sequential Strategic Screening
Sequential Strategic Screening
Lee Cohen
Saeed Sharifi-Malvajerd
Kevin Stangl
A. Vakilian
Juba Ziani
28
4
0
31 Jan 2023
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
Replicable Bandits
Replicable Bandits
Hossein Esfandiari
Alkis Kalavasis
Amin Karbasi
Andreas Krause
Vahab Mirrokni
Grigoris Velegkas
37
14
0
04 Oct 2022
Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning
  with Linear Function Approximation
Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation
Dan Qiao
Yu Wang
OffRL
75
13
0
03 Oct 2022
Doubly Fair Dynamic Pricing
Doubly Fair Dynamic Pricing
Jianyu Xu
Dan Qiao
Yu Wang
36
8
0
23 Sep 2022
Online Prediction in Sub-linear Space
Online Prediction in Sub-linear Space
Binghui Peng
Fred Zhang
28
16
0
16 Jul 2022
One Policy is Enough: Parallel Exploration with a Single Policy is
  Near-Optimal for Reward-Free Reinforcement Learning
One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learning
Pedro Cisneros-Velarde
Boxiang Lyu
Oluwasanmi Koyejo
Mladen Kolar
OffRL
34
3
0
31 May 2022
Optimal Comparator Adaptive Online Learning with Switching Cost
Optimal Comparator Adaptive Online Learning with Switching Cost
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
29
4
0
13 May 2022
Complete Policy Regret Bounds for Tallying Bandits
Complete Policy Regret Bounds for Tallying Bandits
Dhruv Malik
Yuanzhi Li
Aarti Singh
OffRL
31
2
0
24 Apr 2022
The Impact of Batch Learning in Stochastic Linear Bandits
The Impact of Batch Learning in Stochastic Linear Bandits
Danil Provodin
Pratik Gajane
Mykola Pechenizkiy
M. Kaptein
24
2
0
14 Feb 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
A Benchmark for Low-Switching-Cost Reinforcement Learning
A Benchmark for Low-Switching-Cost Reinforcement Learning
Shusheng Xu
Yancheng Liang
Yunfei Li
S. Du
Yi Wu
OffRL
22
0
0
13 Dec 2021
Bandit problems with fidelity rewards
Bandit problems with fidelity rewards
Gábor Lugosi
Ciara Pike-Burke
Pierre-André Savalle
8
0
0
25 Nov 2021
The Impact of Batch Learning in Stochastic Bandits
The Impact of Batch Learning in Stochastic Bandits
Danil Provodin
Pratik Gajane
Mykola Pechenizkiy
M. Kaptein
OffRL
27
2
0
03 Nov 2021
Lipschitz Bandits with Batched Feedback
Lipschitz Bandits with Batched Feedback
Yasong Feng
Zengfeng Huang
Tianyu Wang
21
14
0
19 Oct 2021
Gaussian Process Bandit Optimization with Few Batches
Gaussian Process Bandit Optimization with Few Batches
Zihan Li
Jonathan Scarlett
GP
135
47
0
15 Oct 2021
Batched Thompson Sampling
Batched Thompson Sampling
Cem Kalkanli
Ayfer Özgür
OffRL
62
19
0
01 Oct 2021
Batched Thompson Sampling for Multi-Armed Bandits
Batched Thompson Sampling for Multi-Armed Bandits
Nikolai Karpov
Qin Zhang
27
4
0
15 Aug 2021
Continuous Time Bandits With Sampling Costs
Continuous Time Bandits With Sampling Costs
R. Vaze
M. Hanawal
7
0
0
12 Jul 2021
Exponential Weights Algorithms for Selective Learning
Exponential Weights Algorithms for Selective Learning
Mingda Qiao
Gregory Valiant
22
1
0
29 Jun 2021
Batched Neural Bandits
Batched Neural Bandits
Quanquan Gu
Amin Karbasi
Khashayar Khosravi
Vahab Mirrokni
Dongruo Zhou
BDL
OffRL
13
25
0
25 Feb 2021
Dealing with Non-Stationarity in MARL via Trust-Region Decomposition
Dealing with Non-Stationarity in MARL via Trust-Region Decomposition
Wenhao Li
Xiangfeng Wang
Bo Jin
Junjie Sheng
H. Zha
36
7
0
21 Feb 2021
Revisiting Smoothed Online Learning
Revisiting Smoothed Online Learning
Lijun Zhang
Wei Jiang
Shiyin Lu
Tianbao Yang
6
28
0
13 Feb 2021
Lazy OCO: Online Convex Optimization on a Switching Budget
Lazy OCO: Online Convex Optimization on a Switching Budget
Uri Sherman
Tomer Koren
26
15
0
07 Feb 2021
Non-stationary Online Learning with Memory and Non-stochastic Control
Non-stationary Online Learning with Memory and Non-stochastic Control
Peng Zhao
Yu-Hu Yan
Yu Wang
Zhi-Hua Zhou
45
47
0
07 Feb 2021
Adversarial Tracking Control via Strongly Adaptive Online Learning with
  Memory
Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
26
15
0
02 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
A Provably Efficient Algorithm for Linear Markov Decision Process with
  Low Switching Cost
A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost
Minbo Gao
Tianle Xie
S. Du
Lin F. Yang
36
46
0
02 Jan 2021
Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous
  Feedback
Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback
Siwei Wang
Haoyun Wang
Longbo Huang
11
11
0
13 Dec 2020
Beyond Individual and Group Fairness
Beyond Individual and Group Fairness
Pranjal Awasthi
Corinna Cortes
Yishay Mansour
M. Mohri
FaML
25
22
0
21 Aug 2020
Multinomial Logit Bandit with Low Switching Cost
Multinomial Logit Bandit with Low Switching Cost
Kefan Dong
Yingkai Li
Qin Zhang
Yuanshuo Zhou
19
15
0
09 Jul 2020
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
Maximal Objectives in the Multi-armed Bandit with Applications
Maximal Objectives in the Multi-armed Bandit with Applications
Eren Ozbay
Vijay Kamble
35
0
0
11 Jun 2020
12
Next