Online Algorithms

Necessarily Optimal One-Sided Matchings AAAI 2021 Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021 Non-Exponentially Weighted Aggregation: Regret Bounds for Unbounded Loss Functions ICML 2021 Non-Parametric Stochastic Sequential Assignment With Random Arrival Times IJCAI 2021 Non-uniform Consistency of Online Learning with Random Sampling ALT 2021 No-regret Algorithms for Capturing Events in Poisson Point Processes ICML 2021 No-regret Online Learning over Riemannian Manifolds NeurIPS 2021 No-substitution k-means Clustering with Adversarial Order ALT 2021 On a Competitive Secretary Problem with Deferred Selections IJCAI 2021 One More Step Towards Reality: Cooperative Bandits with Imperfect Communication NeurIPS 2021 On Limited-Memory Subsampling Strategies for Bandits ICML 2021 Online Adaptation to Label Distribution Shift NeurIPS 2021 Online A-Optimal Design and Active Linear Regression ICML 2021 Online Convex Optimization with Continuous Switching Constraint NeurIPS 2021 Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation AAAI 2021 Online Graph Dictionary Learning ICML 2021 Online k-means Clustering AISTATS 2021 Online Knapsack with Frequency Predictions NeurIPS 2021 Online Learning for Load Balancing of Unknown Monotone Resource Allocation Games ICML 2021 Online Learning from Optimal Actions COLT 2021 Online learning in MDPs with linear function approximation and bandit feedback. NeurIPS 2021 Online Learning in Periodic Zero-Sum Games NeurIPS 2021 Online Learning in Variable Feature Spaces under Incomplete Supervision AAAI 2021 Online Learning Meets Machine Translation Evaluation: Finding the Best Systems with the Least Human Effort ACL 2021 Online Learning of Facility Locations ALT 2021