Abstract:Categorical structural optimization under aleatoric uncertainty is challenging because each design variable must be selected from a finite catalog of admissible instances, while each candidate design may require expensive stochastic finite-element evaluations.
Existing latent-space optimization strategies can reduce the dimensionality of catalog attributes, but they often treat the reduced space as a continuous search domain.
The resulting continuous optimum must then be rounded off to a nearby catalog instance, which may alter the objective value, constraint status, or physical interpretation of the design.
To address this issue, this paper proposes the \textbf{C}ategorical \textbf{O}ptimization with \textbf{B}ayesian \textbf{A}nchored \textbf{L}atent \textbf{T}rust Regions (\textbf{COBALT}) framework for high-dimensional categorical Optimization Under Uncertainty.
COBALT first embeds the physical catalog into a low-dimensional latent representation and locks the mapped instances as a discrete anchored graph.
A data-independent random tree decomposition is then used to provide bounded-complexity additive modeling over high-dimensional categorical variables.
On this anchored domain, an additive SAAS-GP surrogate is fitted to heteroscedastic MC-FEA observations, and a trust-region discrete graph acquisition search selects the next admissible catalog configuration without continuous relaxation or rounding-off.
The proposed strategy is applied to robust design optimization of complex bar structures, considering structural weight, strain energy, and local buckling performance.
By evaluating only valid catalog designs through the MC-FEA oracle, COBALT preserves physical admissibility throughout the active learning loop and improves the efficiency of robust categorical structural optimization.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.25241 [cs.LG] |
| (or arXiv:2604.25241v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.25241 arXiv-issued DOI via DataCite (pending registration) |
From: Zhangyong Liang [view email]
[v1]
Tue, 28 Apr 2026 05:45:16 UTC (1,793 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。