Online Algorithms

Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games AAAI 2021 Bandits with Knapsacks beyond the Worst Case NeurIPS 2021 Batched Thompson Sampling NeurIPS 2021 Benchmarking Scalable Methods for Streaming Cross Document Entity Coreference ACL 2021 Best Arm Identification in Graphical Bilinear Bandits ICML 2021 Best-case lower bounds in online learning NeurIPS 2021 Best Model Identification: A Rested Bandit Formulation ICML 2021 Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback AAAI 2021 Beyond $log^2(T)$ regret for decentralized bandits in matching markets ICML 2021 Black-Box Control for Linear Dynamical Systems COLT 2021 Boosting for Online Convex Optimization ICML 2021 Bootstrapping Battery-free Wireless Networks: Efficient Neighbor Discovery and Synchronization in the Face of Intermittency NSDI 2021 Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs NeurIPS 2021 Budgeted and Non-Budgeted Causal Bandits AISTATS 2021 Budget Feasible Mechanisms Over Graphs AAAI 2021 Caerus: NIMBLE Task Scheduling for Serverless Analytics NSDI 2021 Causal Bandits with Unknown Graph Structure NeurIPS 2021 ChaCha for Online AutoML ICML 2021 Classification with Few Tests through Self-Selection AAAI 2021 Combinatorial Blocking Bandits with Stochastic Delays ICML 2021 Combinatorial semi-bandit in the non-stationary environment UAI 2021 Comparison Lift: Bandit-based Experimentation System for Online Advertising AAAI 2021 Competitive Analysis for Two-Level Ski-Rental Problem AAAI 2021 Computing an Efficient Exploration Basis for Learning with Univariate Polynomial Features AAAI 2021 Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving NeurIPS 2021