Online Algorithms

Regularized Online Allocation Problems: Fairness and Beyond ICML 2021 Regulating Greed Over Time in Multi-Armed Bandits JMLR 2021 Relational Boosted Bandits AAAI 2021 Resource Allocation in Multi-armed Bandit Exploration: Overcoming Sublinear Scaling with Adaptive Parallelism ICML 2021 Revisiting Projection-free Online Learning: the Strongly Convex Case AISTATS 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Robust Learning of Optimal Auctions NeurIPS 2021 Robust Online Correlation Clustering NeurIPS 2021 Robust Pure Exploration in Linear Bandits with Limited Budget ICML 2021 ROI Maximization in Stochastic Online Decision-Making NeurIPS 2021 Scheduling jobs with stochastic holding costs NeurIPS 2021 Selective Sampling for Online Best-arm Identification NeurIPS 2021 Sequential Algorithms for Testing Closeness of Distributions NeurIPS 2021 Ship Compute or Ship Data? Why Not Both? NSDI 2021 Simple combinatorial algorithms for combinatorial bandits: corruptions and approximations UAI 2021 Simultaneous 2nd Price Item Auctions with No-Underbidding AAAI 2021 Smooth Bandit Optimization: Generalization to Holder Space AISTATS 2021 SSMF: Shifting Seasonal Matrix Factorization NeurIPS 2021 Stable Online Control of Linear Time-Varying Systems L4DC 2021 Statistical Inference with M-Estimators on Adaptively Collected Data NeurIPS 2021 Stochastic Bandits with Graph Feedback in Non-Stationary Environments AAAI 2021 Stochastic Bandits with Linear Constraints AISTATS 2021 Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions ICML 2021 Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge NeurIPS 2021 Stochastic Shortest Path with Adversarially Changing Costs IJCAI 2021