ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1905.10819
  4. Cited By
Learning to Optimize Computational Resources: Frugal Training with
  Generalization Guarantees
v1v2v3 (latest)

Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees

26 May 2019
Maria-Florina Balcan
Tuomas Sandholm
Ellen Vitercik
ArXiv (abs)PDFHTML

Papers citing "Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees"

8 / 8 papers shown
Title
A Machine Learning Approach to Two-Stage Adaptive Robust Optimization
A Machine Learning Approach to Two-Stage Adaptive Robust Optimization
Dimitris Bertsimas
Cheolhyeong Kim
85
8
0
23 Jul 2023
Optimal Control of Multiclass Fluid Queueing Networks: A Machine
  Learning Approach
Optimal Control of Multiclass Fluid Queueing Networks: A Machine Learning Approach
Dimitris Bertsimas
Cheolhyeong Kim
26
2
0
23 Jul 2023
A Survey of Methods for Automated Algorithm Configuration
A Survey of Methods for Automated Algorithm Configuration
Elias Schede
Jasmin Brandt
Alexander Tornede
Marcel Wever
Viktor Bengs
Eyke Hüllermeier
Kevin Tierney
92
52
0
03 Feb 2022
Sample Complexity of Tree Search Configuration: Cutting Planes and
  Beyond
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
Maria-Florina Balcan
Siddharth Prasad
Tuomas Sandholm
Ellen Vitercik
55
39
0
08 Jun 2021
Data driven semi-supervised learning
Data driven semi-supervised learning
Maria-Florina Balcan
Dravyansh Sharma
64
16
0
18 Mar 2021
Generalization in portfolio-based algorithm selection
Generalization in portfolio-based algorithm selection
Maria-Florina Balcan
Tuomas Sandholm
Ellen Vitercik
73
12
0
24 Dec 2020
Refined bounds for algorithm configuration: The knife-edge of dual class
  approximability
Refined bounds for algorithm configuration: The knife-edge of dual class approximability
Maria-Florina Balcan
Tuomas Sandholm
Ellen Vitercik
68
15
0
21 Jun 2020
How much data is sufficient to learn high-performing algorithms?
  Generalization guarantees for data-driven algorithm design
How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design
Maria-Florina Balcan
Dan F. DeBlasio
Travis Dick
Carl Kingsford
Tuomas Sandholm
Ellen Vitercik
65
35
0
08 Aug 2019
1