{"total":25,"rows":[{"id":"2107.09770","title":"Faster Matchings via Learned Duals","created":"2021-07-20","cited_by_count":56,"area":null},{"id":"2106.04033","title":"Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond","created":"2021-06-08","cited_by_count":33,"area":null},{"id":"2202.01651","title":"A Survey of Methods for Automated Algorithm Configuration","created":"2022-02-03","cited_by_count":30,"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":"2202.02872","title":"Differentiable Economics for Randomized Affine Maximizer Auctions","created":"2022-02-06","cited_by_count":22,"area":null},{"id":"2302.09166","title":"Machine Learning for Cutting Planes in Integer Programming: A Survey","created":"2023-02-17","cited_by_count":20,"area":null},{"id":"2204.07312","title":"Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts","created":"2022-04-15","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":"2207.10199","title":"Provably tuning the ElasticNet across instances","created":"2022-07-20","cited_by_count":14,"area":null},{"id":"2111.11207","title":"Improved Sample Complexity Bounds for Branch-and-Cut","created":"2021-11-18","cited_by_count":13,"area":null},{"id":"2409.04367","title":"Algorithm Configuration for Structured Pfaffian Settings","created":"2024-09-06","cited_by_count":11,"area":null},{"id":"2203.00134","title":"Setting Fair Incentives to Maximize Improvement","created":"2022-02-28","cited_by_count":7,"area":null},{"id":"2212.00333","title":"AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration","created":"2022-12-01","cited_by_count":6,"area":null},{"id":"2209.08281","title":"Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation","created":"2022-09-17","cited_by_count":5,"area":null},{"id":"2205.13028","title":"Formalizing Preferences Over Runtime Distributions","created":"2022-05-25","cited_by_count":2,"area":null},{"id":"2402.14332","title":"Accelerating data-driven algorithm selection for combinatorial partitioning problems","created":"2024-02-22","cited_by_count":2,"area":null},{"id":"2504.09006","title":"Learning in Structured Stackelberg Games","created":"2025-04-11","cited_by_count":2,"area":null},{"id":"2511.10619","title":"Algorithm Design and Stronger Guarantees for the Improving Multi-Armed Bandits Problem","created":"2025-11-13","cited_by_count":2,"area":null},{"id":"2310.20401","title":"Utilitarian Algorithm Configuration","created":"2023-10-31","cited_by_count":1,"area":null},{"id":"2508.11874","title":"Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models","created":"2025-08-16","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":"2505.11636","title":"Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming","created":"2025-05-16","cited_by_count":0,"area":null},{"id":"2606.08638","title":"Parameter Tuning with Generalization Guarantees for GPU-Accelerated Linear Programming","created":"2026-06-07","cited_by_count":0,"area":null},{"id":"2607.14545","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","created":"2026-07-16","cited_by_count":0,"area":null}],"next_cursor":null}