Skip to content
Preprint

DeepOHeat-v2: Self-Improving Operator Learning for Fast and Trustworthy Thermal Optimization in 3D-IC Design

Aug 2026 · 0 citations · 44 references
Computer Science Physics

TL;DR

DeepOHeat-v2 is proposed, which trains on a discretized physics loss that handles the discontinuities natively, and proposes a self-improving framework: a hotspot trust gate sends flagged placements to a reference solver, and the surrogate incrementally retrains on the refined solutions, keeping an update only when it improves held-out validation error.

Abstract

Thermal-aware optimization of multi-die 3D integrated circuits evaluates many designs, each a costly heat-equation solve. Operator-learning surrogates replace this solve with a fast forward pass, ideally trained from physics alone, without labeled data. DeepOHeat-v1 made such surrogates fast and trustworthy, but only on low-contrast geometries. High-contrast multi-die stacks break it in two ways: discontinuous conductivities make the continuous physics loss ill-defined at material interfaces, and ill-conditioning ($\kappa_2(A_h) \approx 6 \times 10^4$) puts the discretized strong-form loss beyond first-order optimization. We propose DeepOHeat-v2 to overcome both. First, we train on a discretized physics loss that handles the discontinuities natively; its energy form reduces the prediction-space loss-Hessian conditioning from $\kappa^2$ to $\kappa$, and a matrix-preconditioned optimizer cuts the mean peak temperature error from over 30 K to 0.55 K. Second, because optimization leaves the training distribution, we propose a self-improving framework: a hotspot trust gate sends flagged placements to a reference solver, and the surrogate incrementally retrains on the refined solutions, keeping an update only when it improves held-out validation error. On a multi-die benchmark, the surrogate-true peak gap on the returned design falls from 1.12 K to 0.11 K, matching a solve-at-every-step optimizer while running $56\times$ faster.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

SS-ESOAP: Self-Scaled Adaptive Preconditioning for Physics-Informed Learning

Method is introduced, which augments SOAP-style preconditioning with a scalar secant-energy correction adapted to Kronecker geometry and an adaptive basis update followed by variance-state downscaling, and is positioned as a scalable option for stiff, high-accuracy physics-informed training, rather than a uniform repla...

Guang-Yuan Wang, Mads Toftrup, Sebastian Loeschcke et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Co-PiLOT: Constrained Physics-Informed Latent Optimization for Target-Driven Inverse Design

Co-PiLOT is presented, a latent optimization approach that maps candidates through a generative encoder-decoder, uses the decoder as a learned validity prior, and searches the latent space with physics-informed black-box optimization.

Mahish K. Guru, Mayank Nagar, Ayush Vyas et al. · 1 citation
#machine learning Conference Open access Sep 2026

Conditional Flow Matching for ML-Based Inverse Design Problems

Comparing CFM against conditional Diffusion and cGAN across structural and thermal benchmarks from EngiBench under matched downstream optimization conditions supports CFM as a competitive warm-start prior for engineering inverse design, substantially reducing inference cost relative to the evaluated Diffusion baseline...

Juliana Felder, Milad Habibi, Soheyl Massoudi et al. · 0 citations
#machine learning Preprint Sep 2026

Learnable composition for neural operators

LatentDDM is identified as a promising design principle for physical foundation models that improves 20-step field rollouts in fast-pitching airfoil flow, both zero-shot and after few-shot calibration.

Zi-Tuo Chen, Bai-Ming Zhang, Si-Li Deng · 0 citations
#machine learning Preprint Oct 2026

A Physics-Informed Hybrid Forward-Inverse Machine Learning Framework for High-Dimensional Sparse Recipe Reconstruction

High-dimensional sparse recipe formulation in process industries involves nonlinear association of various covariates, bounded by sparsity constraints and multi-criteria tolerances. Traditional physics-based classical methods (such as Kubelka-Munk) fail to generate sparse candidate recipes properly due to their simplif...

M. Fuad, Md. Istiak Adnan, Ridwan Al Aziz · 0 citations
Open access Oct 2026

Autoencoder-based non-intrusive model order reduction for anisotropic and multi-physics problems

We propose a non-intrusive, Autoencoder-based framework for reduced-order modeling in continuum mechanics. Our method integrates three stages: (i) an unsupervised Autoencoder compresses high-dimensional finite element solutions into a compact latent space, (ii) a supervised regression network maps problem parameters...

Jannick Kehls, Ellen Kuhl, T. Brepols et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.