arXiv subjects

Khachik Sargsyan

Publications and source records attributed to Khachik Sargsyan.

14 recordsLinked to original sources

arXiv2026

Model Error Embedding with Orthogonal Gaussian Processes

Computational models of complex physical systems often rely on simplifying assumptions which inevitably introduce model error, with consequent predictive errors. Given data on model observables, the estimation of parameterized model-error representations, along with other model parameters, would be ideally done while separating the contributions of each of the two sets of parameters, in order to ensure meaningful stand-alone model predictions. This work builds an embedded model error framework using a weight-space representation of Gaussian processes (GPs) to flexibly capture model-error spatiotemporal correlations and enable inference with GP-embedding in non-linear models. To disambiguate model and model-error/bias parameters, we extend an existing orthogonal GP method to the embedded model-error setting and derive appropriate orthogonality constraints. To address the increased dimensionality introduced by the GP representation, we employ the likelihood-informed subspace method. The construction is demonstrated on linear and non-linear examples, where it effectively corrects model predictions to match data trends. Extrapolation beyond the training data recovers the prior predictive distribution, and the orthogonality constraints lead to meaningful stand-alone model predictions and nearly uncorrelated posteriors between model and model-error parameters.

stat.ME↗

arXiv2025

Weight-Parameterization in Continuous Time Deep Neural Networks for Surrogate Modeling

Continuous-time deep learning models, such as neural ordinary differential equations (ODEs), offer a promising framework for surrogate modeling of complex physical systems. A central challenge in training these models lies in learning expressive yet stable time-varying weights, particularly under computational constraints. This work investigates weight parameterization strategies that constrain the temporal evolution of weights to a low-dimensional subspace spanned by polynomial basis functions. We evaluate both monomial and Legendre polynomial bases within neural ODE and residual network (ResNet) architectures under discretize-then-optimize and optimize-then-discretize training paradigms. Experimental results across three high-dimensional benchmark problems show that Legendre parameterizations yield more stable training dynamics, reduce computational cost, and achieve accuracy comparable to or better than both monomial parameterizations and unconstrained weight models. These findings elucidate the role of basis choice in time-dependent weight parameterization and demonstrate that using orthogonal polynomial bases offers a favorable tradeoff between model expressivity and training efficiency.

cs.LG↗

arXiv2025

Improving the quasi-biennial oscillation via a surrogate-accelerated multi-objective optimization

Simulating the QBO remains a formidable challenge partly due to uncertainties in representing convectively generated gravity waves. We develop an end-to-end uncertainty quantification workflow that calibrates these gravity wave processes in E3SM to yield a more realistic QBO. Central to our approach is a domain knowledge-informed, compressed representation of high-dimensional spatio-temporal wind fields. By employing a parsimonious statistical model that learns the fundamental frequency of the underlying stochastic process from complex observations, we extract a concise set of interpretable and physically meaningful quantities of interest capturing key attributes, such as oscillation amplitude and period. Building on this, we train a probabilistic surrogate model. Leveraging the Karhunen-Loeve decomposition, our surrogate efficiently represents these characteristics as a set of orthogonal features, thereby capturing the cross-correlations among multiple physics quantities evaluated at different stratospheric pressure levels, and enabling rapid surrogate-based inference at a fraction of the computational cost of inference reliant only on full-scale simulations. Finally, we analyze the inverse problem using a multi-objective approach. Our study reveals a tension between amplitude and period that constrains the QBO representation, precluding a single optimal solution that simultaneously satisfies both objectives. To navigate this challenge, we quantify the bi-criteria trade-off and generate a representative set of Pareto optimal physics parameter values that balance the conflicting objectives. This integrated workflow not only improves the fidelity of QBO simulations but also advances toward a practical framework for tuning modes of variability and quasi-periodic phenomena, offering a versatile template for uncertainty quantification in complex geophysical models.

physics.ao-ph↗

arXiv2024

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, and then extend the construction to random field data via the Karhunen-Loeve expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model.

stat.ME↗

arXiv2023

Bayesian calibration with summary statistics for the prediction of xenon diffusion in UO2 nuclear fuel

