Online Algorithms

Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback ICML 2022 Online PAC-Bayes Learning NeurIPS 2022 Online Page Migration with ML Advice AISTATS 2022 Online Search with Best-Price and Query-Based Predictions AAAI 2022 Online Task Assignment Problems with Reusable Resources AAAI 2022 On-the-fly adaptation of patrolling strategies in changing environments UAI 2022 Open Problem: Optimal Best Arm Identification with Fixed-Budget COLT 2022 Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits ICML 2022 Optimal Comparator Adaptive Online Learning with Switching Cost NeurIPS 2022 (Optimal) Online Bipartite Matching with Degree Information NeurIPS 2022 Optimal Query Complexities for Dynamic Trace Estimation NeurIPS 2022 Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games NeurIPS 2022 Oracle-Efficient Online Learning for Smoothed Adversaries NeurIPS 2022 Parameter-free Mirror Descent COLT 2022 Parameter-Free Online Linear Optimization with Side Information via Universal Coin Betting AISTATS 2022 Parameter-free Regret in High Probability with Heavy Tails NeurIPS 2022 PDE-Based Optimal Strategy for Unconstrained Online Learning ICML 2022 Pessimism for Offline Linear Contextual Bandits using ℓ_p Confidence Sets NeurIPS 2022 PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits NeurIPS 2022 Posted Pricing and Dynamic Prior-independent Mechanisms with Value Maximizers NeurIPS 2022 Product Ranking for Revenue Maximization with Multiple Purchases NeurIPS 2022 Projection-free Distributed Online Learning with Sublinear Communication Complexity JMLR 2022 Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States COLT 2022 Queue Up Your Regrets: Achieving the Dynamic Capacity Region of Multiplayer Bandits NeurIPS 2022 Rate-Optimal Online Convex Optimization in Adaptive Linear Control NeurIPS 2022