ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1908.02894
  4. Cited By
How much data is sufficient to learn high-performing algorithms?
  Generalization guarantees for data-driven algorithm design
v1v2v3v4 (latest)

How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design

Journal of the ACM (JACM), 2019
8 August 2019
Maria-Florina Balcan
Dan F. DeBlasio
Travis Dick
Carl Kingsford
Tuomas Sandholm
Ellen Vitercik
ArXiv (abs)PDFHTML

Papers citing "How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design"

24 / 24 papers shown
T-TAMER: Provably Taming Trade-offs in ML Serving
T-TAMER: Provably Taming Trade-offs in ML Serving
Yuanyuan Yang
Ruimin Zhang
Jamie Morgenstern
Haifeng Xu
121
0
0
26 Sep 2025
Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
Hongyu Cheng
Amitabh Basu
175
1
0
16 May 2025
Learning in Structured Stackelberg Games
Learning in Structured Stackelberg Games
Maria-Florina Balcan
Kiriaki Fragkia
Keegan Harris
257
1
0
11 Apr 2025
Utilitarian Algorithm Configuration
Utilitarian Algorithm ConfigurationNeural Information Processing Systems (NeurIPS), 2023
Devon R. Graham
Kevin Leyton-Brown
Tim Roughgarden
176
2
0
31 Oct 2023
Machine Learning for Cutting Planes in Integer Programming: A Survey
Machine Learning for Cutting Planes in Integer Programming: A SurveyInternational Joint Conference on Artificial Intelligence (IJCAI), 2023
Arnaud Deza
Elias Boutros Khalil
202
37
0
17 Feb 2023
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm
  Configuration
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm ConfigurationAAAI Conference on Artificial Intelligence (AAAI), 2022
Jasmin Brandt
Elias Schede
Viktor Bengs
Björn Haddenhorst
Eyke Hüllermeier
Kevin Tierney
179
7
0
01 Dec 2022
Algorithms with Prediction Portfolios
Algorithms with Prediction PortfoliosNeural Information Processing Systems (NeurIPS), 2022
M. Dinitz
Sungjin Im
Thomas Lavastida
Benjamin Moseley
Sergei Vassilvitskii
OOD
297
27
0
22 Oct 2022
Improved Generalization Bound and Learning of Sparsity Patterns for
  Data-Driven Low-Rank Approximation
Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank ApproximationInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022
Shinsaku Sakaue
Taihei Oki
286
5
0
17 Sep 2022
Provably tuning the ElasticNet across instances
Provably tuning the ElasticNet across instancesNeural Information Processing Systems (NeurIPS), 2022
Maria-Florina Balcan
M. Khodak
Dravyansh Sharma
Ameet Talwalkar
382
20
0
20 Jul 2022
Generalization Bounds for Data-Driven Numerical Linear Algebra
Generalization Bounds for Data-Driven Numerical Linear AlgebraAnnual Conference Computational Learning Theory (COLT), 2022
Peter L. Bartlett
Piotr Indyk
Tal Wagner
215
24
0
16 Jun 2022
Formalizing Preferences Over Runtime Distributions
Formalizing Preferences Over Runtime DistributionsInternational Conference on Machine Learning (ICML), 2022
Devon R. Graham
Kevin Leyton-Brown
Tim Roughgarden
215
6
0
25 May 2022
Structural Analysis of Branch-and-Cut and the Learnability of Gomory
  Mixed Integer Cuts
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer CutsNeural Information Processing Systems (NeurIPS), 2022
Maria-Florina Balcan
Siddharth Prasad
Tuomas Sandholm
Ellen Vitercik
135
27
0
15 Apr 2022
Setting Fair Incentives to Maximize Improvement
Setting Fair Incentives to Maximize ImprovementSymposium on Foundations of Responsible Computing (FRC), 2022
Saba Ahmadi
Hedyeh Beyhaghi
Avrim Blum
Keziah Naggita
274
6
0
28 Feb 2022
Learning Predictions for Algorithms with Predictions
Learning Predictions for Algorithms with PredictionsNeural Information Processing Systems (NeurIPS), 2022
M. Khodak
Maria-Florina Balcan
Ameet Talwalkar
Sergei Vassilvitskii
218
31
0
18 Feb 2022
Differentiable Economics for Randomized Affine Maximizer Auctions
Differentiable Economics for Randomized Affine Maximizer AuctionsInternational Joint Conference on Artificial Intelligence (IJCAI), 2022
Michael J. Curry
Tuomas Sandholm
John P. Dickerson
280
40
0
06 Feb 2022
A Survey of Methods for Automated Algorithm Configuration
A Survey of Methods for Automated Algorithm ConfigurationJournal of Artificial Intelligence Research (JAIR), 2022
Elias Schede
Jasmin Brandt
Alexander Tornede
Marcel Wever
Viktor Bengs
Eyke Hüllermeier
Kevin Tierney
237
70
0
03 Feb 2022
Improved Sample Complexity Bounds for Branch-and-Cut
Improved Sample Complexity Bounds for Branch-and-Cut
Maria-Florina Balcan
Siddharth Prasad
Tuomas Sandholm
Ellen Vitercik
254
21
0
18 Nov 2021
Faster Matchings via Learned Duals
Faster Matchings via Learned DualsNeural Information Processing Systems (NeurIPS), 2021
M. Dinitz
Sungjin Im
Thomas Lavastida
Benjamin Moseley
Sergei Vassilvitskii
128
82
0
20 Jul 2021
Sample Complexity of Tree Search Configuration: Cutting Planes and
  Beyond
Sample Complexity of Tree Search Configuration: Cutting Planes and BeyondNeural Information Processing Systems (NeurIPS), 2021
Maria-Florina Balcan
Siddharth Prasad
Tuomas Sandholm
Ellen Vitercik
191
48
0
08 Jun 2021
Generalization in portfolio-based algorithm selection
Generalization in portfolio-based algorithm selectionAAAI Conference on Artificial Intelligence (AAAI), 2020
Maria-Florina Balcan
Tuomas Sandholm
Ellen Vitercik
179
13
0
24 Dec 2020
Learnable and Instance-Robust Predictions for Online Matching, Flows and
  Load Balancing
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load BalancingEmbedded Systems and Applications (ESA), 2020
Thomas Lavastida
Benjamin Moseley
R. Ravi
Chenyang Xu
OOD
308
64
0
23 Nov 2020
Data-driven Algorithm Design
Data-driven Algorithm Design
Maria-Florina Balcan
119
3
0
14 Nov 2020
Learning Complexity of Simulated Annealing
Learning Complexity of Simulated AnnealingInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Avrim Blum
Chen Dan
Saeed Seddighin
381
28
0
06 Mar 2020
Learning to Link
Learning to LinkInternational Conference on Learning Representations (ICLR), 2019
Maria-Florina Balcan
Travis Dick
Manuel Lang
313
26
0
01 Jul 2019
1
Page 1 of 1