arXiv:2607. 12241v1 Announce Type: cross Abstract: Machine-learned surrogates for the AC power flow (ACPF) problem amortize the cost of repeated solves on a fixed network, but lose one to two orders of magnitude of accuracy when a line outage changes the topology.
By Ayushi Jolotia, Parikshit Pareek
The paper introduces BOTH, a method that differentiates topology optimization (TO) itself to compute hypergradients for tuning hyperparameters alongside the primary design optimization. By evaluating only one or two TO steps, the approach provides sufficient information and scales to thousands of hyperparameters with a cost comparable to a few standard TO runs. Experiments on stress‑constrained and compliance problems, including a neural‑parameterized density field, demonstrate the effectiveness of this joint optimization strategy.
By Suryanarayanan Manoj Sanu, Miguel Anibal Bessa, Alejandro Marcos Arag\'on
arXiv:2605. 07565v2 Announce Type: replace-cross Abstract: We study Bayesian Optimisation (BO) in settings where the objective function is influenced by uncontrollable environmental contexts governed by an unknown probability distribution.
By Tigran Ramazyan, Denis Derkach
arXiv:2609.36472v1 Announce Type: new
Abstract: Sequential Model-Based Optimization (SMBO) traditionally relies on Bayesian or ensembling surrogates for uncertainty quantification. While historically...
By Jonas Seng, Bennet Wittelsbach, Kristian Kersting
The paper introduces Decomposition-Aware Distributional Optimization (DADO), a new algorithm that exploits decomposability in property predictors to improve in‑silico design of discrete objects such as proteins, circuits, and materials. DADO uses a soft‑factorized search distribution and graph message‑passing to coordinate optimization across linked factors defined by a junction tree over design variables. The method aims to make distributional optimization over combinatorial design spaces more efficient by leveraging the structure of the predictive model.
By James C. Bowden, Sergey Levine, Jennifer Listgarten
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.
By Shusheng Xiao, Jinshuai Bai, Hyogu Jeong, Yunfei Xi, Yilin Gui, YuanTong Gu
arXiv:2510. 22048v4 Announce Type: replace Abstract: Power flow (PF) calculations are the backbone of real-time grid operations, across workflows such as contingency analysis (where repeated PF evaluations assess grid security under outages) and topology optimization (which involves PF-based searches over combinatorially large action spaces).
By Ana K. Rivera, Anvita Bhagavathula, Alvaro Carbonero, Priya Donti
arXiv:2607. 22788v1 Announce Type: cross Abstract: AC optimal power flow determines the minimum-cost generation dispatch under nonlinear power balance constraints and is solved thousands of times daily in electricity market operations.
By Zhilin Huang
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
The paper introduces T-ARC, a clustering algorithm that integrates topological information into the K‑means objective by coupling a data‑fidelity term with a graph‑cut penalty. The latent graph is modeled as a random realization from a Stochastic Block Model, whose parameter is optimized via Distributionally Robust Optimization, using a persistence‑based similarity matrix derived from zero‑dimensional persistent homology. Experiments on synthetic non‑convex data and Fashion‑MNIST subsets demonstrate that T‑ARC recovers latent topological structures and outperforms K‑means on curved and interleaved clusters while remaining competitive and more stable on real data.
By Serena Grazia De Benedictis, Andersen Ang, Nicoletta Del Buono, Flavia Esposito, Laura Selicato
arXiv:2607. 05815v1 Announce Type: new Abstract: The Minkowski functionals of a field's excursion sets -- area, boundary measure, and Euler characteristic -- describe its level-set morphology; the Euler characteristic is the cheapest handle on topology.
By Gunner Levi Howe
arXiv:2607. 10517v1 Announce Type: cross Abstract: Activation steering offers a lightweight alternative to fine-tuning for controlling large language models at inference time.
By Seyed Arshan Dalili, Ajay Narayanan Sridhar, Vijaykrishnan Narayanan, Mehrdad Mahdavi