LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration

2 July 2018

Papers citing "LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration"

13 / 13 papers shown

Title
Utilitarian Algorithm Configuration for Infinite Parameter Spaces Devon R. Graham Kevin Leyton-Brown 109 0 0 28 May 2024
Formalizing Preferences Over Runtime Distributions Devon R. Graham Kevin Leyton-Brown Tim Roughgarden 60 5 0 25 May 2022
Online Learning for Min Sum Set Cover and Pandora's Box Evangelia Gergatsouli Christos Tzamos 56 15 0 10 Feb 2022
A Survey of Methods for Automated Algorithm Configuration Elias Schede Jasmin Brandt Alexander Tornede Marcel Wever Viktor Bengs Eyke Hüllermeier Kevin Tierney 98 53 0 03 Feb 2022
Improved Sample Complexity Bounds for Branch-and-Cut Maria-Florina Balcan Siddharth Prasad Tuomas Sandholm Ellen Vitercik 86 16 0 18 Nov 2021
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond Maria-Florina Balcan Siddharth Prasad Tuomas Sandholm Ellen Vitercik 63 39 0 08 Jun 2021
Data-driven Algorithm Design Maria-Florina Balcan 37 2 0 14 Nov 2020
Fast Perturbative Algorithm Configurators George T. Hall P. S. Oliveto Dirk Sudholt 64 7 0 07 Jul 2020
Refined bounds for algorithm configuration: The knife-edge of dual class approximability Maria-Florina Balcan Tuomas Sandholm Ellen Vitercik 71 15 0 21 Jun 2020
Analysis of the Performance of Algorithm Configurators for Search Heuristics with Global Mutation Operators George T. Hall P. S. Oliveto Dirk Sudholt 68 10 0 09 Apr 2020
On Performance Estimation in Automatic Algorithm Configuration Shengcai Liu K. Tang Yunwen Lei Xin Yao 77 23 0 19 Nov 2019
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees Maria-Florina Balcan Tuomas Sandholm Ellen Vitercik 70 16 0 26 May 2019
Benchmark and Survey of Automated Machine Learning Frameworks Marc-André Zöller Marco F. Huber 75 86 0 26 Apr 2019