Online Algorithms

Lifelong Learning with Branching Experts ACML 2021 Littlestone Classes are Privately Online Learnable NeurIPS 2021 Low-Rank Generalized Linear Bandit Problems AISTATS 2021 Mirror Descent and the Information Ratio COLT 2021 Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games AAAI 2021 Monte Carlo Scene Search for 3D Scene Understanding CVPR 2021 MOTS: Minimax Optimal Thompson Sampling ICML 2021 Multi-Armed Bandits with Cost Subsidy AISTATS 2021 Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions AAAI 2021 Observation-Free Attacks on Stochastic Bandits NeurIPS 2021 Online A-Optimal Design and Active Linear Regression ICML 2021 Online Forgetting Process for Linear Regression Models AISTATS 2021 Online Learning from Optimal Actions COLT 2021 Online Learning in Unknown Markov Games ICML 2021 Online Learning with Optimism and Delay ICML 2021 Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games COLT 2021 Online Markov Decision Processes with Aggregate Bandit Feedback COLT 2021 On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021 Optimal Dynamic Regret in Exp-Concave Online Learning COLT 2021 Optimal Streaming Algorithms for Multi-Armed Bandits ICML 2021 Optimizing Optimizers: Regret-optimal gradient descent algorithms COLT 2021 Parametric Graph for Unimodal Ranking Bandit ICML 2021 Rebounding Bandits for Modeling Satiation Effects NeurIPS 2021 Refined approachability algorithms and application to regret minimization with global costs JMLR 2021 Regret Bounds for Adaptive Nonlinear Control L4DC 2021