Online Algorithms

An α-regret analysis of Adversarial Bilateral Trade NeurIPS 2022 An Algorithmic Introduction to Savings Circles AAAI 2022 An Analysis of Ensemble Sampling NeurIPS 2022 An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem NeurIPS 2022 A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs NeurIPS 2022 An Experimental Design Approach for Regret Minimization in Logistic Bandits AAAI 2022 A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits AISTATS 2022 An Online Learning Approach to Sequential User-Centric Selection Problems AAAI 2022 Anonymous Bandits for Multi-User Systems NeurIPS 2022 Approximate Function Evaluation via Multi-Armed Bandits AISTATS 2022 Approximate Top-m Arm Identification with Heterogeneous Reward Variances AISTATS 2022 A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds ICML 2022 A Regret Minimization Approach to Multi-Agent Control ICML 2022 A Reliability-aware Distributed Framework to Schedule Residential Charging of Electric Vehicles IJCAI 2022 A Simple and Optimal Policy Design for Online Learning with Safety against Heavy-tailed Risk NeurIPS 2022 A Simple yet Universal Strategy for Online Convex Optimization ICML 2022 Augmented RBMLE-UCB Approach for Adaptive Control of Linear Quadratic Systems NeurIPS 2022 Augmenting Online Algorithms with ε-Accurate Predictions NeurIPS 2022 A Unifying Framework for Online Optimization with Long-Term Constraints NeurIPS 2022 A Universal Error Measure for Input Predictions Applied to Online Graph Problems NeurIPS 2022 Backpressure Flow Control NSDI 2022 Balancing adaptability and non-exploitability in repeated games UAI 2022 Bandit Data-Driven Optimization for Crowdsourcing Food Rescue Platforms AAAI 2022 Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization AAAI 2022 Bandits for Structure Perturbation-Based Black-Box Attacks To Graph Neural Networks With Theoretical Guarantees CVPR 2022