SearcharxivSearch

arXiv · 2608.30096

Multifidelity Computer Model Emulation Via Diffusion Model Steering and Targeted Maximum Likelihood

Abstract

We develop a multifidelity method for fusing low-resolution simulations with computationally expensive high-resolution simulations, which are run infrequently and are therefore prone to bias. We formulate this fusion as a constrained optimization under missing-not-at-random (MNAR) selection bias. This formulation searches for the exponentially tilted high-resolution distribution that minimizes KL divergence from the biased baseline, subject to moment constraints derived from low-resolution simulations. This optimization requires first estimating the biased baseline conditional density $f$ as a nuisance parameter. We estimate $f$ using a score-based diffusion model. To eliminate the generative model's regularization bias that harms the downstream task, we apply targeted maximum likelihood estimation (TMLE). TMLE debiases $\hat{f}$ via a targeted exponential tilting, rendering the target parameters insensitive to first-order nuisance estimation errors. To execute this computationally, we adapt generative model steering, a technique originally developed for human-preference alignment. Using Feynman-Kac steering with a reward function based on our formulation, we simultaneously execute the exponential tilts for MNAR and TMLE at inference time, avoiding expensive retraining costs. Code available [here](https://github.com/Jong-Min-Moon/multifidel_emul_by_FK).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jongmin Mun. 2026-08-31. Multifidelity Computer Model Emulation Via Diffusion Model Steering and Targeted Maximum Likelihood. https://arxiv.org/abs/2608.30096

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

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO