Search arXivSearch

arXiv · 2603.08233

Computationally Efficient Data-Driven Topology Design Independent from High-Infoentropy Initial Dataset

Abstract

Topology optimization (TO) has been widely adopted in engineering design; however, it is prone to being trapped in local optima, particularly in strongly nonlinear problems. Sensitivity-free data-driven topology design (DDTD) offers a promising alternative. Nevertheless, existing DDTD-based methods still depend heavily on prior information or sensitivity-based TO methods for initialization, limiting their generality and independence in engineering applications. In this study, an efficient DDTD-based framework capable of being driven from low information-entropy initial datasets is proposed while improving computational efficiency. To reduce the dependence on high information-entropy initial datasets, a mesh-independent mutation module is introduced as a supplementary source of geometric features, enabling stable exploration under low information-entropy initialization. To alleviate the computational bottleneck in DDTD, where all candidate structures require numerical evaluations, a non-AI-based rapid identification algorithm is developed to efficiently identify potential high-performance structures, thereby significantly reducing the number of expensive high-fidelity simulations. The framework generates material distributions on body-fitted meshes to maintain consistency between numerical simulations and physical manufacturing. A signed distance field-based minimum length constraint is further incorporated to ensure reliable mesh generation. Numerical experiments on strongly nonlinear stress-related problems, together with comparisons with sensitivity-based TO methods, demonstrate the effectiveness of the proposed method. In microfluidic reactor and shell design problems involving non-differentiable constraints, the proposed method successfully addresses scenarios that remain challenging for both sensitivity-based TO and conventional DDTD-based methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jun Yang, Ziliang Wang, Shintaro Yamasaki. 2026-03-09. Computationally Efficient Data-Driven Topology Design Independent from High-Infoentropy Initial Dataset. https://arxiv.org/abs/2603.08233

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bi-Hamiltonian in Semiflexible Polymers built upon Overdamping Process

Quantifying the interaction between a system of interest and its ambient conditions, the memory effect links the states of two distinct Hamiltonians: one for the target system and one for the environment. In this paper, we propose the diffusion process derived from the Smoluchowski equation that can derive the evolution process described by the memory effect integration in a non Markovian regime. The Smoluchowski picture, within the framework of stochastic thermodynamics, justifies a diffusion process incorporated into the equations of motion, and the result of the derivation enables a coarse-grained molecular dynamics simulation with the modified equation of motion to reproduce attenuation from collisions between single walled carbon nanotubes (SWCNTs) under far from equilibrium conditions. The results of the numerical experiments on the collision confirm that heat diffusion compensates for the correlated momentum arising from the memory effect between the two Hamiltonians in both equilibrium and far from equilibrium states.

physics.comp-ph

Translation of transient acoustic fields

A method is presented for the translation of acoustic field data from a source to a target region. Field data are represented as spherical harmonic expansions on spheres surrounding the source and target regions respectively and expansions are translated using a ``point and shoot'' method using the Kirchhoff--Helmholtz integral to carry out an axial translation from one sphere to the other. The principal motivation for the method is its use in a time-domain Fast Multipole Method, and test cases reflective of this application are presented. The method converges to six digits for appropriate values of parameters and for the values of $N$ considered here computational effort scales approximately as $N^{2}$ where $N$ is the order of spherical harmonic expansion for the field data. The method is causal and thus avoids artifacts generated in methods which are not based on intrinsically causal formulations.

physics.comp-ph

Learning continuous reaction paths for transition-state prediction

Transition states are defined by reaction pathways, yet most machine-learning methods predict them as isolated geometries. We introduce MARC-TS, a two-stage framework that learns a continuous, endpoint-conditioned path, queries it at any resolution and uses local path context to refine a transition-state candidate. We construct T1x-IRC-8K, a dataset of 8,209 reactions and 1,088,725 path-resolved geometries. On held-out reactions, the path model reduced complete-path error by 48.4% relative to endpoint interpolation, and the localizer achieved a mean aligned structural error of 0.127 Å. Quantum-chemical optimization and vibrational analysis yielded 405 frequency-confirmed first-order saddle-point candidates from 410 predictions. In a 100-reaction nudged elastic band comparison, learned-path initialization reached a joint geometry-and-force target for 66% of reactions, compared with 12% for geometric interpolation after 100 optimizer steps. By treating the path as a reusable representation rather than an auxiliary output, MARC-TS connects transition-state prediction, mechanistic interpretation and quantum-chemical refinement.

physics.comp-ph