{"total":55,"rows":[{"id":"2106.04502","title":"Federated Hyperparameter Tuning: Challenges, Baselines, and Connections to Weight-Sharing","created":"2021-06-08","cited_by_count":58,"area":null},{"id":"2102.08446","title":"Smoothed Analysis with Adaptive Adversaries","created":"2021-02-16","cited_by_count":57,"area":null},{"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":"2309.07835","title":"Learning to Warm-Start Fixed-Point Optimization Algorithms","created":"2023-09-14","cited_by_count":32,"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.08549","title":"Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries","created":"2022-02-17","cited_by_count":21,"area":null},{"id":"2205.08715","title":"Customizing ML Predictions for Online Algorithms","created":"2022-05-18","cited_by_count":21,"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":"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":"2207.10199","title":"Provably tuning the ElasticNet across instances","created":"2022-07-20","cited_by_count":14,"area":null},{"id":"2107.06336","title":"Improving Cooperative Game Theory-based Data Valuation via Data Utility Learning","created":"2021-07-13","cited_by_count":13,"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":"2112.05422","title":"Robustification of Online Graph Exploration Methods","created":"2021-12-10","cited_by_count":10,"area":null},{"id":"2309.00203","title":"Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming","created":"2023-09-01","cited_by_count":10,"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":"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":"2112.05353","title":"Learning-Augmented Algorithms for Online Steiner Tree","created":"2021-12-10","cited_by_count":6,"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.13114","title":"Contextual Pandora's Box","created":"2022-05-26","cited_by_count":5,"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":"2305.18227","title":"Online Dynamic Acknowledgement with Learned Predictions","created":"2023-05-25","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":"2405.13992","title":"Learning Cut Generating Functions for Integer Programming","created":"2024-05-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":"2109.06234","title":"Machine Learning for Online Algorithm Selection under Censored Feedback","created":"2021-09-13","cited_by_count":3,"area":null},{"id":"2405.15911","title":"Learning accurate and interpretable tree-based models","created":"2024-05-24","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":"2407.17200","title":"Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems","created":"2024-07-24","cited_by_count":3,"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":"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":"2404.17034","title":"Learning Actionable Counterfactual Explanations in Large State Spaces","created":"2024-04-25","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":"2506.00252","title":"How hard is learning to cut? Trade-offs and sample complexity","created":"2025-05-30","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":"2610.03945","title":"DePICT: Decision-Preserving Interface for Constrained Downstream Tasks","created":"2026-10-02","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":"2212.08186","title":"Learning Sparsity and Randomness for Data-driven Low Rank Approximation","created":"2022-12-15","cited_by_count":0,"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":"2502.13653","title":"A Query-Driven Approach to Space-Efficient Range Searching","created":"2025-02-19","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},{"id":"2601.20203","title":"Minimum-Cost Network Flow with Dual Predictions","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2607.09909","title":"Learning Partition Trees for Nearest Neighbor Search","created":"2026-07-10","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},{"id":"2607.29606","title":"QASP: Query-Adaptive Robust Vector Search Policy","created":"2026-07-31","cited_by_count":0,"area":null}],"next_cursor":null}