Online Algorithms

Online Learning with Optimism and Delay ICML 2021 Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games COLT 2021 Online Market Equilibrium with Application to Fair Division NeurIPS 2021 Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm NeurIPS 2021 Online Optimal Control with Affine Constraints AAAI 2021 Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence ICML 2021 Online Posted Pricing with Unknown Time-Discounted Valuations AAAI 2021 Online Risk-Averse Submodular Maximization IJCAI 2021 Online Robust Control of Nonlinear Systems with Large Uncertainty AISTATS 2021 Online Search with Maximum Clearance AAAI 2021 Online Selection Problems against Constrained Adversary ICML 2021 Online Selective Classification with Limited Feedback NeurIPS 2021 Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits NeurIPS 2021 Online Submodular Resource Allocation with Applications to Rebalancing Shared Mobility Systems ICML 2021 Online Unrelated Machine Load Balancing with Predictions Revisited ICML 2021 On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021 On Optimal Robustness to Adversarial Corruption in Online Decision Problems NeurIPS 2021 Optimal Algorithms for Range Searching over Multi-Armed Bandits IJCAI 2021 Optimal Algorithms for Stochastic Contextual Preference Bandits NeurIPS 2021 Optimal Dynamic Regret in Exp-Concave Online Learning COLT 2021 Optimal Gradient-based Algorithms for Non-concave Bandit Optimization NeurIPS 2021 Optimal Rates for Random Order Online Optimization NeurIPS 2021 Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021 Optimal Streaming Algorithms for Multi-Armed Bandits ICML 2021 Optimal Thompson Sampling strategies for support-aware CVaR bandits ICML 2021