Online Algorithms

Adversarial Linear Contextual Bandits with Graph-Structured Side Observations AAAI 2021 Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds ALT 2021 A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem AAAI 2021 AI for Planning Public Health Interventions IJCAI 2021 AI for Social Good: Between My Research and the Real World AAAI 2021 Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ICML 2021 An Algorithm for Stochastic and Adversarial Bandits with Switching Costs ICML 2021 Analyzing the Generalization Capability of SGLD Using Properties of Gaussian Channels NeurIPS 2021 An Efficient Algorithm for Cooperative Semi-Bandits ALT 2021 An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints NeurIPS 2021 An online semi-definite programming with a generalised log-determinant regularizer and its applications ACML 2021 An Optimal Reduction of TV-Denoising to Adaptive Online Learning AISTATS 2021 Anytime Multi-Agent Path Finding via Large Neighborhood Search IJCAI 2021 A One-Size-Fits-All Solution to Conservative Bandit Problems AAAI 2021 Approximation Theory Based Methods for RKHS Bandits ICML 2021 A Primal-Dual Online Algorithm for Online Matching Problem in Dynamic Environments AAAI 2021 A Regression Approach to Learning-Augmented Online Algorithms NeurIPS 2021 Asymptotically Best Causal Effect Identification with Multi-Armed Bandits NeurIPS 2021 Asynchronous Decentralized Online Learning NeurIPS 2021 Asynchronous Distributed Learning : Adapting to Gradient Delays without Prior Knowledge ICML 2021 A Unified Approach to Fair Online Learning via Blackwell Approachability NeurIPS 2021 A unified framework for bandit multiple testing NeurIPS 2021 AutoBandit: A Meta Bandit Online Learning System IJCAI 2021 Bandit Convex Optimization in Non-stationary Environments JMLR 2021 Bandit Learning in Decentralized Matching Markets JMLR 2021