Online Algorithms

Smoothed Online Combinatorial Optimization Using Imperfect Predictions AAAI 2023 Smoothed Online Learning for Prediction in Piecewise Affine Systems NeurIPS 2023 Smooth Non-stationary Bandits ICML 2023 Solving Linear Programs with Fast Online Learning Algorithms ICML 2023 Sorting with Predictions NeurIPS 2023 Spatially Adaptive Online Prediction of Piecewise Regular Functions ALT 2023 Speeding Up Bellman Ford via Minimum Violation Permutations ICML 2023 Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary ICML 2023 Statistical Inference and A/B Testing for First-Price Pacing Equilibria ICML 2023 Stochastic Contextual Bandits with Long Horizon Rewards AAAI 2023 Stochastic Gradient Succeeds for Bandits ICML 2023 Stochastic Multi-armed Bandits: Optimal Trade-off among Optimality, Consistency, and Tail Risk NeurIPS 2023 Strategic Apple Tasting NeurIPS 2023 Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost NeurIPS 2023 The Distortion of Binomial Voting Defies Expectation NeurIPS 2023 Thompson Exploration with Best Challenger Rule in Best Arm Identification ACML 2023 Thompson Sampling with Less Exploration is Fast and Optimal ICML 2023 Tighter Robust Upper Bounds for Options via No-Regret Learning AAAI 2023 Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits ICML 2023 Topological Planning with Post-unique and Unary Actions IJCAI 2023 Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts ICML 2023 Trading-off price for data quality to achieve fair online allocation NeurIPS 2023 TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation AISTATS 2023 U-Calibration: Forecasting for an Unknown Agent COLT 2023 Unconstrained Dynamic Regret via Sparse Coding NeurIPS 2023