MoRF-AST: Calibrated Probabilistic Virtual Sensing for Structural Monitoring under Changing Operating Conditions
- URL: http://arxiv.org/abs/2608.24531v1
- Date: Tue, 25 Aug 2026 13:16:59 GMT
- Title: MoRF-AST: Calibrated Probabilistic Virtual Sensing for Structural Monitoring under Changing Operating Conditions
- Abstract summary: This study proposes Modal Residual Flow Matching with Context-Conditioned Affine Spread Transport (MoRF-AST) for calibrated structural virtual sensing.<n>MoRF achieves a posterior-mean normalized root-mean-square error (NRMSE) of 7.20%, compared with 16.1% and 17.9% for two direct conditional flows.
- Score: 10.208843473977094
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Probabilistic full-field reconstruction provides uncertainty-aware response evidence for structural reliability assessment, yet inference from sparse and noisy measurements remains underdetermined. Most existing methods overlook shifts between offline training and operational distributions. Under such shifts, posterior intervals may become miscalibrated, causing the reported uncertainty to lose its probabilistic meaning. This study proposes Modal Residual Flow Matching with Context-Conditioned Affine Spread Transport (MoRF-AST) for calibrated structural virtual sensing under changing operating conditions. MoRF constructs an analytic Gaussian reference posterior in normalized modal coordinates and trains a conditional flow only on posterior-whitened residuals. At deployment, AST estimates response scale from historical measurements at installed sensors and uses gated, mean-preserving Bures-Wasserstein transport to adjust posterior spread. On a bridge-deck benchmark, MoRF achieves a posterior-mean normalized root-mean-square error (NRMSE) of 7.20%, compared with 16.1% and 17.9% for two direct conditional flows. Across eight shifted traffic domains, AST reduces MoRF's cross-domain average coverage error from 0.0535 to 0.0236, a 55.9% reduction, while preserving posterior-mean accuracy. The same transport does not improve the tested alternatives in aggregate, showing that calibration gains require its direction to match the base posterior's dispersion bias. MoRF-AST provides a data-efficient framework for probabilistic full-field reconstruction whose uncertainty remains interpretable under scale-dominated operational distribution shifts. More broadly, this work highlights the need to calibrate uncertainty under changing operational distributions, thereby supporting trustworthy probabilistic modeling and reliability-informed decision-making in civil and infrastructure engineering.
Related papers
- Direct Conditional Transition Sampling for Diffusion Inverse Problems [16.85590645425029]
Training-free diffusion inverse solvers typically choose between local measurement guidance and costly clean-space posterior updates.<n>We propose Direct Transition Sampling (DCTS), a direct Conditional-flow approximation to the same ideal refresh target.<n>DCTS achieves competitive reconstruction quality with up to $16.8times$ speedups over competing methods.
arXiv Detail & Related papers (2026-09-13T15:24:33Z) - SPARC: Single-Pass Scaling for Motion Forecasting with Conformal Bayesian Last Layers [1.4452289368758382]
Single-Pass Adaptive Risk is a structured, calibrated, and efficient uncertainty estimate for human motion forecasters.<n>A deterministic backbone predicts the future mean, and a conjugate Bayesian last layer converts time-domain feature leverage into an analytic horizon-wise scale.<n>It ranks first on NLL and on the combined MPJPE+NLL criterion while retaining competitive point accuracy and efficient calibrated tubes.
arXiv Detail & Related papers (2026-08-21T07:20:22Z) - RBE-Flow: Recurrent Bayesian Estimation on Feature Manifolds for Cross-Modal Registration [14.194086645453767]
Cross-pixel image registration is challenging due to severe non-linear radiometric and uncertainty.<n>In this paper we propose a novel framework that reformulates dense-modal flow estimation.
arXiv Detail & Related papers (2026-06-29T15:58:25Z) - Exactness Matters for Physical Rule Enforcement [4.230349220081444]
It remains unclear when stronger physical rule enforcement becomes reliable and when it becomes a source of distribution shift.<n>We study this question through operator exactness, meaning whether the repair map is the identity on the target manifold.<n> Controlled mismatch, screened cleanup, adaptive gating, and external-backbone checks show that the best approximate-regime operating point can be raw or near-identity.
arXiv Detail & Related papers (2026-05-08T07:59:59Z) - Tyche: One Step Flow for Efficient Probabilistic Weather Forecasting [48.263481135566316]
We present Tyche, a one-step conditional flow model for efficient probabilistic weather forecasting.<n>Experiments on ERA5 at 1.5$circ$ and 6-hour resolution show that our Tyche, using merely a single NFE, matches or exceeds the forecast skill and calibration of state-of-the-art multi-step generative baselines.
arXiv Detail & Related papers (2026-05-07T20:25:28Z) - Distributional Spectral Diagnostics for Localizing Grokking Transitions [4.480801209867367]
In grokking, a model first fits the training data while test accuracy remains low, and only later begins to generalize.<n>We ask whether this transition can be localized from observed training trajectories before the test accuracy rises, and formulate grokking transition localization as a diagnostic problem with an explicit threshold/FPR/lead-time trade-off.
arXiv Detail & Related papers (2026-05-07T03:08:58Z) - Revisiting Multivariate Time Series Forecasting with Missing Values [65.30332997607141]
Missing values are common in real-world time series.<n>Current approaches have developed an imputation-then-prediction framework that uses imputation modules to fill in missing values, followed by forecasting on the imputed data.<n>This framework overlooks a critical issue: there is no ground truth for the missing values, making the imputation process susceptible to errors that can degrade prediction accuracy.<n>We introduce Consistency-Regularized Information Bottleneck (CRIB), a novel framework built on the Information Bottleneck principle.
arXiv Detail & Related papers (2025-09-27T20:57:48Z) - RDIT: Residual-based Diffusion Implicit Models for Probabilistic Time Series Forecasting [4.140149411004857]
RDIT is a plug-and-play framework that combines point estimation and residual-based conditional diffusion with a bidirectional Mamba network.<n>We show that RDIT achieves lower CRPS, rapid inference, and improved coverage compared to strong baselines.
arXiv Detail & Related papers (2025-09-02T14:06:29Z) - COME: Test-time adaption by Conservatively Minimizing Entropy [45.689829178140634]
Conservatively Minimize the Entropy (COME) is a drop-in replacement of traditional entropy (EM)
COME explicitly models the uncertainty by characterizing a Dirichlet prior distribution over model predictions.
We show that COME achieves state-of-the-art performance on commonly used benchmarks.
arXiv Detail & Related papers (2024-10-12T09:20:06Z) - Which Invariance Should We Transfer? A Causal Minimax Learning Approach [18.71316951734806]
We present a comprehensive minimax analysis from a causal perspective.
We propose an efficient algorithm to search for the subset with minimal worst-case risk.
The effectiveness and efficiency of our methods are demonstrated on synthetic data and the diagnosis of Alzheimer's disease.
arXiv Detail & Related papers (2021-07-05T09:07:29Z) - Comparing Probability Distributions with Conditional Transport [63.11403041984197]
We propose conditional transport (CT) as a new divergence and approximate it with the amortized CT (ACT) cost.
ACT amortizes the computation of its conditional transport plans and comes with unbiased sample gradients that are straightforward to compute.
On a wide variety of benchmark datasets generative modeling, substituting the default statistical distance of an existing generative adversarial network with ACT is shown to consistently improve the performance.
arXiv Detail & Related papers (2020-12-28T05:14:22Z) - Learning Calibrated Uncertainties for Domain Shift: A Distributionally
Robust Learning Approach [150.8920602230832]
We propose a framework for learning calibrated uncertainties under domain shifts.
In particular, the density ratio estimation reflects the closeness of a target (test) sample to the source (training) distribution.
We show that our proposed method generates calibrated uncertainties that benefit downstream tasks.
arXiv Detail & Related papers (2020-10-08T02:10:54Z) - Unlabelled Data Improves Bayesian Uncertainty Calibration under
Covariate Shift [100.52588638477862]
We develop an approximate Bayesian inference scheme based on posterior regularisation.
We demonstrate the utility of our method in the context of transferring prognostic models of prostate cancer across globally diverse populations.
arXiv Detail & Related papers (2020-06-26T13:50:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.