online algorithm

Online Submodular Resource Allocation with Applications to Rebalancing Shared Mobility Systems ICML 2021 Online Unrelated Machine Load Balancing with Predictions Revisited ICML 2021 Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems NeurIPS 2021 Prior-independent Dynamic Auctions for a Value-maximizing Buyer NeurIPS 2021 Regulating Greed Over Time in Multi-Armed Bandits JMLR 2021 Robust Learning-Augmented Caching: An Experimental Study ICML 2021 Robust Online Correlation Clustering NeurIPS 2021 Scheduling jobs with stochastic holding costs NeurIPS 2021 Simple combinatorial algorithms for combinatorial bandits: corruptions and approximations UAI 2021 Stochastic Bandits with Graph Feedback in Non-Stationary Environments AAAI 2021 Testification of Condorcet Winners in dueling bandits UAI 2021 The Sparse Vector Technique, Revisited COLT 2021 Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021 Tracking Regret Bounds for Online Submodular Optimization AISTATS 2021 Traffic Congestion Alleviation over Dynamic Road Networks: Continuous Optimal Route Combination for Trip Query Streams IJCAI 2021 Understanding Bandits with Graph Feedback NeurIPS 2021 Adaptive Probing Policies for Shortest Path Routing NeurIPS 2020 Adversarial Blocking Bandits NeurIPS 2020 A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints JMLR 2020 A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits AAAI 2020 A Tight Lower Bound and Efficient Reduction for Swap Regret NeurIPS 2020 AUC Optimization with a Reject Option AAAI 2020 A Unified Model for the Two-stage Offline-then-Online Resource Allocation IJCAI 2020 Bandits for BMO Functions ICML 2020 Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting JMLR 2020