Online Algorithms

PAPRIKA: Private Online False Discovery Rate Control ICML 2021 Parallelizing Thompson Sampling NeurIPS 2021 Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds COLT 2021 Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems NeurIPS 2021 Pointwise Bounds for Distribution Estimation under Communication Constraints NeurIPS 2021 Policy-Guided Heuristic Search with Guarantees AAAI 2021 Power of Hints for Online Learning with Movement Costs AISTATS 2021 Prediction against a limited adversary JMLR 2021 Preference-based Online Learning with Dueling Bandits: A Survey JMLR 2021 Preference Elicitation as Average-Case Sorting AAAI 2021 Prior-independent Dynamic Auctions for a Value-maximizing Buyer NeurIPS 2021 Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021 Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021 Projection-free Online Learning in Dynamic Environments AAAI 2021 Projection-free Online Learning over Strongly Convex Sets AAAI 2021 Pure Exploration and Regret Minimization in Matching Bandits ICML 2021 Quantile Bandits for Best Arms Identification ICML 2021 Quantum Exploration Algorithms for Multi-Armed Bandits AAAI 2021 Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time AISTATS 2021 Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NeurIPS 2021 Refined approachability algorithms and application to regret minimization with global costs JMLR 2021 Regime Switching Bandits NeurIPS 2021 Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021 Regret Bounds for Adaptive Nonlinear Control L4DC 2021 Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach ICML 2021