Copertina

OneMax is not the Easiest Function for Fitness Improvements

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kaufmann, Marc, Larcher, Maxime, Lengler, Johannes, Zou, Xun
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Neural and Evolutionary Computing 68W50
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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)

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

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

Quantum-Inspired Genetic Optimization for Patient Scheduling in Radiation Oncology
di: SaiToh, Akira, et al.
Pubblicazione: (2025)

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

Isomorphic Functionalities between Ant Colony and Ensemble Learning: Part III -- Gradient Descent, Neural Plasticity, and the Emergence of Deep Intelligence
di: Fokoué, Ernest, et al.
Pubblicazione: (2026)

Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function
di: Krejca, Martin S., et al.
Pubblicazione: (2026)

A Survey of Meta-features Used for Automated Selection of Algorithms for Black-box Single-objective Continuous Optimization
di: Cenikj, Gjorgjina, et al.
Pubblicazione: (2024)

Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Generalized OneMax
di: Adak, Sumit, et al.
Pubblicazione: (2024)

Faster Optimization Through Genetic Drift
di: Florescu, Cella, et al.
Pubblicazione: (2024)

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

Improved Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Two Generalized OneMax Problems
di: Adak, Sumit, et al.
Pubblicazione: (2025)

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

AgentBreeder: Mitigating the AI Safety Risks of Multi-Agent Scaffolds via Self-Improvement
di: Rosser, J, et al.
Pubblicazione: (2025)

Multi-parameter Control for the $(1+(λ,λ))$-GA on OneMax via Deep Reinforcement Learning
di: Nguyen, Tai, et al.
Pubblicazione: (2025)

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)

Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes
di: Lengler, Johannes, et al.
Pubblicazione: (2024)

Diversity-Preserving Exploitation of Crossover
di: Lengler, Johannes, et al.
Pubblicazione: (2025)

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
di: Doerr, Carola, et al.
Pubblicazione: (2023)

On the Importance of Reward Design in Reinforcement Learning-based Dynamic Algorithm Configuration: A Case Study on OneMax with (1+($λ$,$λ$))-GA
di: Nguyen, Tai, et al.
Pubblicazione: (2025)

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

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

Efficient Vectorized Backpropagation Algorithms for Training Feedforward Networks Composed of Quadratic Neurons
di: Noel, Mathew Mithra, et al.
Pubblicazione: (2023)