aiqbench analysis
This research introduces a bilevel optimization framework that uses automatic differentiation to simultaneously tune topology design and its hyperparameters, effectively eliminating the need for manual trial-and-error. By generating "hypergradients," the method scales efficiently to thousands of parameters while requiring computational effort comparable to just a few standard runs. The approach demonstrates significant automation potential in engineering simulations, particularly where neural parameterization is applied to density fields.
Bilevel Optimization of Topology and Hyperparameters (BOTH)
arXiv:2609.21758v1 Announce Type: new Abstract: Topology optimization (TO) represents a significant step towards automating the design process: given a working simulation, TO can produce a viable prototype at the press of a button by differentiating the simulation and iteratively improving the design. In practice, however, TO is riddled with ``magic numbers''---hyperparameters whose tuning significantly affects the outcome. Finding the right values typically requires not only deep problem-specific knowledge but also extensive trial-and-error. While practitioners can use surrogate-assisted hyperparameter optimization as an alternative, this approach requires strictly limiting the number of hyperparameters through careful problem formulation. Here, we propose differentiating TO itself using automatic differentiation. This yields ``hypergradients'' that allow us to tune these hyperparameters in tandem with the primary optimization. We show that evaluating just one or two steps of TO is sufficiently informative and that the method scales favorably to thousands of hyperparameters at an expense comparable to only a few standard TO runs. We demonstrate this approach on stress-constrained and compliance problems, with the latter utilizing a neural parameterization of the density field.
Abstract:Topology optimization (TO) represents a significant step towards automating the design process: given a working simulation, TO can produce a viable prototype at the press of a button by differentiating the simulation and iteratively improving the design. In practice, however, TO is riddled with ``magic numbers''---hyperparameters whose tuning significantly affects the outcome. Finding the right values typically requires not only deep problem-specific knowledge but also extensive trial-and-error. While practitioners can use surrogate-assisted hyperparameter optimization as an alternative, this approach requires strictly limiting the number of hyperparameters through careful problem formulation. Here, we propose differentiating TO itself using automatic differentiation. This yields ``hypergradients'' that allow us to tune these hyperparameters in tandem with the primary optimization. We show that evaluating just one or two steps of TO is sufficiently informative and that the method scales favorably to thousands of hyperparameters at an expense comparable to only a few standard TO runs. We demonstrate this approach on stress-constrained and compliance problems, with the latter utilizing a neural parameterization of the density field.
Machine Learning (cs.LG)
arXiv:2609.21758 [cs.LG]
(or arXiv:2609.21758v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.21758 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 264 words
Related coverage
LiFT: Local Search via Linear Programming for Overfitting-Controlled Transformers
arXiv · Jun 17, 2026
Non-Stationary Functional Bilevel Optimization
arXiv · Jul 24, 2026
Explainable Information Processing in Particle Swarm Optimization through Landscape and Search Behavior Analysis
arXiv · Sep 3, 2026
Explainable Information Processing in Particle Swarm Optimization through Landscape and Search Behavior Analysis
arXiv · Aug 26, 2026