{"total":153,"rows":[{"id":"2107.09770","title":"Faster Matchings via Learned Duals","created":"2021-07-20","cited_by_count":56,"area":null},{"id":"2309.07835","title":"Learning to Warm-Start Fixed-Point Optimization Algorithms","created":"2023-09-14","cited_by_count":32,"area":null},{"id":"2110.14094","title":"Learning-Augmented $k$-means Clustering","created":"2021-10-27","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":"2206.07886","title":"Generalization Bounds for Data-Driven Numerical Linear Algebra","created":"2022-06-16","cited_by_count":24,"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":"2202.04262","title":"Parsimonious Learning-Augmented Caching","created":"2022-02-09","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":"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":"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":"2106.14693","title":"Robust Learning-Augmented Caching: An Experimental Study","created":"2021-06-28","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":"2407.11364","title":"Learning-augmented Maximum Independent Set","created":"2024-07-16","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":"2210.02775","title":"Paging with Succinct Predictions","created":"2022-10-06","cited_by_count":10,"area":null},{"id":"2210.17028","title":"Improved Learning-augmented Algorithms for k-means and k-medians Clustering","created":"2022-10-31","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":"2202.10939","title":"Single-Leg Revenue Management with Advice","created":"2022-02-18","cited_by_count":9,"area":null},{"id":"2210.03594","title":"Label Propagation with Weak Supervision","created":"2022-10-07","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":"2505.21692","title":"What Data Enables Optimal Decisions? An Exact Characterization for Linear Optimization","created":"2025-05-27","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.02295","title":"Meta-Learning Adversarial Bandit Algorithms","created":"2023-07-05","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":"2604.00499","title":"Scheduling LLM Inference with Uncertainty-Aware Output Length Predictions","created":"2026-04-01","cited_by_count":8,"area":null},{"id":"2207.07949","title":"A Nearly Tight Analysis of Greedy k-means++","created":"2022-07-16","cited_by_count":7,"area":null},{"id":"2301.12863","title":"Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints","created":"2023-01-30","cited_by_count":7,"area":null},{"id":"2302.01827","title":"Online Ad Allocation with Predictions","created":"2023-02-03","cited_by_count":7,"area":null},{"id":"2402.02328","title":"Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut","created":"2024-02-04","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":"2502.02861","title":"Algorithms with Calibrated Machine Learning Predictions","created":"2025-02-05","cited_by_count":7,"area":null},{"id":"2505.23696","title":"Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms","created":"2025-05-29","cited_by_count":7,"area":null},{"id":"2205.01247","title":"Scheduling with Speed Predictions","created":"2022-05-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.14128","title":"Meta-Learning Adversarial Bandits","created":"2022-05-27","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":"2302.00985","title":"Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary","created":"2023-02-02","cited_by_count":5,"area":null},{"id":"2305.10536","title":"Online List Labeling with Predictions","created":"2023-05-17","cited_by_count":5,"area":null},{"id":"2405.13992","title":"Learning Cut Generating Functions for Integer Programming","created":"2024-05-22","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":"2503.07545","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems","created":"2025-03-10","cited_by_count":5,"area":null},{"id":"2107.09480","title":"Learned Sorted Table Search and Static Indexes in Small Model Space","created":"2021-07-19","cited_by_count":4,"area":null},{"id":"2112.06563","title":"On the Choice of General Purpose Classifiers in Learned Bloom Filters: An Initial Analysis Within Basic Filters","created":"2021-12-13","cited_by_count":4,"area":null},{"id":"2212.09521","title":"Mechanism Design With Predictions for Obnoxious Facility Location","created":"2022-12-19","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.17736","title":"Learning-Based Algorithms for Graph Searching Problems","created":"2024-02-27","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":"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":"2509.03733","title":"Differentiable Entropy Regularization: A Complexity-Aware Approach for Neural Optimization","created":"2025-09-03","cited_by_count":4,"area":null},{"id":"2510.19372","title":"On the Hardness of Reinforcement Learning with Transition Look-Ahead","created":"2025-10-22","cited_by_count":4,"area":"deeprl"},{"id":"2203.14777","title":"On the Suitability of Neural Networks as Building Blocks for The Design of Efficient Learned Indexes","created":"2022-02-21","cited_by_count":3,"area":null},{"id":"2211.09251","title":"On the Power of Learning-Augmented Search Trees","created":"2022-11-16","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":"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":"2402.02774","title":"Accelerating Matroid Optimization through Fast Imprecise Oracles","created":"2024-02-05","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":"2406.16270","title":"Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams","created":"2024-06-24","cited_by_count":3,"area":null},{"id":"2501.14155","title":"Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices","created":"2025-01-24","cited_by_count":3,"area":null},{"id":"2509.20979","title":"Toward Robust and Efficient ML-Based GPU Caching for Modern Inference","created":"2025-09-25","cited_by_count":3,"area":null},{"id":"2509.21293","title":"Optimal Robust Recourse with $L^p$-Bounded Model Change","created":"2025-09-25","cited_by_count":3,"area":null},{"id":"2607.17545","title":"Retain or Consolidate? Budget-Dependent Operator Selection for Language Agent Memory","created":"2026-07-20","cited_by_count":3,"area":"agents"},{"id":"2112.01592","title":"Online Search With Best-Price and Query-Based Predictions","created":"2021-12-02","cited_by_count":2,"area":null},{"id":"2310.01551","title":"Harnessing the Power of Choices in Decision Tree Learning","created":"2023-10-02","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":"2405.18568","title":"Warm-starting Push-Relabel","created":"2024-05-28","cited_by_count":2,"area":null},{"id":"2407.09387","title":"Meta-Analysis with Untrusted Data","created":"2024-07-12","cited_by_count":2,"area":null},{"id":"2407.16355","title":"Online Learning with Sublinear Best-Action Queries","created":"2024-07-23","cited_by_count":2,"area":null},{"id":"2409.11516","title":"Learning-Augmented Frequency Estimation in Sliding Windows","created":"2024-09-17","cited_by_count":2,"area":null},{"id":"2409.15205","title":"Fast and Accurate Triangle Counting in Graph Streams Using Predictions","created":"2024-09-23","cited_by_count":2,"area":null},{"id":"2502.11981","title":"Welfare as a Guiding Principle for Machine Learning -- From Compass, to Lens, to Roadmap","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2502.15345","title":"Efficiently Solving Discounted MDPs with Predictions on Transition Matrices","created":"2025-02-21","cited_by_count":2,"area":null},{"id":"2503.00937","title":"Learning-Augmented Frequent Directions","created":"2025-03-02","cited_by_count":2,"area":null},{"id":"2506.05479","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","created":"2025-06-05","cited_by_count":2,"area":null},{"id":"2510.13444","title":"Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers","created":"2025-10-15","cited_by_count":2,"area":null},{"id":"2511.11413","title":"Multicalibration Yields Better Matchings","created":"2025-11-14","cited_by_count":2,"area":null},{"id":"2511.23388","title":"Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model","created":"2025-11-28","cited_by_count":2,"area":null},{"id":"2601.07482","title":"The Secretary Problem with Predictions and a Chosen Order","created":"2026-01-12","cited_by_count":2,"area":null},{"id":"2602.21104","title":"Ski Rental with Distributional Predictions of Unknown Quality","created":"2026-02-24","cited_by_count":2,"area":null},{"id":"2605.08287","title":"Multi-Armed Bandits With Best-Action Queries","created":"2026-05-08","cited_by_count":2,"area":null},{"id":"2606.02671","title":"Aligning Data-Driven Predictors with Allocation: A Decision-Focused Approach to Survival Analysis","created":"2026-06-01","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}],"next_cursor":"100"}