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. 1803.01548
  4. Cited By
Online learning over a finite action set with limited switching

Online learning over a finite action set with limited switching

5 March 2018
Jason M. Altschuler
Kunal Talwar
ArXivPDFHTML

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

12 / 12 papers shown
Title
Private Online Learning via Lazy Algorithms
Private Online Learning via Lazy Algorithms
Hilal Asi
Tomer Koren
Daogao Liu
Kunal Talwar
109
0
0
05 Jun 2024
Online Decision Making with History-Average Dependent Costs (Extended)
Online Decision Making with History-Average Dependent Costs (Extended)
Vijeth Hebbar
Cédric Langbort
23
1
0
11 Dec 2023
Private Online Prediction from Experts: Separations and Faster Rates
Private Online Prediction from Experts: Separations and Faster Rates
Hilal Asi
Vitaly Feldman
Tomer Koren
Kunal Talwar
FedML
32
18
0
24 Oct 2022
Multi-armed Bandit Learning on a Graph
Multi-armed Bandit Learning on a Graph
Tianpeng Zhang
Kasper Johansson
Na Li
35
6
0
20 Sep 2022
Dynamic Regret of Online Markov Decision Processes
Dynamic Regret of Online Markov Decision Processes
Peng Zhao
Longfei Li
Zhi-Hua Zhou
OffRL
47
17
0
26 Aug 2022
Rate-Optimal Online Convex Optimization in Adaptive Linear Control
Rate-Optimal Online Convex Optimization in Adaptive Linear Control
Asaf B. Cassel
Alon Cohen
Google Research
34
9
0
03 Jun 2022
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
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
Online Parameter-Free Learning of Multiple Low Variance Tasks
Online Parameter-Free Learning of Multiple Low Variance Tasks
Giulia Denevi
Dimitris Stamos
Massimiliano Pontil
22
0
0
11 Jul 2020
Minimax Regret of Switching-Constrained Online Convex Optimization: No
  Phase Transition
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition
Lin Chen
Qian-long Yu
Hannah Lawrence
Amin Karbasi
24
20
0
24 Oct 2019
Phase Transitions in Bandits with Switching Constraints
Phase Transitions in Bandits with Switching Constraints
D. Simchi-Levi
Yunzong Xu
14
9
0
26 May 2019
Prediction by Random-Walk Perturbation
Prediction by Random-Walk Perturbation
Luc Devroye
Gábor Lugosi
Gergely Neu
62
37
0
23 Feb 2013
1