Online Algorithms

Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems AISTATS 2023 Optimal Scoring Rules for Multi-dimensional Effort COLT 2023 Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization ICML 2023 Optimistic Whittle Index Policy: Online Learning for Restless Bandits AAAI 2023 Oracle-Efficient Smoothed Online Learning for Piecewise Continuous Decision Making COLT 2023 Overcoming Prior Misspecification in Online Learning to Rank AISTATS 2023 Paging with Succinct Predictions ICML 2023 Parallel Index-Based Search Algorithm for Coalition Structure Generation (Student Abstract) AAAI 2023 Pareto Regret Analyses in Multi-objective Multi-armed Bandit ICML 2023 Performative Reinforcement Learning ICML 2023 Piecewise Stationary Bandits under Risk Criteria AISTATS 2023 POLYCORN: Data-driven Cross-layer Multipath Networking for High-speed Railway through Composable Schedulerlets NSDI 2023 Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games NeurIPS 2023 Poseidon: Efficient, Robust, and Practical Datacenter CC via Deployable INT NSDI 2023 Prediction Equilibrium for Dynamic Network Flows JMLR 2023 Pricing against a Budget and ROI Constrained Buyer AISTATS 2023 Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems ALT 2023 Projection-free Adaptive Regret with Membership Oracles ALT 2023 Projection-Free Online Convex Optimization via Efficient Newton Iterations NeurIPS 2023 Projection-free Online Exp-concave Optimization COLT 2023 Proportionally Fair Online Allocation of Public Goods with Predictions IJCAI 2023 Provable Reset-free Reinforcement Learning by No-Regret Reduction ICML 2023 Pseudonorm Approachability and Applications to Regret Minimization ALT 2023 Quasi-Newton Steps for Efficient Online Exp-Concave Optimization COLT 2023 Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023