Online Algorithms

Corruption-Robust Contextual Search through Density Updates COLT 2022 CVaR-Regret Bounds for Multi-armed Bandits ACML 2022 Damped Online Newton Step for Portfolio Selection COLT 2022 Debiasing Samples from Online Learning Using Bootstrap AISTATS 2022 Decentralized Online Convex Optimization in Networked Systems ICML 2022 Decentralized Training of Foundation Models in Heterogeneous Environments NeurIPS 2022 Decision-Dependent Risk Minimization in Geometrically Decaying Dynamic Environments AAAI 2022 Deep Hierarchy in Bandits ICML 2022 Delay-Adaptive Step-sizes for Asynchronous Learning ICML 2022 Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions NeurIPS 2022 Distributed Learning with Strategic Users: A Repeated Game Approach AAAI 2022 Distributed Online Convex Optimization with Compressed Communication NeurIPS 2022 Distributed Online Learning for Joint Regret with Communication Constraints ALT 2022 Donar: Anonymous VoIP over Tor NSDI 2022 Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond NeurIPS 2022 Dynamic Bandits with Temporal Structure IJCAI 2022 Dynamic Fair Division with Partial Information NeurIPS 2022 Dynamic Learning in Large Matching Markets NeurIPS 2022 Dynamic pricing and assortment under a contextual MNL demand NeurIPS 2022 Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model NeurIPS 2022 Dynamic Scheduling of Approximate Telemetry Queries NSDI 2022 Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions NeurIPS 2022 Efficient Encoding of Cost Optimal Delete-Free Planning as SAT AAAI 2022 Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems NeurIPS 2022 Efficient Kernelized UCB for Contextual Bandits AISTATS 2022