Online Algorithms

Consistent k-Median: Simpler, Better and Robust AISTATS 2021 Contextual Recommendations and Low-Regret Cutting-Plane Algorithms NeurIPS 2021 Continuous Mean-Covariance Bandits NeurIPS 2021 Contract Scheduling With Predictions AAAI 2021 Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions COLT 2021 Corralling Stochastic Bandit Algorithms AISTATS 2021 Coupon Design in Advertising Systems AAAI 2021 DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021 Data-driven Competitive Algorithms for Online Knapsack and Set Cover AAAI 2021 Decentralized Learning in Online Queuing Systems NeurIPS 2021 Decentralized Multi-Agent Linear Bandits with Safety Constraints AAAI 2021 Deterministic Finite-Memory Bias Estimation COLT 2021 Dichotomous Optimistic Search to Quantify Human Perception ICML 2021 Differentially Private Multi-Armed Bandits in the Shuffle Model NeurIPS 2021 Disposable Linear Bandits for Online Recommendations AAAI 2021 Double Explore-then-Commit: Asymptotic Optimality and Beyond COLT 2021 Doubly Robust Thompson Sampling with Linear Payoffs NeurIPS 2021 Dual Active Learning for Both Model and Data Selection IJCAI 2021 Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions NeurIPS 2021 Dueling Bandits with Adversarial Sleeping NeurIPS 2021 Dueling Bandits with Team Comparisons NeurIPS 2021 Dueling Convex Optimization ICML 2021 Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games ICML 2021 Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination NeurIPS 2021 Efficient Online Learning for Dynamic k-Clustering ICML 2021