online algorithm

Online Pricing for Multi-User Multi-Item Markets NeurIPS 2023 Online Saddle Point Tracking with Decision-Dependent Data L4DC 2023 Online Task Assignment with Controllable Processing Time IJCAI 2023 Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems AISTATS 2023 Paging with Succinct Predictions ICML 2023 Proportionally Fair Online Allocation of Public Goods with Predictions IJCAI 2023 Provable Reset-free Reinforcement Learning by No-Regret Reduction ICML 2023 Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets AISTATS 2023 Robust Lipschitz Bandits to Adversarial Corruptions NeurIPS 2023 Robust Load Balancing with Machine Learned Advice JMLR 2023 SHEPHERD: Serving DNNs in the Wild NSDI 2023 Towards Utilitarian Online Learning -- A Review of Online Algorithms in Open Feature Space IJCAI 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 VCG Mechanism Design with Unknown Agent Values under Stochastic Bandit Feedback JMLR 2023 A competitive analysis of online failure-aware assignment UAI 2022 Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits ICML 2022 Algorithms with Prediction Portfolios NeurIPS 2022 An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem NeurIPS 2022 A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits AISTATS 2022 Augmenting Online Algorithms with ε-Accurate Predictions NeurIPS 2022 A Universal Error Measure for Input Predictions Applied to Online Graph Problems NeurIPS 2022 Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms NeurIPS 2022 Chasing Convex Bodies and Functions with Black-Box Advice COLT 2022