ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1803.01548
  4. Cited By
Online learning over a finite action set with limited switching
v1v2 (latest)

Online learning over a finite action set with limited switching

5 March 2018
Jason M. Altschuler
Kunal Talwar
ArXiv (abs)PDFHTML

Papers citing "Online learning over a finite action set with limited switching"

27 / 27 papers shown
Federated Online Prediction from Experts with Differential Privacy:
  Separations and Regret Speed-ups
Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-upsNeural Information Processing Systems (NeurIPS), 2024
Fengyu Gao
Ruiquan Huang
Jing Yang
FedML
197
1
0
27 Sep 2024
Private Online Learning via Lazy Algorithms
Private Online Learning via Lazy Algorithms
Hilal Asi
Tomer Koren
Daogao Liu
Kunal Talwar
463
3
0
05 Jun 2024
Learning-Augmented Algorithms with Explicit Predictors
Learning-Augmented Algorithms with Explicit PredictorsNeural Information Processing Systems (NeurIPS), 2024
Marek Elias
Haim Kaplan
Yishay Mansour
Shay Moran
187
8
0
12 Mar 2024
Improved Differentially Private and Lazy Online Convex Optimization
Improved Differentially Private and Lazy Online Convex Optimization
Naman Agarwal
Satyen Kale
Karan Singh
Abhradeep Thakurta
261
4
0
15 Dec 2023
Online Decision Making with History-Average Dependent Costs (Extended)
Online Decision Making with History-Average Dependent Costs (Extended)
Vijeth Hebbar
Cédric Langbort
131
1
0
11 Dec 2023
Understanding the Role of Feedback in Online Learning with Switching
  Costs
Understanding the Role of Feedback in Online Learning with Switching CostsInternational Conference on Machine Learning (ICML), 2023
Duo Cheng
Xingyu Zhou
Bo Ji
178
5
0
16 Jun 2023
Private Online Prediction from Experts: Separations and Faster Rates
Private Online Prediction from Experts: Separations and Faster RatesAnnual Conference Computational Learning Theory (COLT), 2022
Hilal Asi
Vitaly Feldman
Tomer Koren
Kunal Talwar
FedML
246
23
0
24 Oct 2022
Online Convex Optimization with Unbounded Memory
Online Convex Optimization with Unbounded MemoryNeural Information Processing Systems (NeurIPS), 2022
Raunak Kumar
Sarah Dean
Robert D. Kleinberg
477
10
0
18 Oct 2022
Diversified Recommendations for Agents with Adaptive Preferences
Diversified Recommendations for Agents with Adaptive PreferencesNeural Information Processing Systems (NeurIPS), 2022
Arpit Agarwal
William Brown
189
15
0
20 Sep 2022
Multi-armed Bandit Learning on a Graph
Multi-armed Bandit Learning on a GraphAnnual Conference on Information Sciences and Systems (CISS), 2022
Tianpeng Zhang
Kasper Johansson
Na Li
431
8
0
20 Sep 2022
Dynamic Regret of Online Markov Decision Processes
Dynamic Regret of Online Markov Decision ProcessesInternational Conference on Machine Learning (ICML), 2022
Peng Zhao
Longfei Li
Zhi Zhou
OffRL
204
19
0
26 Aug 2022
Rate-Optimal Online Convex Optimization in Adaptive Linear Control
Rate-Optimal Online Convex Optimization in Adaptive Linear ControlNeural Information Processing Systems (NeurIPS), 2022
Asaf B. Cassel
Alon Cohen
Google Research
195
9
0
03 Jun 2022
Optimal Comparator Adaptive Online Learning with Switching Cost
Optimal Comparator Adaptive Online Learning with Switching CostNeural Information Processing Systems (NeurIPS), 2022
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
281
7
0
13 May 2022
Smoothed Online Optimization with Unreliable Predictions
Smoothed Online Optimization with Unreliable PredictionsProceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 2022
Daan Rutten
Nicolas H. Christianson
Debankur Mukherjee
Adam Wierman
217
22
0
07 Feb 2022
Online Convex Optimization with Continuous Switching Constraint
Online Convex Optimization with Continuous Switching ConstraintNeural Information Processing Systems (NeurIPS), 2021
Guanghui Wang
Yuanyu Wan
Tianbao Yang
Lijun Zhang
137
11
0
21 Mar 2021
Revisiting Smoothed Online Learning
Revisiting Smoothed Online LearningNeural Information Processing Systems (NeurIPS), 2021
Lijun Zhang
Wei Jiang
Shiyin Lu
Tianbao Yang
311
35
0
13 Feb 2021
Lazy OCO: Online Convex Optimization on a Switching Budget
Lazy OCO: Online Convex Optimization on a Switching BudgetAnnual Conference Computational Learning Theory (COLT), 2021
Uri Sherman
Tomer Koren
363
19
0
07 Feb 2021
Non-stationary Online Learning with Memory and Non-stochastic Control
Non-stationary Online Learning with Memory and Non-stochastic ControlInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Peng Zhao
Yu-Hu Yan
Yu Wang
Zhi Zhou
522
52
0
07 Feb 2021
Provably Efficient Reinforcement Learning with Linear Function
  Approximation Under Adaptivity Constraints
Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity ConstraintsNeural Information Processing Systems (NeurIPS), 2021
Chi Jin
Zhuoran Yang
Zhaoran Wang
OffRL
462
172
0
06 Jan 2021
Online Learning with Primary and Secondary Losses
Online Learning with Primary and Secondary LossesNeural Information Processing Systems (NeurIPS), 2020
Avrim Blum
Han Shao
145
1
0
27 Oct 2020
Online Active Model Selection for Pre-trained Classifiers
Online Active Model Selection for Pre-trained ClassifiersInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Mohammad Reza Karimi
Nezihe Merve Gürel
Bojan Karlavs
Johannes Rausch
Ce Zhang
Andreas Krause
218
25
0
19 Oct 2020
Online Parameter-Free Learning of Multiple Low Variance Tasks
Online Parameter-Free Learning of Multiple Low Variance TasksConference on Uncertainty in Artificial Intelligence (UAI), 2020
Giulia Denevi
Dimitris Stamos
Massimiliano Pontil
181
0
0
11 Jul 2020
Making Non-Stochastic Control (Almost) as Easy as Stochastic
Making Non-Stochastic Control (Almost) as Easy as StochasticNeural Information Processing Systems (NeurIPS), 2020
Max Simchowitz
165
40
0
10 Jun 2020
Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
Blind Network Revenue Management and Bandits with Knapsacks under Limited SwitchesOperational Research (OR), 2019
D. Simchi-Levi
Yunzong Xu
Jinglong Zhao
448
3
0
04 Nov 2019
Minimax Regret of Switching-Constrained Online Convex Optimization: No
  Phase Transition
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase TransitionNeural Information Processing Systems (NeurIPS), 2019
Lin Chen
Qian-long Yu
Hannah Lawrence
Amin Karbasi
298
22
0
24 Oct 2019
Phase Transitions in Bandits with Switching Constraints
Phase Transitions in Bandits with Switching ConstraintsNeural Information Processing Systems (NeurIPS), 2019
D. Simchi-Levi
Yunzong Xu
246
7
0
26 May 2019
Competitive ratio versus regret minimization: achieving the best of both
  worlds
Competitive ratio versus regret minimization: achieving the best of both worlds
Amit Daniely
Yishay Mansour
108
2
0
07 Apr 2019
1