arXiv Machine Learning

Trajectory-Aware Flow Matching for Topology Optimisation

arXiv:2607. 14652v1 Announce Type: new Abstract: Topology optimisation (TO) often requires repeated finite element analysis and sensitivity-based material updates, which can be costly when multiple candidate designs are needed under varying physical and design conditions.

arXiv AI
Jul 29

Steering topology distributions for unified generative design of architected metamaterials

arXiv:2607. 24777v1 Announce Type: new Abstract: Architected metamaterials derive their functions from structure, creating vast opportunities to program physical responses through topology design.

By Haolin Li, Yuyang Miao, Menglei Li, Jinshuai Bai, Liyuan Wang, Xin Liu, Bo Gao, Jiantao Liu, Danilo Mandic, Zahra Sharif Khodaei, M. H. Aliabadi, Weiqiu Chen
Hugging Face Trending Papers
Aug 7

Flow-Corrected Shape Optimization: Taming Manifold Drift in High-Dimensional 3D Models

Optimizing 3D shapes within the latent spaces of deep generative models is fundamental to computer assisted engineering, yet remains prone to a critical failure mode we term manifold drift: the tendency of gradient-based optimization to move latent vectors away from the manifold of valid shapes. This problem is exacerbated in state-of-the-art 3D shape generative models that operate in increasingly high-dimensional latent spaces where valid shapes occupy a vanishingly small fraction of the full space.

arXiv AI
Jun 12

PolyFlow: Safe and Efficient Polytope-Constrained Flow Matching with Constraint Embedding and Projection-free Update

arXiv:2606. 13400v1 Announce Type: cross Abstract: While flow-based generative models have demonstrated strong performance across a wide range of domains, deploying them in safety-critical physical systems remains challenging due to strict constraint requirements.

By Jianming Ma, Qiyue Yang, Yang Zhang, Liyun Yan, Zhanxiang Cao, Yazhou Zhang, Yue Gao
arXiv Machine Learning
Aug 28

COFM: Consistent Optimal Transport Flow Matching via Partially Input Convex Neural Networks

The paper introduces COFM, a framework for consistent optimal transport flow matching that uses partially input convex neural networks (PICNN) to parameterize the transport potential. By adding a Hamilton‑Jacobi residual to the training objective, COFM enforces dynamical consistency and supports both one‑step transport and multi‑step ODE sampling without costly inner optimization. Experiments on benchmark datasets show that COFM achieves competitive performance while reducing L^2‑UVP by over 2× and cutting computational time by about 9× compared to state‑of‑the‑art models.

By Fanghui Song, Zhongjian Wang, Jiebao Sun
arXiv AI
Sep 2

Training-Free Refinement of Flow Matching with Divergence-based Sampling

The paper introduces Flow Divergence Sampler (FDS), a training‑free method that refines intermediate states in flow‑matching models by using the divergence of the marginal velocity field to detect and correct misguidance toward low‑density regions. FDS operates during inference, requires no additional training, and can be applied as a plug‑and‑play module with standard solvers and existing flow backbones. Experiments show that FDS consistently improves fidelity in tasks such as text‑to‑image synthesis and inverse problems.

By Yeonwoo Cha, Jaehoon Yoo, Semin Kim, Yunseo Park, Jinhyeon Kwon, Seunghoon Hong
arXiv Machine Learning
Sep 10

ParetoTransport: Generative Optimization by Mass Transport Toward The Pareto Front

ParetoTransport is a training‑free guidance method for pre‑trained flow‑matching models that explicitly refines a population‑level distribution in objective space. It iteratively transports the empirical offline distribution toward the Pareto front using Wasserstein matching to intermediate proxy distributions, thereby controlling distributional displacement and mass allocation along the front. The authors prove a convergence result and show state‑of‑the‑art performance on standard offline multi‑objective optimization benchmarks, evaluating beyond hypervolume to generational distance, inverted generational distance, and Wasserstein distance.

By Stephanie Holly, Sepp Hochreiter, Werner Zellinger
arXiv AI
Sep 24

KATOsuper: Surrogate-accelerated neural topology optimization with sensitivity-consistent Fourier neural operators

KATOsuper is an objective‑agnostic framework that accelerates neural topology optimization by coupling neural‑reparameterized TO with a Sensitivity‑Consistent Fourier Neural Operator (SC‑FNO). It uses a forward_split architecture to ensure that sensitivities derived via automatic differentiation remain consistent with predicted objectives, enabling stable optimization. The method demonstrates significant deployment‑time speedups (15–110×) over MATLAB baselines while preserving optimality across 2D and 3D benchmark problems, including compliance and stress minimization, and supports zero‑shot extrapolation to higher resolutions.

By Shengyu Yan, Jasmin Jelovica