The evolution and release of fission gas impacts the performance of UO2 nuclear fuel. We have created a Bayesian framework to calibrate a novel model for fission gas transport that predicts diffusion rates of uranium and xenon in UO2 under both thermal equilibrium and irradiation conditions. Data sets are taken from historical diffusion, gas release, and thermodynamic experiments. These data sets consist invariably of summary statistics, including a measurement value with an associated uncertainty. Our calibration strategy uses synthetic data sets in order to estimate the parameters in the model, such that the resulting model predictions agree with the reported summary statistics. In doing so, the reported uncertainties are effectively reflected in the inferred uncertain parameters. Furthermore, to keep our approach computationally tractable, we replace the fission gas evolution model by a polynomial surrogate model with a reduced number of parameters, which are identified using global sensitivity analysis. We discuss the efficacy of our calibration strategy, and investigate how the contribution of the different data sets, taken from multiple sources in the literature, can be weighted in the likelihood function constructed as part of our Bayesian calibration setup, in order to account for the different number of data points in each set of data summaries. Our results indicate a good match between the calibrated diffusivity and non-stoichiometry predictions and the given data summaries. We demonstrate a good agreement between the calibrated xenon diffusivity and the established fit from Turnbull et al. (1982), indicating that the dominant uranium vacancy diffusion mechanism in the model is able to capture the trends in the data.

stat.AP↗

arXiv2023

Global Sensitivity Analysis of a coupled multiphysics model to predict surface evolution in fusion plasma-surface interactions

We construct a global sensitivity analysis framework for a coupled multiphysics model used to predict the changes in material properties and surface morphology of helium plasma-facing components in future fusion reactors. The model combines the particle dynamics simulator F-TRIDYN, that predicts the helium implantation profile, with the cluster dynamics simulator Xolotl, that predicts the growth and evolution of subsurface helium gas bubbles. In order to keep the sensitivity analysis tractable, we first construct a sparse, high-dimensional polynomial chaos expansion surrogate model for each output quantity of interest, which allows the efficient extraction of sensitivity information. The sensitivity analysis is performed for two problem settings: one for ITER-like conditions, and one that resembles conditions inside the PISCES-A linear plasma device. We present a systematic comparison of important parameters, for both F-TRIDYN and Xolotl in isolation as well as for the coupled model, and discuss the physical interpretation of these results.

physics.plasm-ph↗

arXiv2019

Scalable approximation of Green's function for estimation of anharmonic energy corrections

A method based on separated integration to estimate anharmonic corrections to energy and vibration of molecules in a second-order diagrammatic vibrational many-body Green's function formalism has already been presented. A severe bottleneck in extending this approach to bigger molecules is that the storage of the Green's function scales exponentially with the number of atoms in the molecule. In this article, we present a method that overcomes this limitation by approximating the Green's function in the Hierarchical Tucker tensor format. We illustrate that the storage cost is linear in dimension and hence one can obtain accurate representations of the Green's function for a molecule of any size. Application of this method to estimate the second-order correction to energy of molecules illustrates the advantage of this approach.

physics.chem-ph↗

arXiv2019

The network uncertainty quantification method for propagating uncertainties in component-based systems

This work introduces the network uncertainty quantification (NetUQ) method for performing uncertainty propagation in systems composed of interconnected components. The method assumes the existence of a collection of components, each of which is characterized by exogenous-input random variables, endogenous-input random variables, output random variables, and a local uncertainty-propagation operator that computes output random variables from input random variables. The method assembles the full-system network by connecting components, which is achieved simply by associating endogenous-input random variables for each component with output random variables from other components; no other inter-component compatibility conditions are required. The network uncertainty-propagation problem is: Compute output random variables for all components given all exogenous-input random variables. To solve this problem, the method applies classical relaxation methods (i.e., Jacobi and Gauss--Seidel iteration with Anderson acceleration), which require only black-box evaluations of component uncertainty-propagation operators. Compared with other available methods, this approach is applicable to any network topology, promotes component independence by enabling components to employ tailored uncertainty-propagation operators, supports general functional representations of random variables, and requires no offline preprocessing stage. Also, because the method propagates functional representations of random variables throughout the network (and not, e.g., probability density functions), the joint distribution of any set of random variables throughout the network can be estimated a posteriori in a straightforward manner. We perform supporting convergence and error analysis and execute numerical experiments that demonstrate the weak- and strong-scaling performance of the method.

math.NA↗

arXiv2019

Embedded Model Error Representation for Bayesian Model Calibration

Model error estimation remains one of the key challenges in uncertainty quantification and predictive science. For computational models of complex physical systems, model error, also known as structural error or model inadequacy, is often the largest contributor to the overall predictive uncertainty. This work builds on a recently developed framework of embedded, internal model correction, in order to represent and quantify structural errors, together with model parameters, within a Bayesian inference context. We focus specifically on a Polynomial Chaos representation with additive modification of existing model parameters, enabling a non-intrusive procedure for efficient approximate likelihood construction, model error estimation, and disambiguation of model and data errors' contributions to predictive uncertainty. The framework is demonstrated on several synthetic examples, as well as on a chemical ignition problem.

stat.CO↗

arXiv2018

