Copertina

A Survey of Meta-features Used for Automated Selection of Algorithms for Black-box Single-objective Continuous Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cenikj, Gjorgjina, Nikolikj, Ana, Petelin, Gašper, van Stein, Niki, Doerr, Carola, Eftimov, Tome
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Neural and Evolutionary Computing 68W50 (Primary) 68T30 (Secondary) F.2.1; I.2.4
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Comparing Optimization Algorithms Through the Lens of Search Behavior Analysis
di: Cenikj, Gjorgjina, et al.
Pubblicazione: (2025)

ClustOpt: A Clustering-based Approach for Representing and Visualizing the Search Dynamics of Numerical Metaheuristic Optimization Algorithms
di: Cenikj, Gjorgjina, et al.
Pubblicazione: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
di: Doerr, Benjamin, et al.
Pubblicazione: (2025)

Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks
di: Nikolikj, Ana, et al.
Pubblicazione: (2024)

Optimizing Genetic Algorithms Using the Binomial Distribution
di: Cicirello, Vincent A.
Pubblicazione: (2024)

First Steps Towards a Runtime Analysis When Starting With a Good Solution
di: Antipov, Denis, et al.
Pubblicazione: (2020)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
di: Opris, Andre
Pubblicazione: (2025)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
di: Opris, Andre, et al.
Pubblicazione: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
di: Opris, Andre
Pubblicazione: (2025)

Survey of Genetic and Differential Evolutionary Algorithm Approaches to Search Documents Based On Semantic Similarity
di: Muniyappa, Chandrashekar, et al.
Pubblicazione: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
di: Opris, Andre, et al.
Pubblicazione: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
di: Opris, Andre
Pubblicazione: (2025)

Open Source Evolutionary Computation with Chips-n-Salsa
di: Cicirello, Vincent A.
Pubblicazione: (2024)

Quantum-Inspired Evolutionary Algorithms for Feature Subset Selection: A Comprehensive Survey
di: Vivek, Yelleti, et al.
Pubblicazione: (2024)

Hardest Monotone Functions for Evolutionary Algorithms
di: Kaufmann, Marc, et al.
Pubblicazione: (2023)

Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo Methods
di: Joy, Geethu, et al.
Pubblicazione: (2024)

OneMax is not the Easiest Function for Fitness Improvements
di: Kaufmann, Marc, et al.
Pubblicazione: (2022)

How Population Diversity Influences the Efficiency of Crossover
di: Cerf, Sacha, et al.
Pubblicazione: (2024)

Many Objective Problems Where Crossover is Provably Essential
di: Opris, Andre
Pubblicazione: (2024)

Improved Differential Evolution based Feature Selection through Quantum, Chaos, and Lasso
di: Vivek, Yelleti, et al.
Pubblicazione: (2024)

Domain-Informed Genetic Superposition Programming: A Case Study on SFRC Beams
di: Khorshidi, Mohammad Sadegh, et al.
Pubblicazione: (2025)

Massively Parallel Genetic Optimization through Asynchronous Propagation of Populations
di: Taubert, Oskar, et al.
Pubblicazione: (2023)

Quantifying Individual and Joint Module Impact in Modular Optimization Frameworks
di: Nikolikj, Ana, et al.
Pubblicazione: (2024)

SCAPE: Searching Conceptual Architecture Prompts using Evolution
di: Lim, Soo Ling, et al.
Pubblicazione: (2024)

Evo* 2025 -- Late-Breaking Abstracts Volume
di: Mora, A. M., et al.
Pubblicazione: (2025)

Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances
di: Nikolikj, Ana, et al.
Pubblicazione: (2023)

Evolutionary Computation as Natural Generative AI
di: Shi, Yaxin, et al.
Pubblicazione: (2025)

Architecture-Induced Recoverability Bias in Differentiable Symbolic Regression
di: Gupta, Chakshu, et al.
Pubblicazione: (2026)

TNStream: Applying Tightest Neighbors to Micro-Clusters to Define Multi-Density Clusters in Streaming Data
di: Zeng, Qifen, et al.
Pubblicazione: (2025)

Evo* 2023 -- Late-Breaking Abstracts Volume
di: Mora, A. M., et al.
Pubblicazione: (2024)

L-System Genetic Encoding for Scalable Neural Network Evolution: A Comparison with Direct Matrix Encoding
di: Stuy, Alexander, et al.
Pubblicazione: (2026)

Alternate Loss Functions for Classification and Robust Regression Can Improve the Accuracy of Artificial Neural Networks
di: Noel, Mathew Mithra, et al.
Pubblicazione: (2023)

Implementing Online Reinforcement Learning with Clustering Neural Networks
di: Smith, James E.
Pubblicazione: (2024)

Biased Random-Key Genetic Algorithms: A Review
di: Londe, Mariana A., et al.
Pubblicazione: (2023)

CLEAR: Cue Learning using Evolution for Accurate Recognition Applied to Sustainability Data Extraction
di: Bentley, Peter J., et al.
Pubblicazione: (2025)

Composition of Relational Features with an Application to Explaining Black-Box Predictors
di: Srinivasan, Ashwin, et al.
Pubblicazione: (2022)

EvoPref: Multi-Objective Evolutionary Optimization Discovers Diverse LLM Alignments Beyond Gradient Descent
di: Guo, Dongxin, et al.
Pubblicazione: (2026)

Parameter-Efficient Neuroevolution for Diverse LLM Generation: Quality-Diversity Optimization via Prompt Embedding Evolution
di: Guo, Dongxin, et al.
Pubblicazione: (2026)

Rapid training of Hamiltonian graph networks using random features
di: Rahma, Atamert, et al.
Pubblicazione: (2025)

On the Structural (Dis)Agreement of Landscape Representations in Black-Box Optimization
di: Gjorgjieva, Sara, et al.
Pubblicazione: (2026)