SearcharxivSearch

arXiv · 2609.23761

GenVoid: Uncertainty-Aware Learning of Subsurface Material Defects with an Experimentally Validated Physics-Informed Generative Model

Abstract

Internal voids are ubiquitous defects in manufactured structures, yet their characterization remains challenging because their geometry is hidden and can only be inferred indirectly from accessible measurements. Here we introduce \textit{GenVoid}, a physics-informed generative model-based framework for identifying internal voids in complex two- and three-dimensional solids from surface displacement measurements alone. By incorporating the governing mechanics into a generative inference framework, \textit{GenVoid} enables void identification across linear elastic, hyperelastic and plastic material behaviours and accommodates complex two- and three-dimensional structural geometries. Importantly, the framework explicitly accounts for uncertainty and noise in displacement measurements, producing probabilistic reconstructions of internal void geometry rather than a single deterministic estimate. We demonstrate the approach using high-fidelity synthetic datasets and experimentally measured displacement fields obtained from in-situ mechanical experiments, establishing its ability to infer hidden voids from realistic displacement measurements. To quantify the fundamental limits of such inference, we further introduce an observability measure that characterizes the sensitivity of boundary measurements to localized stiffness perturbations within the interior under an ensemble of applied loads. This framework provides a direct connection between defect location, sensor configuration and reconstruction fidelity, enabling systematic assessment of how the number and spatial distribution of boundary measurements govern void-identification accuracy. To this end, these results establish a physics-informed and uncertainty-aware approach for non-invasive characterization of hidden defects and provide a quantitative basis for designing measurement strategies for inverse problems in solid mechanics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Trishit Mondal, Prajwal Bharadwaj, Nikhil Karanjgaokar, Ameya D. Jagtap. 2026-09-20. GenVoid: Uncertainty-Aware Learning of Subsurface Material Defects with an Experimentally Validated Physics-Informed Generative Model. https://arxiv.org/abs/2609.23761

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

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG