online algorithm

Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms NeurIPS 2020 Prophet Inequalities for Bayesian Persuasion IJCAI 2020 Prophets, Secretaries, and Maximizing the Probability of Choosing the Best AISTATS 2020 Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NeurIPS 2020 Secretary and Online Matching Problems with Machine Learned Advice NeurIPS 2020 Sequential no-Substitution k-Median-Clustering AISTATS 2020 Simple and Fast Algorithm for Binary Integer and Online Linear Programming NeurIPS 2020 Simultaneous Translation Policies: From Fixed to Adaptive ACL 2020 Sliding Window Algorithms for k-Clustering Problems NeurIPS 2020 Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization ICML 2020 The Adaptive Complexity of Maximizing a Gross Substitutes Valuation NeurIPS 2020 The Blind Men and the Elephant: Integrated Offline/Online Optimization Under Uncertainty IJCAI 2020 The Primal-Dual method for Learning Augmented Algorithms NeurIPS 2020 Tracking Disaster Footprints with Social Streaming Data AAAI 2020 ADDIS: an adaptive discarding algorithm for online FDR control with conservative nulls NeurIPS 2019 A new dog learns old tricks: RL finds classic optimization algorithms ICLR 2019 A Theory of Selective Prediction COLT 2019 Bandits with Feedback Graphs and Switching Costs NeurIPS 2019 Better Algorithms for Stochastic Bandits with Adversarial Corruptions COLT 2019 Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NeurIPS 2019 Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation AAAI 2019 Competitive ratio vs regret minimization: achieving the best of both worlds ALT 2019 Contextual Bandits with Cross-Learning NeurIPS 2019 Crawling the Community Structure of Multiplex Networks AAAI 2019 Emergency Department Online Patient-Caregiver Scheduling AAAI 2019