Online Algorithms

Delayed Feedback in Generalised Linear Bandits Revisited AISTATS 2023 Delayed Feedback in Kernel Bandits ICML 2023 Delegated Online Search IJCAI 2023 Differentially Private and Lazy Online Convex Optimization COLT 2023 Disaggregating Stateful Network Functions NSDI 2023 Discrete-Smoothness in Online Algorithms with Predictions NeurIPS 2023 Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost ICML 2023 Distributed Linear Bandits under Communication Constraints ICML 2023 Distributed Projection-Free Online Learning for Smooth and Convex Losses AAAI 2023 Double Auctions with Two-sided Bandit Feedback NeurIPS 2023 Doubly Adversarial Federated Bandits ICML 2023 Doubly Fair Dynamic Pricing AISTATS 2023 Doubly Optimal No-Regret Learning in Monotone Games ICML 2023 Dynamical Linear Bandits ICML 2023 Dynamic Pricing and Learning with Bayesian Persuasion NeurIPS 2023 Dynamic Pricing with Volume Discounts in Online Settings AAAI 2023 Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards NeurIPS 2023 Efficient Algorithms for Regret Minimization in Billboard Advertisement (Student Abstract) AAAI 2023 Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers IJCAI 2023 Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination NeurIPS 2023 Efficiently learning the graph for semi-supervised learning UAI 2023 Efficient Online Clustering with Moving Costs NeurIPS 2023 Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation ICML 2023 Elastic Decision Transformer NeurIPS 2023 Energy-Efficient Scheduling with Predictions NeurIPS 2023