paper-with-me

Papers

Diffusion Crossover: Defining Evolutionary Recombination in Diffusion Models via Noise Sequence Interpolation

2026-04-16 · Chisato Kumada, Satoru Hiwa, Tomoyuki Hiroyasu arxiv

Interactive Evolutionary Computation (IEC) provides a powerful framework for optimizing subjective criteria such as human preferences and aesthetics, yet it suffers from a fundamental limitation: in high-dimensional generative representations, defining crossover in a semantically consistent manner is difficult, often leading to a mutation-dominated search. In this work, we explicitly define crossover in diffusion models. We propose Diffusion crossover, which formulates evolutionary recombination as step-wise interpolation of noise sequences in the reverse process of Denoising Diffusion Probabilistic Models (DDPMs). By applying spherical linear interpolation (Slerp) to the noise sequences associated with selected parent images, the proposed method generates offspring that inherit characteristics from both parents while preserving the geometric structure of the diffusion process. Furthermore, controlling the time-step range of interpolation enables a principled trade-off between diversity (exploration) and convergence (exploitation). Experimental results using PCA analysis and perceptual similarity metrics (LPIPS) demonstrate that Diffusion crossover produces perceptually smooth and semantically consistent transitions between parent images. Qualitative interactive evolution experiments further confirm that the proposed method effectively supports human-in-the-loop image exploration. These findings suggest a new perspective: diffusion models are not only powerful generators, but also structured evolutionary search spaces in which recombination can be explicitly defined and controlled.

📄 PDF Abstract BibTeX arXiv:2604.14790

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Recombinator-k-means: An evolutionary algorithm that exploits k-means++ for recombination

2019-05-01 · Carlo Baldassi

We introduce an evolutionary algorithm called recombinator-$k$-means for optimizing the highly non-convex kmeans problem. Its defining feature is that its crossover step involves all the members of the current generation…

Clustering

Analysis and Optimization of Probabilities of Beneficial Mutation and Crossover Recombination in a Hamming Space

2025-06-13 · Roman V. Belavkin

Inspired by Fisher's geometric approach to study beneficial mutations, we analyse probabilities of beneficial mutation and crossover recombination of strings in a general Hamming space with arbitrary finite alphabet. Mut…

An estimator for the recombination rate from a continuously observed diffusion of haplotype frequencies

2022-12-15 · Robert C. Griffiths, Paul A. Jenkins

Recombination is a fundamental evolutionary force, but it is difficult to quantify because the effect of a recombination event on patterns of variation in a sample of genetic data can be hard to discern. Estimators for t…

A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem

2025-10-08 · Joan Salvà Soler, Günther R. Raidl arxiv

Denoising diffusion models (DDMs) offer a promising generative approach for combinatorial optimization, yet they often lack the robust exploration capabilities of traditional metaheuristics like evolutionary algorithms (…

Improving Evaluation of Recombination-based Cartesian Genetic Programming

2026-05-27 · Duy Long Tran, Anja Jankovic, Marie Anastacio, Holger Hoos 외 arxiv

Cartesian Genetic Programming has traditionally been using mutation as its main and often sole genetic operator to drive evolutionary search. Despite advancements in recent years, recombinationbased approaches have long …