Efficient benchmarking of algorithm configurators via model-based surrogates
From MaRDI portal
Recommendations
- Capping methods for the automatic configuration of optimization algorithms
- scientific article; zbMATH DE number 5829047
- Model-based algorithm configuration with adaptive capping and prior distributions
- Pitfalls and best practices in algorithm configuration
- Paramils: an automatic algorithm configuration framework
Cites work
- scientific article; zbMATH DE number 5957364 (Why is no real title available?)
- scientific article; zbMATH DE number 2038892 (Why is no real title available?)
- scientific article; zbMATH DE number 1881076 (Why is no real title available?)
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- A Parallel Mixture of SVMs for Very Large Scale Problems
- A meta-learning method to select the kernel width in support vector regression
- ASlib: a benchmark library for algorithm selection
- Algorithm runtime prediction: methods \& evaluation
- Automated testing and debugging of SAT and QBF solvers
- Automatic model selection for high-dimensional survival analysis
- Bayesian learning for neural networks
- Choosing probability distributions for stochastic local search and the role of make versus break
- Conflict-driven answer set solving: from theory to practice
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Empirical hardness models, methodology and a case study on combinatorial auctions
- Gaussian processes for machine learning.
- HPOlib
- Metalearning
- MiniSat
- Paramils: an automatic algorithm configuration framework
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- Principles and Practice of Constraint Programming – CP 2004
- Quantile regression forests
- Quantile regression.
- Random forests
- SATzilla: portfolio-based algorithm selection for SAT
- SpyBug: automated bug detection in the configuration space of SAT solvers
- Stochastic local search. Foundations and applications.
- Support-vector networks
- The configurable SAT solver challenge (CSSC)
- The design and analysis of computer experiments.
- Theory and Applications of Satisfiability Testing
Cited in
(4)- Purposeful cross-validation: a novel cross-validation strategy for improved surrogate optimizability
- Benchmark and survey of automated machine learning frameworks
- Scalable Gaussian process-based transfer surrogates for hyperparameter optimization
- Tunability: importance of hyperparameters of machine learning algorithms
Describes a project that uses
Uses Software
This page was built for publication: Efficient benchmarking of algorithm configurators via model-based surrogates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707462)
