Online Algorithms

Multi-Agent Online Optimization with Delays: Asynchronicity, Adaptivity, and Optimism JMLR 2022 Multi-agent Performative Prediction with Greedy Deployment and Consensus Seeking Agents NeurIPS 2022 Multi-Fidelity Best-Arm Identification NeurIPS 2022 Multi-Leader Congestion Games with an Adversary AAAI 2022 Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms ICML 2022 Multi-robot Task Allocation in the Environment with Functional Tasks IJCAI 2022 Multi-slots Online Matching with High Entropy ICML 2022 NaturalInversion: Data-Free Image Synthesis Improving Real-World Consistency AAAI 2022 Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions NeurIPS 2022 Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs NeurIPS 2022 Near optimal efficient decoding from pooled data COLT 2022 Nested Bandits ICML 2022 New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees COLT 2022 Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem NeurIPS 2022 Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NeurIPS 2022 Non-stationary Bandits with Knapsacks NeurIPS 2022 Nonstationary Dual Averaging and Online Fair Allocation NeurIPS 2022 Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022 Nonstochastic Bandits and Experts with Arm-Dependent Delays AISTATS 2022 Nonstochastic Bandits with Composite Anonymous Feedback JMLR 2022 No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation NeurIPS 2022 No-Regret Learning in Partially-Informed Auctions ICML 2022 Norm-Agnostic Linear Bandits AISTATS 2022 No Weighted-Regret Learning in Adversarial Bandits with Delays JMLR 2022 Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit IJCAI 2022