Dimitrios G. Giovanis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Dimitrios G. Giovanis has a total of 68 co-authors. Here are the top co-authors by number of shared publications:
- Michael D. Shields
Johns Hopkins Univ
8 shared publications - Ioannis G. Kevrekidis
Department of Chemical and Biomolecular Engineering, Johns Hopkins University, Baltimore, USA
6 shared publications - Eleni D. Koronaki
Faculty of Science, Technology and Medicine, University of Luxembourg , 1350 Kirchberg
5 shared publications - Geremy Loachamin
Faculty of Science, University of Luxembourg, Esch-sur-Alzette, Luxembourg
4 shared publications Ioannis G. Kevrekidis
4 shared publications- Paris Papavasileiou
Univ Luxembourg, Fac Sci Technol & Med, L-4364 Esch Sur Alzette, Luxembourg
4 shared publications
Latest Publications
- 3 November 2026
- Published by Wiley in GAMM-Mitteilungen
- Vol. 49 (4) , e70017
Conformalized polynomial chaos expansion for uncertainty‐aware surrogate modeling
This work introduces a method to equip data‐driven polynomial chaos expansion surrogate models with intervals that quantify the predictive uncertainty of the surrogate. To that end, jackknife‐based conformal prediction is integrated into regression‐based polynomial chaos expansions. The jackknife algorithm uses leave‐one‐out residuals to generate prediction intervals around the predictions of the polynomial chaos surrogate. The jackknife+ extension additionally requires leave‐one‐out model predictions. Both methods allow using the entire dataset for model training and do not require a hold‐out dataset for prediction interval calibration. The key to efficient implementation is to leverage the linearity of the polynomial chaos regression model, so that leave‐one‐out residuals and, if necessary, leave‐one‐out model predictions can be computed with analytical, closed‐form expressions. This eliminates the need for repeated model re‐training. The conformalized polynomial chaos expansion method is first validated on benchmark models and then applied to an engineering use case. The method produces prediction intervals that provide the target coverages, even for low‐accuracy models trained with small datasets. At the same time, training data availability plays a crucial role in improving the empirical coverage and narrowing the prediction interval, as well as in reducing their variability over different training datasets.
- 3 November 2026
- Published by Wiley in GAMM-Mitteilungen
- Vol. 49 (4) , e70017
Conformalized polynomial chaos expansion for uncertainty‐aware surrogate modeling
This work introduces a method to equip data‐driven polynomial chaos expansion surrogate models with intervals that quantify the predictive uncertainty of the surrogate. To that end, jackknife‐based conformal prediction is integrated into regression‐based polynomial chaos expansions. The jackknife algorithm uses leave‐one‐out residuals to generate prediction intervals around the predictions of the polynomial chaos surrogate. The jackknife+ extension additionally requires leave‐one‐out model predictions. Both methods allow using the entire dataset for model training and do not require a hold‐out dataset for prediction interval calibration. The key to efficient implementation is to leverage the linearity of the polynomial chaos regression model, so that leave‐one‐out residuals and, if necessary, leave‐one‐out model predictions can be computed with analytical, closed‐form expressions. This eliminates the need for repeated model re‐training. The conformalized polynomial chaos expansion method is first validated on benchmark models and then applied to an engineering use case. The method produces prediction intervals that provide the target coverages, even for low‐accuracy models trained with small datasets. At the same time, training data availability plays a crucial role in improving the empirical coverage and narrowing the prediction interval, as well as in reducing their variability over different training datasets.
- Open Access
Probabilistic Cardiac Digital Twins for Robust Patient-Specific Modeling
Uncertainty quantification (UQ) in computational heart models is essential for reliable cardiac digital twins (DTs) in personalized medicine, yet remains challenging. Traditional Monte Carlo and stochastic Galerkin methods often become impractical in the high-dimensional, nonlinear state variable and parameter spaces of cardiac electrophysiology and mechanics. This article introduces a framework for learning a joint probability density over cardiac observables and model parameters, enabling the characterization of statistical dependencies across a large number of variables in patient-specific cardiac DTs. By sampling from this density and conditioning on available data, useful predictive distributions can be constructed, allowing uncertainty to be propagated through the model and quantified in terms of variability. Conditional regression can then be performed directly on this learned density, enabling systematic exploration of interdependencies among observables for both predictive inference and model design. The statistical methodology adopts a geometry-aware generative learning framework, recently introduced by the authors, that decouples the learning of data geometry from sampling. First it identifies a low-dimensional latent representation that captures the intrinsic structure of the data and its multiscale geometric features. A stochastic differential equation is then formulated directly in the low-dimensional latent space to generate samples efficiently; these are subsequently mapped back to the high-dimensional space of cardiac states and parameters through a smooth lifting operator. We demonstrate the approach on a ventricular arrhythmia prediction benchmark, where the learned joint probability density enables the construction of predictive distributions over key parameters (e.g., conductivities, fibrosis patterns) through sampling and conditioning. This enables uncertainty to be propagated and quantified through sampling and conditioning on the learned joint density, with substantially fewer model evaluations than conventional UQ methods.
Open AccessProbabilistic Cardiac Digital Twins for Robust Patient-Specific Modeling
Uncertainty quantification (UQ) in computational heart models is essential for reliable cardiac digital twins (DTs) in personalized medicine, yet remains challenging. Traditional Monte Carlo and stochastic Galerkin methods often become impractical in the high-dimensional, nonlinear state variable and parameter spaces of cardiac electrophysiology and mechanics. This article introduces a framework for learning a joint probability density over cardiac observables and model parameters, enabling the characterization of statistical dependencies across a large number of variables in patient-specific cardiac DTs. By sampling from this density and conditioning on available data, useful predictive distributions can be constructed, allowing uncertainty to be propagated through the model and quantified in terms of variability. Conditional regression can then be performed directly on this learned density, enabling systematic exploration of interdependencies among observables for both predictive inference and model design. The statistical methodology adopts a geometry-aware generative learning framework, recently introduced by the authors, that decouples the learning of data geometry from sampling. First it identifies a low-dimensional latent representation that captures the intrinsic structure of the data and its multiscale geometric features. A stochastic differential equation is then formulated directly in the low-dimensional latent space to generate samples efficiently; these are subsequently mapped back to the high-dimensional space of cardiac states and parameters through a smooth lifting operator. We demonstrate the approach on a ventricular arrhythmia prediction benchmark, where the learned joint probability density enables the construction of predictive distributions over key parameters (e.g., conductivities, fibrosis patterns) through sampling and conditioning. This enables uncertainty to be propagated and quantified through sampling and conditioning on the learned joint density, with substantially fewer model evaluations than conventional UQ methods.
- 9 January 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 551
Enabling probabilistic learning on manifolds through double diffusion maps
- 9 January 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 551
Enabling probabilistic learning on manifolds through double diffusion maps
- 30 December 2025
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 207
Generative learning for slow manifolds and bifurcation diagrams
- 30 December 2025
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 207
Generative learning for slow manifolds and bifurcation diagrams
- Open Access
Data-driven inverse uncertainty quantification: application to the Chemical Vapor Deposition Reactor Modeling
This study presents a Bayesian framework for (inverse) uncertainty quantification and parameter estimation in a two-step Chemical Vapor Deposition coating process using production data. We develop an XGBoost surrogate model that maps reactor setup parameters to coating thickness measurements, enabling efficient Bayesian analysis while reducing sampling costs. The methodology handles a mixture of data including continuous, discrete integer, binary, and encoded categorical variables. We establish parameter prior distributions through Bayesian Model Selection and perform Inverse Uncertainty Quantification via weighted Approximate Bayesian Computation with summary statistics, providing robust parameter credible intervals while filtering measurement noise across multiple reactor locations. Furthermore, we employ clustering methods guided by geometry embeddings to focus analysis within homogeneous production groups. This integrated approach provides a validated tool for improving industrial process control under uncertainty.
Open AccessData-driven inverse uncertainty quantification: application to the Chemical Vapor Deposition Reactor Modeling
This study presents a Bayesian framework for (inverse) uncertainty quantification and parameter estimation in a two-step Chemical Vapor Deposition coating process using production data. We develop an XGBoost surrogate model that maps reactor setup parameters to coating thickness measurements, enabling efficient Bayesian analysis while reducing sampling costs. The methodology handles a mixture of data including continuous, discrete integer, binary, and encoded categorical variables. We establish parameter prior distributions through Bayesian Model Selection and perform Inverse Uncertainty Quantification via weighted Approximate Bayesian Computation with summary statistics, providing robust parameter credible intervals while filtering measurement noise across multiple reactor locations. Furthermore, we employ clustering methods guided by geometry embeddings to focus analysis within homogeneous production groups. This integrated approach provides a validated tool for improving industrial process control under uncertainty.
- 30 July 2025
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 446
Generative learning of densities on manifolds
- 30 July 2025
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 446
Generative learning of densities on manifolds
- Open Access
Enabling Probabilistic Learning on Manifolds through Double Diffusion Maps
We present a generative learning framework for probabilistic sampling based on an extension of the Probabilistic Learning on Manifolds (PLoM) approach, which is designed to generate statistically consistent realizations of a random vector in a finite-dimensional Euclidean space, informed by a limited (yet representative) set of observations. In its original form, PLoM constructs a reduced-order probabilistic model by combining three main components: (a) kernel density estimation to approximate the underlying probability measure, (b) Diffusion Maps to uncover the intrinsic low-dimensional manifold structure, and (c) a reduced-order Ito Stochastic Differential Equation (ISDE) to sample from the learned distribution. A key challenge arises, however, when the number of available data points N is small and the dimensionality of the diffusion-map basis approaches N, resulting in overfitting and loss of generalization. To overcome this limitation, we propose an enabling extension that implements a synthesis of Double Diffusion Maps -- a technique capable of capturing multiscale geometric features of the data -- with Geometric Harmonics (GH), a nonparametric reconstruction method that allows smooth nonlinear interpolation in high-dimensional ambient spaces. This approach enables us to solve a full-order ISDE directly in the latent space, preserving the full dynamical complexity of the system, while leveraging its reduced geometric representation. The effectiveness and robustness of the proposed method are illustrated through two numerical studies: one based on data generated from two-dimensional Hermite polynomial functions and another based on high-fidelity simulations of a detonation wave in a reactive flow.
Open AccessEnabling Probabilistic Learning on Manifolds through Double Diffusion Maps
We present a generative learning framework for probabilistic sampling based on an extension of the Probabilistic Learning on Manifolds (PLoM) approach, which is designed to generate statistically consistent realizations of a random vector in a finite-dimensional Euclidean space, informed by a limited (yet representative) set of observations. In its original form, PLoM constructs a reduced-order probabilistic model by combining three main components: (a) kernel density estimation to approximate the underlying probability measure, (b) Diffusion Maps to uncover the intrinsic low-dimensional manifold structure, and (c) a reduced-order Ito Stochastic Differential Equation (ISDE) to sample from the learned distribution. A key challenge arises, however, when the number of available data points N is small and the dimensionality of the diffusion-map basis approaches N, resulting in overfitting and loss of generalization. To overcome this limitation, we propose an enabling extension that implements a synthesis of Double Diffusion Maps -- a technique capable of capturing multiscale geometric features of the data -- with Geometric Harmonics (GH), a nonparametric reconstruction method that allows smooth nonlinear interpolation in high-dimensional ambient spaces. This approach enables us to solve a full-order ISDE directly in the latent space, preserving the full dynamical complexity of the system, while leveraging its reduced geometric representation. The effectiveness and robustness of the proposed method are illustrated through two numerical studies: one based on data generated from two-dimensional Hermite polynomial functions and another based on high-fidelity simulations of a detonation wave in a reactive flow.
- Open Access
Generative Learning for Slow Manifolds and Bifurcation Diagrams
In dynamical systems characterized by separation of time scales, the approximation of so called ``slow manifolds'', on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds are required parts of the ``traditional'' numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have demonstrated capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions conditioned on some quantity of interest (QoI). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a ``label'') on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately ``fill in'' missing segments of steady states in a bifurcation diagram.
Open AccessGenerative Learning for Slow Manifolds and Bifurcation Diagrams
In dynamical systems characterized by separation of time scales, the approximation of so called ``slow manifolds'', on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds are required parts of the ``traditional'' numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have demonstrated capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions conditioned on some quantity of interest (QoI). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a ``label'') on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately ``fill in'' missing segments of steady states in a bifurcation diagram.