cs.LGSep 1, 2026

Conditional Flow Matching for ML-Based Inverse Design Problems

Authors: Juliana Felder, Milad Habibi, Soheyl Massoudi, Mark Fuge

Organizations: ETH Zürich · University of Maryland, College Park

Abstract

Engineering inverse design is often limited by the high computational cost of iterative solvers for optimization problems constrained by partial differential equations (PDEs) and by their sensitivity to initialization. Deep generative models can produce candidate designs without rerunning the simulator at inference time. Generative adversarial networks (GANs) sample in one forward pass, whereas diffusion models require iterative reverse-time integration. In this work, we add conditional flow matching (CFM) to EngiOpt and compare it with a conditional diffusion model and a conditional generative adversarial network (cGAN) on structural (beams2d) and thermal (heatconduction2d) benchmarks from EngiBench using the same downstream optimization protocol. We use cumulative optimality gap (COG) and final optimality gap (FOG) as the primary metrics for evaluating the generated designs as warm starts for gradient-based refinement. On the evaluated EngiOpt implementations and two EngiBench tasks, CFM achieves the lowest measured COG, FOG, maximum mean discrepancy (MMD), and volume-fraction deviation on both tasks. CFM has mean volume-fraction deviations of 0.4% and 1.0% on beams2d and heatconduction2d, respectively, compared with 3.8% and 11.2% for diffusion. At Euler s = 16, CFM achieves 53.2 samples/s on beams2d, about 66 times the measured throughput of the evaluated diffusion baseline using 1000 network evaluations under the same timing protocol, with COG 1.182 +/- 3.126, compared with 1.173 +/- 3.100 for Euler s = 32. Across the two tasks, CFM produces warm starts with lower measured COG than both baselines and uses fewer network evaluations than diffusion.

Explore similar work

CardsList
Mar 16, 2026cs.LG

Generative Inverse Design with Abstention via Diagonal Flow Matching

Inverse design aims to find design parameters xx achieving target performance y∗y^*. Generative approaches learn bidirectional mappings between designs and labels, enabling diverse solution sampling. However, standard conditional flow matching (CFM), when adapted to inverse problems by pairing labels with design parameters, exhibits strong sensitivity to their arbitrary ordering and scaling, leading to unstable training. We introduce Diagonal Flow Matching (Diag--CFM), which resolves this through a zero-anchoring strategy that pairs design coordinates with noise and labels with zero, making the learning problem provably invariant to coordinate permutations. This yields substantially lower round-trip error than CFM and invertible neural network baselines across design dimensions up to P=784P{=}784, including order-of-magnitude gains on several benchmarks. We develop two architecture-intrinsic uncertainty metrics, Zero-Deviation and Self-Consistency, that enable three practical capabilities: selecting the best candidate among multiple generations, abstaining from unreliable predictions, and detecting out-of-distribution targets; consistently outperforming ensemble and general-purpose alternatives across all tasks. We validate on airfoil, gas turbine combustor, scalable analytical benchmarks, a photonics inverse-design task, and an image-statistics benchmark.
Miguel de Campos, Werner Krebs, Hanno Gottschalk
Generative Inverse DesignInverse DesignInverse ProblemPhotonicsZeroAbstention
AskPDF
May 10, 2026cs.LG

Inverse Design for Conditional Distribution Matching

Generative models are powerful tools for sampling from a learned distribution P(Y∣X)\mathcal{P}(Y \mid X), and inverse-design methods invert this map to find an input xx that produces a desired point output y∗y^*. However, many design goals are naturally distributional rather than pointwise, incorporating the inherent uncertainty of YY and targeting a specific form for it, a task not addressed by standard inverse design. To address this issue we introduce Conditional Distribution Matching (CDM), a new inverse-design problem class in generative modeling: given a joint distribution P(X,Y)\mathcal{P}(X, Y) and a target distribution G(Y)\mathcal{G}(Y), find an input x∗x^* whose induced conditional distribution P(Y∣X=x∗)\mathcal{P}(Y \mid X = x^*) matches G\mathcal{G}. We formally define two variants: Conditional Distribution Matching Sampling (CDMS) and Conditional Distribution Matching Optimization (CDMO). To solve these problems, we propose MLGD-F (Matching-Loss Guided Diffusion with a Fast inner sampler), a plug-and-play inference-time algorithm that combines a pretrained score-based diffusion model with a pretrained fast conditional sampler, requiring no additional training or fine-tuning. By leveraging single-step conditional sampling, MLGD-F enables tractable gradient computation, making the estimation of P(Y∣X)\mathcal{P}(Y \mid X) both memory-efficient and computationally lightweight. We validate MLGD-F on synthetic benchmarks, structured image transformations, and generative editing optimization, demonstrating reliable recovery of inputs whose conditional distributions match diverse user-specified targets, including discrete mixtures and continuous low-rank supports.
Ori Meidler, Shaul Tolkovsky, Or Zuk
Pocket-Conditioned DiffusionGenerative Inverse DesignGenerative ModelsConditional DistributionDistributional LearningInverse Design
AskPDF
Aug 4, 2026cs.LG

Simulation-free and finite-time diffusion model

The performance of generative diffusion models is determined by the choice of the reference diffusion process connecting the empirical and prior distributions. Conventional approaches typically trade off simulation-free training against finite-time generation. We propose a framework for designing the reference process that achieves both simultaneously. The key idea is to prescribe tractable time-dependent conditional distributions and then construct the reference process realizing them as its marginals. This framework reveals that score matching is not fundamental to diffusion-model training but instead emerges naturally through reversal of the reference process. We further show that conditional flow matching arises as the small-noise limit of the proposed framework.
Kentaro Kaba, Masayuki Ohzeki, Yuki Sughiyama
Diffusion ModelsConditional Distribution
AskPDF