Online Algorithms

Time Fairness in Online Knapsack Problems ICLR 2024 Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits NeurIPS 2024 Warm-starting Push-Relabel NeurIPS 2024 Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes NeurIPS 2024 When Is Inductive Inference Possible? NeurIPS 2024 $O(T^{-1})$ Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games ICLR 2023 A Blackbox Approach to Best of Both Worlds in Bandits and Beyond COLT 2023 Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits ICLR 2023 Adaptation to the Range in K-Armed Bandits JMLR 2023 Advice Querying under Budget Constraint for Online Algorithms NeurIPS 2023 An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret AAAI 2023 An Exploration-by-Optimization Approach to Best of Both Worlds in Linear Bandits NeurIPS 2023 Anytime Model Selection in Linear Bandits NeurIPS 2023 Approximately Stationary Bandits with Knapsacks COLT 2023 Asymptotic Instance-Optimal Algorithms for Interactive Decision Making ICLR 2023 Augmenting Automated Spectrum Based Fault Localization for Multiple Faults IJCAI 2023 A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs COLT 2023 Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits ICML 2023 Bandits with costly reward observations UAI 2023 Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning ICML 2023 Best Arm Identification in Multi-Agent Multi-Armed Bandits ICML 2023 Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds COLT 2023 Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits NeurIPS 2023 Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023 Communication-Efficient Collaborative Best Arm Identification AAAI 2023