Refined bounds for algorithm configuration: The knife-edge of dual class
approximability

v1v2 (latest)

Refined bounds for algorithm configuration: The knife-edge of dual class approximability

21 June 2020

Maria-Florina Balcan

Tuomas Sandholm

ArXiv (abs)PDF HTML

Papers citing "Refined bounds for algorithm configuration: The knife-edge of dual class approximability"

10 / 10 papers shown

Title
Efficiently Learning the Graph for Semi-supervised Learning Dravyansh Sharma Maxwell Jones 69 6 0 12 Jun 2023
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration Jasmin Brandt Elias Schede Viktor Bengs Björn Haddenhorst Eyke Hüllermeier Kevin Tierney 44 5 0 01 Dec 2022
Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation Shinsaku Sakaue Taihei Oki 112 4 0 17 Sep 2022
Generalization Bounds for Data-Driven Numerical Linear Algebra Peter L. Bartlett Piotr Indyk Tal Wagner 95 15 0 16 Jun 2022
Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search Shinsaku Sakaue Taihei Oki 87 4 0 20 May 2022
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts Maria-Florina Balcan Siddharth Prasad Tuomas Sandholm Ellen Vitercik 40 22 0 15 Apr 2022
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 Maria-Florina Balcan Siddharth Prasad Tuomas Sandholm Ellen Vitercik 55 39 0 08 Jun 2021
Data driven semi-supervised learning Maria-Florina Balcan Dravyansh Sharma 64 16 0 18 Mar 2021
Generalization in portfolio-based algorithm selection Maria-Florina Balcan Tuomas Sandholm Ellen Vitercik 73 12 0 24 Dec 2020