Compressive sensing adaptation for polynomial chaos expansions

Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper we present a new adaptation mechanism that builds on compressive sensing algorithms, resulting in a reduced polynomial chaos approximation with optimal sparsity. The developed adaptation algorithm consists of a two-step optimization procedure that computes the optimal coefficients and the input projection matrix of a low dimensional chaos expansion with respect to an optimally rotated basis. We demonstrate the attractive features of our algorithm through several numerical examples including the application on Large-Eddy Simulation (LES) calculations of turbulent combustion in a HIFiRE scramjet engine.

stat.ML↗

arXiv2018

Sparse Low Rank Approximation of Potential Energy Surfaces with Applications in Estimation of Anharmonic Zero Point Energies and Frequencies

We propose a method that exploits sparse representation of potential energy surfaces (PES) on a polynomial basis set selected by compressed sensing. The method is useful for studies involving large numbers of PES evaluations, such as the search for local minima, transition states, or integration. We apply this method for estimating zero point energies and frequencies of molecules using a three step approach. In the first step, we interpret the PES as a sparse tensor on polynomial basis and determine its entries by a compressed sensing based algorithm using only a few PES evaluations. Then, we implement a rank reduction strategy to compress this tensor in a suitable low-rank canonical tensor format using standard tensor compression tools. This allows representing a high dimensional PES as a small sum of products of one dimensional functions. Finally, a low dimensional Gauss-Hermite quadrature rule is used to integrate the product of sparse canonical low-rank representation of PES and Green's function in the second-order diagrammatic vibrational many-body Green's function theory (XVH2) for estimation of zero-point energies and frequencies. Numerical tests on molecules considered in this work suggest a more efficient scaling of computational cost with molecular size as compared to other methods.

physics.chem-ph↗

arXiv2018

Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions

Compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quantification analysis of expensive and high-dimensional physical models. We perform numerical investigations employing several compressive sensing solvers that target the unconstrained LASSO formulation, with a focus on linear systems that arise in the construction of polynomial chaos expansions. With core solvers of l1_ls, SpaRSA, CGIST, FPC_AS, and ADMM, we develop techniques to mitigate overfitting through an automated selection of regularization constant based on cross-validation, and a heuristic strategy to guide the stop-sampling decision. Practical recommendations on parameter settings for these techniques are provided and discussed. The overall method is applied to a series of numerical examples of increasing complexity, including large eddy simulations of supersonic turbulent jet-in-crossflow involving a 24-dimensional input. Through empirical phase-transition diagrams and convergence plots, we illustrate sparse recovery performance under structures induced by polynomial chaos, accuracy and computational tradeoffs between polynomial bases of different degrees, and practicability of conducting compressive sensing for a realistic, high-dimensional physical application. Across test cases studied in this paper, we find ADMM to have demonstrated empirical advantages through consistent lower errors and faster computational times.

stat.CO↗

arXiv2018

Global Sensitivity Analysis and Estimation of Model Error, Toward Uncertainty Quantification in Scramjet Computations

The development of scramjet engines is an important research area for advancing hypersonic and orbital flights. Progress toward optimal engine designs requires accurate flow simulations together with uncertainty quantification. However, performing uncertainty quantification for scramjet simulations is challenging due to the large number of uncertain parameters involved and the high computational cost of flow simulations. These difficulties are addressed in this paper by developing practical uncertainty quantification algorithms and computational methods, and deploying them in the current study to large-eddy simulations of a jet in crossflow inside a simplified HIFiRE Direct Connect Rig scramjet combustor. First, global sensitivity analysis is conducted to identify influential uncertain input parameters, which can help reduce the systems stochastic dimension. Second, because models of different fidelity are used in the overall uncertainty quantification assessment, a framework for quantifying and propagating the uncertainty due to model error is presented. These methods are demonstrated on a nonreacting jet-in-crossflow test problem in a simplified scramjet geometry, with parameter space up to 24 dimensions, using static and dynamic treatments of the turbulence subgrid model, and with two-dimensional and three-dimensional geometries.

physics.data-an↗

arXiv2014

Enhancing $\ell_1$-minimization estimates of polynomial chaos expansions using basis selection

In this paper we present a basis selection method that can be used with $\ell_1$-minimization to adaptively determine the large coefficients of polynomial chaos expansions (PCE). The adaptive construction produces anisotropic basis sets that have more terms in important dimensions and limits the number of unimportant terms that increase mutual coherence and thus degrade the performance of $\ell_1$-minimization. The important features and the accuracy of basis selection are demonstrated with a number of numerical examples. Specifically, we show that for a given computational budget, basis selection produces a more accurate PCE than would be obtained if the basis is fixed a priori. We also demonstrate that basis selection can be applied with non-uniform random variables and can leverage gradient information.

math.NA↗