Online Algorithms

An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem NeurIPS 2022 An Online Learning Approach towards Far-sighted Emergency Relief Planning under Intentional Attacks in Conflict Areas IJCAI 2022 A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds ICML 2022 A Regret-Variance Trade-Off in Online Learning NeurIPS 2022 A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits NeurIPS 2022 A Simple yet Universal Strategy for Online Convex Optimization ICML 2022 Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences ICLR 2022 Bandits for Structure Perturbation-Based Black-Box Attacks To Graph Neural Networks With Theoretical Guarantees CVPR 2022 Bounded Memory Adversarial Bandits with Composite Anonymous Delayed Feedback IJCAI 2022 Breaking the √T Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits ICML 2022 Chasing Convex Bodies and Functions with Black-Box Advice COLT 2022 Complete Policy Regret Bounds for Tallying Bandits COLT 2022 Cooperative Online Learning in Stochastic and Adversarial MDPs ICML 2022 Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits COLT 2022 CVaR-Regret Bounds for Multi-armed Bandits ACML 2022 Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets NeurIPS 2022 Decentralized Online Convex Optimization in Networked Systems ICML 2022 Dynamic Learning in Large Matching Markets NeurIPS 2022 Efficient Algorithms for Extreme Bandits AISTATS 2022 Efficient and Optimal Fixed-Time Regret with Two Experts ALT 2022 Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits JMLR 2022 Efficient Methods for Non-stationary Online Learning NeurIPS 2022 Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics COLT 2022 Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent NeurIPS 2022 Efficient Projection-Free Online Convex Optimization with Membership Oracle COLT 2022