Online Algorithms

Batched Dueling Bandits ICML 2022 Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms NeurIPS 2022 Bayesian Change-Point Detection for Bandit Feedback in Non-stationary Environments ACML 2022 Best Arm Identification with Safety Constraints AISTATS 2022 Best of Both Worlds Model Selection NeurIPS 2022 Better Best of Both Worlds Bounds for Bandits with Switching Costs NeurIPS 2022 Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness NeurIPS 2022 Bounded-Regret MPC via Perturbation Analysis: Prediction Error, Constraints, and Nonlinearity NeurIPS 2022 Breaking the √T Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits ICML 2022 Chasing Convex Bodies and Functions with Black-Box Advice COLT 2022 Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits ICML 2022 cISP: A Speed-of-Light Internet Service Provider NSDI 2022 Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds NeurIPS 2022 Competitive Analysis for Multi-Commodity Ski-Rental Problem IJCAI 2022 Complete Policy Regret Bounds for Tallying Bandits COLT 2022 Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs NeurIPS 2022 Conformal Frequency Estimation with Sketched Data NeurIPS 2022 Congested Bandits: Optimal Routing via Short-term Resets ICML 2022 Context-Based Dynamic Pricing with Partially Linear Demand Model NeurIPS 2022 Contextual Bandits with Knapsacks for a Conversion Model NeurIPS 2022 Contextual Bandits with Large Action Spaces: Made Practical ICML 2022 Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces ICML 2022 Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets NeurIPS 2022 Contextual Information-Directed Sampling ICML 2022 Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits COLT 2022