{"total":25,"rows":[{"id":"2309.07835","title":"Learning to Warm-Start Fixed-Point Optimization Algorithms","created":"2023-09-14","cited_by_count":32,"area":null},{"id":"2210.12153","title":"On amortizing convex conjugates for optimal transport","created":"2022-10-21","cited_by_count":31,"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":"2409.04367","title":"Algorithm Configuration for Structured Pfaffian Settings","created":"2024-09-06","cited_by_count":11,"area":null},{"id":"2210.03594","title":"Label Propagation with Weak Supervision","created":"2022-10-07","cited_by_count":9,"area":null},{"id":"2307.02295","title":"Meta-Learning Adversarial Bandit Algorithms","created":"2023-07-05","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":"2502.02861","title":"Algorithms with Calibrated Machine Learning Predictions","created":"2025-02-05","cited_by_count":7,"area":null},{"id":"2205.09963","title":"Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search","created":"2022-05-20","cited_by_count":6,"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":"2402.10457","title":"Learning-Augmented Search Data Structures","created":"2024-02-16","cited_by_count":4,"area":null},{"id":"2405.03661","title":"Competitive strategies to use \"warm start\" algorithms with predictions","created":"2024-05-06","cited_by_count":4,"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":"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":"2412.03332","title":"On Approximability of $\\ell_2^2$ Min-Sum Clustering","created":"2024-12-04","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":"2310.02246","title":"Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances","created":"2023-10-03","cited_by_count":0,"area":null},{"id":"2403.12181","title":"MAC Advice for Facility Location Mechanism Design","created":"2024-03-18","cited_by_count":0,"area":null},{"id":"2510.03917","title":"Transductive and Learning-Augmented Online Regression","created":"2025-10-04","cited_by_count":0,"area":null},{"id":"2603.18157","title":"Learning-Augmented Algorithms for $k$-median via Online Learning","created":"2026-03-18","cited_by_count":0,"area":null},{"id":"2605.09382","title":"Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts","created":"2026-05-10","cited_by_count":0,"area":null},{"id":"2605.22653","title":"The Secretary Problem with a Stochastic Precursor","created":"2026-05-21","cited_by_count":0,"area":null},{"id":"2607.20769","title":"Memory-Computation Tradeoffs in Semi Amortized Parametric Optimization","created":"2026-07-22","cited_by_count":0,"area":null},{"id":"2609.04787","title":"Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implications","created":"2026-09-04","cited_by_count":0,"area":null}],"next_cursor":null}