switching cost

Learning Periodic Strategies in Blocking Bandits Is as Hard as Bandits with Switching Costs COLT 2026 Smoothed Online Convex Optimization with Delayed Feedback IJCAI 2025 Chasing Convex Functions with Long-term Constraints ICML 2024 A Bayesian approach for bandit online optimization with switching cost UAI 2023 Bayesian Optimization with Switching Cost: Regret Analysis and Lookahead Variants IJCAI 2023 Near-Optimal Adversarial Reinforcement Learning with Switching Costs ICLR 2023 Non-stationary Online Learning with Memory and Non-stochastic Control JMLR 2023 Robust Learning for Smoothed Online Convex Optimization with Feedback Delay NeurIPS 2023 Smoothed Online Combinatorial Optimization Using Imperfect Predictions AAAI 2023 Understanding the Role of Feedback in Online Learning with Switching Costs ICML 2023 Better Best of Both Worlds Bounds for Bandits with Switching Costs NeurIPS 2022 Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022 Optimal Comparator Adaptive Online Learning with Switching Cost NeurIPS 2022 Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022 Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NeurIPS 2022 An Algorithm for Stochastic and Adversarial Bandits with Switching Costs ICML 2021 Bayesian optimization for modular black-box systems with switching costs UAI 2021 Combinatorial semi-bandit in the non-stationary environment UAI 2021 Online Convex Optimization with Continuous Switching Constraint NeurIPS 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Leveraging Predictions in Smoothed Online Convex Optimization via Gradient-based Algorithms NeurIPS 2020 Multinomial Logit Bandit with Low Switching Cost ICML 2020 Online Optimization with Memory and Competitive Control NeurIPS 2020 Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes NeurIPS 2020 Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020