Online Algorithms

One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization ACML 2022 On Elimination Strategies for Bandit Fixed-Confidence Identification NeurIPS 2022 One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes ICML 2022 On Kernelized Multi-Armed Bandits with Constraints NeurIPS 2022 Online Active Regression ICML 2022 Online Algorithms for the Santa Claus Problem NeurIPS 2022 Online Allocation and Learning in the Presence of Strategic Agents NeurIPS 2022 Online Balanced Experimental Design ICML 2022 Online Bin Packing with Predictions IJCAI 2022 Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model NeurIPS 2022 Online Certification of Preference-Based Fairness for Personalized Recommender Systems AAAI 2022 Online Competitive Influence Maximization AISTATS 2022 Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond NeurIPS 2022 Online Decision Mediation NeurIPS 2022 Online Elicitation of Necessarily Optimal Matchings AAAI 2022 Online Estimation and Control with Optimal Pathlength Regret L4DC 2022 Online Facility Location with Predictions ICLR 2022 Online Frank-Wolfe with Arbitrary Delays NeurIPS 2022 Online Learning and Pricing for Network Revenue Management with Reusable Resources NeurIPS 2022 Online Learning and Pricing with Reusable Resources: Linear Bandits with Sub-Exponential Rewards ICML 2022 Online Learning for Min Sum Set Cover and Pandora’s Box ICML 2022 Online Learning of Reusable Abstract Models for Object Goal Navigation CVPR 2022 Online Learning with Knapsacks: the Best of Both Worlds ICML 2022 Online Minimax Multiobjective Optimization: Multicalibeating and Other Applications NeurIPS 2022 Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case JMLR 2022