conftrace_

switching cost

34 papers

Explore in graph

Also known as

SC

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) online convex optimization (165) competitive ratio (74) dynamic regret (94) stochastic bandit (98) online algorithm (445) regret minimization (315) non-stochastic control (6)

Papers

Smoothed Online Convex Optimization with Delayed Feedback IJCAI 2025
A Bayesian approach for bandit online optimization with switching cost UAI 2023
Smoothed Online Combinatorial Optimization Using Imperfect Predictions AAAI 2023
Non-stationary Online Learning with Memory and Non-stochastic Control JMLR 2023
Robust Learning for Smoothed Online Convex Optimization with Feedback Delay NIPS 2023
Understanding the Role of Feedback in Online Learning with Switching Costs ICML 2023
Bayesian Optimization with Switching Cost: Regret Analysis and Lookahead Variants IJCAI 2023
Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022
Better Best of Both Worlds Bounds for Bandits with Switching Costs NIPS 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022
Optimal Comparator Adaptive Online Learning with Switching Cost NIPS 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NIPS 2022
Revisiting Smoothed Online Learning NIPS 2021
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs ICML 2021
Online Convex Optimization with Continuous Switching Constraint NIPS 2021
Combinatorial semi-bandit in the non-stationary environment UAI 2021
Bayesian optimization for modular black-box systems with switching costs UAI 2021
Multinomial Logit Bandit with Low Switching Cost ICML 2020
Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020
Online Optimization with Memory and Competitive Control NIPS 2020
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes NIPS 2020
Online learning with feedback graphs and switching costs AISTATS 2019
Provably Efficient Q-Learning with Low Switching Cost NIPS 2019
Bandits with Feedback Graphs and Switching Costs NIPS 2019
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints NIPS 2019