A Survey of Methods for Automated Algorithm Configuration

DOI10.1613/JAIR.1.13676MaRDI QIDQ5041027zbMATH OpenOpenAlexWikidataFDO

Authors Elias Schede, Jasmin Brandt, Alexander Tornede, Marcel Wever, Viktor Bengs, Eyke Hüllermeier, Kevin Tierney

Publication date 18 October 2022

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.01651

zbMATH Keywords

machine learningsearch

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Automated Dynamic Algorithm Configuration
• Paramils: an automatic algorithm configuration framework
• Exploring variable neighborhood search for automatic algorithm configuration
• Pitfalls and best practices in algorithm configuration
• Boosting evolutionary algorithm configuration

Cited in

(13)

• Automated Dynamic Algorithm Configuration
• MPILS: an automatic tuner for MILP solvers
• Multi-armed bandits with censored consumption of resources
• Configuring mixed-integer programming solvers for large-scale instances
• PathWyse: a flexible, open-source library for the resource constrained shortest path problem
• A method for the automated configuration of anytime portfolios of algorithms
• Hyperparameter optimization in machine learning
• Novel tree-search method for synthesizing SMT strategies
• A causal framework for stochastic local search optimization algorithms
• Realtime gray-box algorithm configuration using cost-sensitive classification
• Regularization in Spider-style strategy discovery and schedule construction
• Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
• Bayesian quality-diversity optimization for conditional search-space problems

This page was built for publication: A Survey of Methods for Automated Algorithm Configuration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041027)