{"total":186,"rows":[{"id":"2407.17712","title":"Improving Online Algorithms via ML Predictions","created":"2024-07-25","cited_by_count":66,"area":null},{"id":"2107.09770","title":"Faster Matchings via Learned Duals","created":"2021-07-20","cited_by_count":56,"area":null},{"id":"2110.14094","title":"Learning-Augmented $k$-means Clustering","created":"2021-10-27","cited_by_count":26,"area":null},{"id":"2207.06272","title":"Hindsight Learning for MDPs with Exogenous Inputs","created":"2022-07-13","cited_by_count":26,"area":null},{"id":"2202.09312","title":"Learning Predictions for Algorithms with Predictions","created":"2022-02-18","cited_by_count":25,"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":"2110.13116","title":"Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds","created":"2021-10-25","cited_by_count":20,"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":"2109.01556","title":"Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems","created":"2021-09-03","cited_by_count":19,"area":null},{"id":"2202.04262","title":"Parsimonious Learning-Augmented Caching","created":"2022-02-09","cited_by_count":19,"area":null},{"id":"2206.11780","title":"Chasing Convex Bodies and Functions with Black-Box Advice","created":"2022-06-23","cited_by_count":19,"area":null},{"id":"2210.12438","title":"Algorithms with Prediction Portfolios","created":"2022-10-22","cited_by_count":19,"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":"2106.08396","title":"Learning-based Support Estimation in Sublinear Time","created":"2021-06-15","cited_by_count":16,"area":null},{"id":"2205.09961","title":"Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions","created":"2022-05-20","cited_by_count":16,"area":null},{"id":"2302.06832","title":"Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis","created":"2023-02-14","cited_by_count":16,"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":"2304.01781","title":"Mixing predictions for online metric algorithms","created":"2023-04-04","cited_by_count":13,"area":null},{"id":"2405.09784","title":"Online bipartite matching with imperfect advice","created":"2024-05-16","cited_by_count":13,"area":null},{"id":"2106.14693","title":"Robust Learning-Augmented Caching: An Experimental Study","created":"2021-06-28","cited_by_count":12,"area":null},{"id":"2110.15843","title":"Adaptive Discretization in Online Reinforcement Learning","created":"2021-10-29","cited_by_count":12,"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":"2404.06280","title":"Algorithms for Caching and MTS with reduced number of predictions","created":"2024-04-09","cited_by_count":12,"area":null},{"id":"2102.03311","title":"Online Bin Packing with Predictions","created":"2021-02-05","cited_by_count":11,"area":null},{"id":"2110.11439","title":"(Optimal) Online Bipartite Matching with Degree Information","created":"2021-10-21","cited_by_count":11,"area":null},{"id":"2207.12911","title":"Learning-Augmented Maximum Flow","created":"2022-07-26","cited_by_count":11,"area":null},{"id":"2209.10614","title":"Learning-Augmented Algorithms for Online Linear and Semidefinite Programming","created":"2022-09-21","cited_by_count":11,"area":null},{"id":"2409.04367","title":"Algorithm Configuration for Structured Pfaffian Settings","created":"2024-09-06","cited_by_count":11,"area":null},{"id":"2411.16030","title":"Binary Search with Distributional Predictions","created":"2024-11-25","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":"2208.06414","title":"Optimistic No-regret Algorithms for Discrete Caching","created":"2022-08-15","cited_by_count":10,"area":null},{"id":"2210.02775","title":"Paging with Succinct Predictions","created":"2022-10-06","cited_by_count":10,"area":null},{"id":"2305.19588","title":"Active causal structure learning with advice","created":"2023-05-31","cited_by_count":10,"area":null},{"id":"2310.20598","title":"Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms","created":"2023-10-31","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":"2508.14544","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","created":"2025-08-20","cited_by_count":10,"area":null},{"id":"2202.10939","title":"Single-Leg Revenue Management with Advice","created":"2022-02-18","cited_by_count":9,"area":null},{"id":"2211.06567","title":"Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets","created":"2022-11-12","cited_by_count":9,"area":null},{"id":"2310.11558","title":"Online Algorithms with Uncertainty-Quantified Predictions","created":"2023-10-17","cited_by_count":9,"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":"2307.10524","title":"Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictions","created":"2023-07-20","cited_by_count":8,"area":null},{"id":"2403.07413","title":"Learning-Augmented Algorithms with Explicit Predictors","created":"2024-03-12","cited_by_count":8,"area":null},{"id":"2404.12485","title":"Contract Scheduling with Distributional and Multiple Advice","created":"2024-04-18","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":"2505.19252","title":"Learning-Augmented Online Bipartite Fractional Matching","created":"2025-05-25","cited_by_count":8,"area":null},{"id":"2604.00499","title":"Scheduling LLM Inference with Uncertainty-Aware Output Length Predictions","created":"2026-04-01","cited_by_count":8,"area":null},{"id":"2111.10285","title":"Adversarial Deep Learning for Online Resource Allocation","created":"2021-11-19","cited_by_count":7,"area":null},{"id":"2202.10590","title":"Online Caching with Optimistic Learning","created":"2022-02-22","cited_by_count":7,"area":null},{"id":"2203.04274","title":"Leveraging Initial Hints for Free in Stochastic Linear Bandits","created":"2022-03-08","cited_by_count":7,"area":null},{"id":"2306.12282","title":"Online Resource Allocation with Convex-set Machine-Learned Advice","created":"2023-06-21","cited_by_count":7,"area":null},{"id":"2405.01013","title":"Non-clairvoyant Scheduling with Partial Predictions","created":"2024-05-02","cited_by_count":7,"area":null},{"id":"2406.04793","title":"Learning-Augmented Priority Queues","created":"2024-06-07","cited_by_count":7,"area":null},{"id":"2410.15257","title":"Learning-Augmented Algorithms for the Bahncard Problem","created":"2024-10-20","cited_by_count":7,"area":null},{"id":"2501.12770","title":"On Tradeoffs in Learning-Augmented Algorithms","created":"2025-01-22","cited_by_count":7,"area":null},{"id":"2502.02861","title":"Algorithms with Calibrated Machine Learning Predictions","created":"2025-02-05","cited_by_count":7,"area":null},{"id":"2112.05353","title":"Learning-Augmented Algorithms for Online Steiner Tree","created":"2021-12-10","cited_by_count":6,"area":null},{"id":"2205.01247","title":"Scheduling with Speed Predictions","created":"2022-05-02","cited_by_count":6,"area":null},{"id":"2206.01341","title":"Equipping Black-Box Policies with Model-Based Advice for Stable Nonlinear Control","created":"2022-06-02","cited_by_count":6,"area":null},{"id":"2211.02703","title":"Online Learning and Bandits with Queried Hints","created":"2022-11-04","cited_by_count":6,"area":null},{"id":"2107.08277","title":"Improved Bounds for Online Facility Location with Predictions","created":"2021-07-17","cited_by_count":5,"area":null},{"id":"2205.13114","title":"Contextual Pandora's Box","created":"2022-05-26","cited_by_count":5,"area":null},{"id":"2210.11222","title":"Learning-Augmented Private Algorithms for Multiple Quantile Release","created":"2022-10-20","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":"2306.00172","title":"Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees","created":"2023-05-31","cited_by_count":5,"area":null},{"id":"2405.14066","title":"Online Classification with Predictions","created":"2024-05-22","cited_by_count":5,"area":null},{"id":"2406.18752","title":"Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems","created":"2024-06-26","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":"2201.02890","title":"Lazy Lagrangians with Predictions for Online Learning","created":"2022-01-08","cited_by_count":4,"area":null},{"id":"2204.09345","title":"Online Caching with no Regret: Optimistic Learning via Recommendations","created":"2022-04-20","cited_by_count":4,"area":null},{"id":"2311.03564","title":"Low-Rank MDPs with Continuous Action Spaces","created":"2023-11-06","cited_by_count":4,"area":null},{"id":"2402.10457","title":"Learning-Augmented Search Data Structures","created":"2024-02-16","cited_by_count":4,"area":null},{"id":"2402.14012","title":"Chasing Convex Functions with Long-term Constraints","created":"2024-02-21","cited_by_count":4,"area":null},{"id":"2402.17736","title":"Learning-Based Algorithms for Graph Searching Problems","created":"2024-02-27","cited_by_count":4,"area":null},{"id":"2403.03219","title":"LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits","created":"2024-03-05","cited_by_count":4,"area":null},{"id":"2410.01580","title":"Learning-Augmented Robust Algorithmic Recourse","created":"2024-10-02","cited_by_count":4,"area":null},{"id":"2411.09854","title":"Fair Secretaries with Unfair Predictions","created":"2024-11-15","cited_by_count":4,"area":null},{"id":"2502.05720","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","created":"2025-02-08","cited_by_count":4,"area":null},{"id":"2505.23967","title":"Improved Approximations for Hard Graph Problems using Predictions","created":"2025-05-29","cited_by_count":4,"area":null},{"id":"2508.03253","title":"Approximate Proportionality in Online Fair Division","created":"2025-08-05","cited_by_count":4,"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":"2104.06050","title":"Sequential Ski Rental Problem","created":"2021-04-13","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":"2302.00928","title":"Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\\text{L}$-/$\\text{L}^\\natural$-Convex Function Minimization","created":"2023-02-02","cited_by_count":3,"area":null},{"id":"2303.14646","title":"A Survey of Machine Learning-Based Ride-Hailing Planning","created":"2023-03-26","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":"2305.13293","title":"Time Fairness in Online Knapsack Problems","created":"2023-05-22","cited_by_count":3,"area":null},{"id":"2306.05865","title":"Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case","created":"2023-06-09","cited_by_count":3,"area":null},{"id":"2310.20098","title":"Robust Learning for Smoothed Online Convex Optimization with Feedback Delay","created":"2023-10-31","cited_by_count":3,"area":null},{"id":"2402.06715","title":"Learning-augmented Online Algorithm for Two-level Ski-rental Problem","created":"2024-02-09","cited_by_count":3,"area":null},{"id":"2402.13530","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","created":"2024-02-21","cited_by_count":3,"area":null},{"id":"2406.16270","title":"Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams","created":"2024-06-24","cited_by_count":3,"area":null},{"id":"2410.00796","title":"Fast and Reliable $N-k$ Contingency Screening with Input-Convex Neural Networks","created":"2024-10-01","cited_by_count":3,"area":null}],"next_cursor":"100"}