{"total":46,"rows":[{"id":"2103.12828","title":"Learning to Optimize: A Primer and A Benchmark","created":"2021-03-23","cited_by_count":208,"area":null},{"id":"2410.01035","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","created":"2024-10-01","cited_by_count":35,"area":null},{"id":"2202.10199","title":"Permutation Predictions for Non-Clairvoyant Scheduling","created":"2022-02-21","cited_by_count":22,"area":null},{"id":"2205.03921","title":"Online Algorithms with Multiple Predictions","created":"2022-05-08","cited_by_count":22,"area":null},{"id":"2205.08715","title":"Customizing ML Predictions for Online Algorithms","created":"2022-05-18","cited_by_count":21,"area":null},{"id":"2203.09572","title":"Triangle and Four Cycle Counting with Predictions in Graph Streams","created":"2022-03-17","cited_by_count":20,"area":null},{"id":"2112.03082","title":"A Novel Prediction Setup for Online Speed-Scaling","created":"2021-12-06","cited_by_count":17,"area":null},{"id":"2205.12850","title":"A Universal Error Measure for Input Predictions Applied to Online Graph Problems","created":"2022-05-25","cited_by_count":14,"area":null},{"id":"2311.00749","title":"Sorting with Predictions","created":"2023-11-01","cited_by_count":14,"area":null},{"id":"2110.13052","title":"Can Q-Learning be Improved with Advice?","created":"2021-10-25","cited_by_count":13,"area":null},{"id":"2111.05257","title":"Logarithmic Regret from Sublinear Hints","created":"2021-11-09","cited_by_count":12,"area":null},{"id":"2205.08717","title":"A Regression Approach to Learning-Augmented Online Algorithms","created":"2022-05-18","cited_by_count":12,"area":null},{"id":"2110.11439","title":"(Optimal) Online Bipartite Matching with Degree Information","created":"2021-10-21","cited_by_count":11,"area":null},{"id":"2103.01640","title":"Double Coverage with Machine-Learned Advice","created":"2021-03-02","cited_by_count":10,"area":null},{"id":"2112.05422","title":"Robustification of Online Graph Exploration Methods","created":"2021-12-10","cited_by_count":10,"area":null},{"id":"2202.03519","title":"Smoothed Online Optimization with Unreliable Predictions","created":"2022-02-07","cited_by_count":10,"area":null},{"id":"2312.07535","title":"Improved Frequency Estimation Algorithms with and without Predictions","created":"2023-12-12","cited_by_count":10,"area":null},{"id":"2206.00655","title":"Learning-Augmented Algorithms for Online TSP on the Line","created":"2022-06-01","cited_by_count":8,"area":null},{"id":"2408.04122","title":"Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms","created":"2024-08-07","cited_by_count":8,"area":null},{"id":"2205.01247","title":"Scheduling with Speed Predictions","created":"2022-05-02","cited_by_count":6,"area":null},{"id":"2205.15695","title":"On Preemption and Learning in Stochastic Scheduling","created":"2022-05-31","cited_by_count":6,"area":null},{"id":"2205.13114","title":"Contextual Pandora's Box","created":"2022-05-26","cited_by_count":5,"area":null},{"id":"2305.18227","title":"Online Dynamic Acknowledgement with Learned Predictions","created":"2023-05-25","cited_by_count":5,"area":null},{"id":"2503.07545","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems","created":"2025-03-10","cited_by_count":5,"area":null},{"id":"2101.12160","title":"Online Capacity Scaling Augmented With Unreliable Machine Learning Predictions","created":"2021-01-28","cited_by_count":3,"area":null},{"id":"2110.00391","title":"Online Primal-Dual Algorithms with Predictions for Packing Problems","created":"2021-10-01","cited_by_count":3,"area":null},{"id":"2212.10433","title":"Scheduling with Predictions","created":"2022-12-20","cited_by_count":3,"area":null},{"id":"2305.07164","title":"Learning-Augmented Online Packet Scheduling with Deadlines","created":"2023-05-11","cited_by_count":3,"area":null},{"id":"2402.03564","title":"SkipPredict: When to Invest in Predictions for Scheduling","created":"2024-02-05","cited_by_count":3,"area":null},{"id":"2305.09245","title":"Sorting and Hypergraph Orientation under Uncertainty with Predictions","created":"2023-05-16","cited_by_count":2,"area":null},{"id":"2312.02547","title":"On Optimal Consistency-Robustness Trade-Off for Learning-Augmented Multi-Option Ski Rental","created":"2023-12-05","cited_by_count":2,"area":null},{"id":"2402.08701","title":"Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems","created":"2024-02-13","cited_by_count":2,"area":null},{"id":"2302.04182","title":"Online Resource Allocation: Bandits feedback and Advice on Time-varying Demands","created":"2023-02-08","cited_by_count":1,"area":null},{"id":"2312.14564","title":"Online Covering with Multiple Experts","created":"2023-12-22","cited_by_count":1,"area":null},{"id":"2401.02801","title":"Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions","created":"2024-01-05","cited_by_count":1,"area":null},{"id":"2402.17143","title":"Energy-Efficient Scheduling with Predictions","created":"2024-02-27","cited_by_count":1,"area":null},{"id":"2505.06146","title":"Learning-Augmented Algorithms for Boolean Satisfiability","created":"2025-05-09","cited_by_count":1,"area":null},{"id":"2512.07313","title":"Learning-Augmented Ski Rental with Discrete Distributions: A Bayesian Approach","created":"2025-12-08","cited_by_count":1,"area":null},{"id":"2602.02505","title":"Learning-augmented smooth integer programs with PAC-learnable oracles","created":"2026-01-22","cited_by_count":1,"area":null},{"id":"2510.00165","title":"Privacy-Preserving Learning-Augmented Data Structures","created":"2025-09-30","cited_by_count":0,"area":null},{"id":"2511.16194","title":"A Switching Framework for Online Interval Scheduling with Predictions","created":"2025-11-20","cited_by_count":0,"area":null},{"id":"2605.23255","title":"Learning-Augmented Online Scheduling with Parsimonious Preemption","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2609.24629","title":"Augmented Hypothesis Testing with Persona-Based LLM Simulations","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2610.01343","title":"Robust Non-Clairvoyant Scheduling with Classification Models","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.03430","title":"Jumping the Line: Exploiting Length Predictions in LLM Scheduling","created":"2026-10-02","cited_by_count":0,"area":null},{"id":"2610.06006","title":"Learning While Scheduling Jobs under Context-Dependent Service Rates: An Anytime Rate-Optimal Algorithm","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}