Searcharxiv⌕ Search

arXiv · 2610.28703

Scalable Stress-Constrained Topology Optimization: A Simultaneous Approach Based on Machine Learning

Abstract

Large-scale topology optimization (TO) remains computationally demanding, especially for stress-constrained problems. To address this challenge, we propose the simultaneous neural topology optimization (SNTO) framework where state, adjoint, and design variables are represented with custom neural networks (NNs) whose parameters are jointly optimized within a single loop using adjoint analysis and automatic differentiation. The loss function combines the design objective, an aggregation of the local stress constraints, and the potential energy functionals. Our NNs have a unique architecture that accelerates convergence while capturing the sharp gradients and boundaries which are critical to stress-constrained TO. To scale to millions of degrees of freedom, we develop a hardware-aware training scheme in which the design domain is partitioned into subdomains distributed across multiple graphics processing units (GPUs). To control peak GPU memory, we further slice each subdomain into smaller regions whose loss gradients are evaluated sequentially and accumulated. Unlike domain decomposition, our partitioning naturally ensures field continuity across subdomains without additional loss terms. We first evaluate SNTO on two-dimensional (2D) stress-constrained benchmarks and compare the results to a conventional finite element-based approach, showing that SNTO produces designs with sharper boundaries and smaller gray areas. We then solve three-dimensional (3D) problems with up to eight million collocation points on eight GPUs. The training time decreases nearly in proportion to the number of GPUs and the peak GPU memory is reduced by increasing the number of sub-slices. Overall, SNTO offers an effective pathway to large-scale stress-constrained TO on limited computational resources.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiangyu Sun, Shirin Hosseinmardi, Ramin Bostanabad. 2026-10-24. Scalable Stress-Constrained Topology Optimization: A Simultaneous Approach Based on Machine Learning. https://arxiv.org/abs/2610.28703

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

KEEP EXPLORING

Related papers

B-XAIC Dataset: Benchmarking Explainable AI for Graph Neural Networks Using Chemical Data

Understanding the reasoning behind deep learning model predictions is crucial in cheminformatics and drug discovery, where molecular design determines their properties. However, current evaluation frameworks for Explainable AI (XAI) in this domain often rely on artificial datasets or simplified tasks, employing data-derived metrics that fail to capture the complexity of real-world scenarios and lack a direct link to explanation faithfulness. To address this, we introduce B-XAIC, a novel benchmark constructed from real-world molecular data and diverse tasks with known ground-truth rationales for assigned labels. Through a comprehensive evaluation using B-XAIC, we reveal limitations of existing XAI methods for Graph Neural Networks (GNNs) in the molecular domain. This benchmark provides a valuable resource for gaining deeper insights into the faithfulness of XAI, facilitating the development of more reliable and interpretable models.

cs.LG↗

Machine Learning Algorithms for Improving Black Box Optimization Solvers

Black-box optimization (BBO) addresses problems where objectives are accessible only through costly queries without gradients or explicit structure. Classical derivative-free methods---line search, direct search, and model-based solvers such as Bayesian optimization---form the backbone of BBO, yet often struggle in high-dimensional, noisy, or mixed-integer settings. Recent advances use machine learning (ML) and reinforcement learning (RL) to enhance BBO: ML provides expressive surrogates, adaptive updates, meta-learning-based algorithm selection, and generative models, while the RL--BBO interface includes dynamic operator configuration, robust policy search, and meta-optimization across tasks. This paper surveys these developments, covering representative algorithms such as the modular model-based optimization framework (mlrMBO), zeroth-order adaptive momentum methods (ZO-AdaMM), automated BBO (ABBO), distributed block-wise optimization (DiBB), partition-based Bayesian optimization (SPBOpt), the transformer-based optimizer (B2Opt), diffusion-model-based BBO, surrogate-assisted RL for differential evolution (Surr-RLDE), robust BBO (RBO), coordinate-ascent MORE with step size adaptation (CAS-MORE), log-barrier stochastic gradient descent (LB-SGD), policy improvement with black-box (PIBB), and offline Q-learning with Mamba backbones (Q-Mamba). We further review benchmark efforts such as the NeurIPS 2020 BBO Challenge and the MetaBox framework. A controlled numerical study further confirms that ML-based candidate screening can improve the evaluation-budget performance of direct search and differential evolution, while the benefit remains solver-dependent.

cs.LG↗

HomID : Benchmarking Intrinsic Dimension Estimators on Homogenous Manifolds with Anisotropic Embeddings

The manifold hypothesis suggests that data lies on manifolds with smaller intrinsic dimension (ID) than their ambient dimension. However there is no empirical agreement on the estimates for ID from different estimators for realistic datasets. Thus it is important to test ID estimators (IDEs) with targeted stressors. In this work, we consider the role of anisotropy. To this end, we propose HomID, a collection of homogeneous spaces with anisotropic embedding, for benchmarking ID estimators. We observe that methods that perform well on standard benchmarks systematically degrade on HomID under identical resource allocation. We further observe that anisotropic distortion of such benchmarks also results in performance degradation. Finally, we demonstrate that controlled anisotropic distortions induce systematic shifts in the distributions on which these methods rely, providing a concrete mechanism for the resulting estimation errors in two particular IDEs. The code for the project is available at https://github.com/a-writes-code/homid

cs.LG↗