{"total":26,"rows":[{"id":"2309.07835","title":"Learning to Warm-Start Fixed-Point Optimization Algorithms","created":"2023-09-14","cited_by_count":32,"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":"2206.07886","title":"Generalization Bounds for Data-Driven Numerical Linear Algebra","created":"2022-06-16","cited_by_count":24,"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":"2108.08770","title":"Learning-to-learn non-convex piecewise-Lipschitz functions","created":"2021-08-19","cited_by_count":15,"area":null},{"id":"2103.10547","title":"Data driven semi-supervised learning","created":"2021-03-18","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":"2202.04870","title":"Online Learning for Min Sum Set Cover and Pandora's Box","created":"2022-02-10","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":"2204.03569","title":"Accelerating ERM for data-driven algorithm design using output-sensitive techniques","created":"2022-04-07","cited_by_count":8,"area":null},{"id":"2205.13114","title":"Contextual Pandora's Box","created":"2022-05-26","cited_by_count":5,"area":null},{"id":"2306.07098","title":"Efficiently Learning the Graph for Semi-supervised Learning","created":"2023-06-12","cited_by_count":5,"area":null},{"id":"2404.13831","title":"Data-Driven Performance Guarantees for Classical and Learned Optimizers","created":"2024-04-22","cited_by_count":5,"area":null},{"id":"2302.11700","title":"New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs","created":"2023-02-22","cited_by_count":4,"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":"2405.18246","title":"Utilitarian Algorithm Configuration for Infinite Parameter Spaces","created":"2024-05-28","cited_by_count":2,"area":null},{"id":"2507.05084","title":"Distribution-dependent Generalization Bounds for Tuning Linear Regression Across Tasks","created":"2025-07-07","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":"2409.03129","title":"Subsidy design for better social outcomes","created":"2024-09-04","cited_by_count":1,"area":null},{"id":"2512.05084","title":"Gradient Descent with Provably Tuned Learning-rate Schedules","created":"2025-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":"2603.18551","title":"Learning Decision-Sufficient Representations for Linear Optimization","created":"2026-03-19","cited_by_count":1,"area":null},{"id":"2109.14271","title":"(Machine) Learning to Improve the Empirical Performance of Discrete Algorithms","created":"2021-09-29","cited_by_count":0,"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}],"next_cursor":null}