853 citations
- Sorbonne UniversitéFR398 papers
- Centre National de la Recherche ScientifiqueFR380 papers
- Université Paris CitéFR136 papers
- Université Pierre-et-Marie-CurieFR97 papers
- University of EdinburghGB89 papers
- Institut national de recherche en sciences et technologies du numériqueFR85 papers
- Université Paris-SaclayFR67 papers
- University of OxfordGB54 papers
- École PolytechniqueFR50 papers
- Sorbonne Paris CitéFR48 papers
- Massachusetts Institute of TechnologyUS45 papers
- Universidade Federal do Rio de JaneiroBR45 papers
20 papers · 1 filter
Similarity-based Portfolio Construction for Black-box Optimization
Catalin-Viorel Dinu, Diederick Vermetten, Carola Doerr
In black-box optimization, a central question is which algorithm to use to solve a given, previously unseen, problem. Selecting a single algorithm, however, entails inherent risks:…
Enhancing Parameter Control Policies with State Information
Gianluca Covini, Denis Antipov, Carola Doerr
Parameter control and dynamic algorithm configuration study how to dynamically choose suitable configurations of a parametrized algorithm during the optimization process. Despite b…
CGP++ : A Modern C++ Implementation of Cartesian Genetic Programming
Roman Kalkreuth, Thomas Baeck
The reference implementation of Cartesian Genetic Programming (CGP) was written in the C programming language. C inherently follows a procedural programming paradigm, which entails…
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms
François Clément, Diederick Vermetten, Jacob de Nobel +3
The star discrepancy is a measure for the regularity of a finite set of points taken from . Low discrepancy point sets are highly relevant for Quasi-Monte Car…
Improving Nevergrad's Algorithm Selection Wizard NGOpt through Automated Algorithm Configuration
Risto Trajanov, Ana Nikolikj, Gjorgjina Cenikj +6
Algorithm selection wizards are effective and versatile tools that automatically select an optimization algorithm given high-level information about the problem and available compu…
Fast Re-Optimization of LeadingOnes with Frequent Changes
Nina Bulanova, Arina Buzdalova, Carola Doerr
In real-world optimization scenarios, the problem instance that we are asked to solve may change during the optimization process, e.g., when new information becomes available or wh…