Troy Butler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Troy Butler has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Clint Dawson
Oden Institute for Computational Engineering and Sciences The University of Texas at Austin Austin TX USA
3 shared publications - Donald Estep
Department of Statistics, Colorado State University, Fort Collins, CO, USA
3 shared publications - Lindley Graham
Institute for Computational Engineering and Sciences (ICES), University of Texas at Austin, Austin, Texas 78712
3 shared publications Michael Pilosov
Mind the Math, LLC, Denver, Colorado 80203, USA
3 shared publications- Tim Wildey
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
3 shared publications Timothy Wildey
Optimization and Uncertainty Quantification Department, Center for Computing Research, Sandia National Laboratories, Albuquerque, NM 87185
3 shared publications
Latest Publications
- 13 February 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 453
Variational data-consistent assimilation
- 13 February 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 453
Variational data-consistent assimilation
- 1 January 2026
- Published by Begell House Inc. Publishers in International Journal for Uncertainty Quantification
- Vol. 16 (3) , 27-60
ITERATIVE DATA-CONSISTENT INVERSION WITH MULTIPLE PUSH-FORWARD CONSTRAINTS
A foundational challenge in uncertainty quantification involves estimating a probability measure on the space of uncertain parameters such that its push-forward through a computational model matches an observed probability measure on the output data associated with quantities of interest (QoI). When multiple, distinct sets of observational data are available, the desired parameter measure should simultaneously satisfy multiple push-forward constraints associated with various subsets of the QoI. In this work, we present a convergent measure-theoretic framework for solving this problem based on an iterative application of data-consistent inversion (DCI). We first rigorously establish the theoretical optimality of the DCI solution to the standard problem, proving that it minimizes the f-divergence over the space of all possible pullback measures that satisfy the push-forward constraint. This optimality property provides the foundation for our iterative DCI scheme, which is shown to converge to a solution of the multiple push-forward constraint problem. This iterative solution minimizes the cumulative f-divergence across all constraints and, under uniform initializations, represents the maximal entropy solution (the I-projection) onto the intersection of the solution sets. We provide a rigorous convergence analysis for the proposed method and demonstrate its practical utility through numerical examples, including a high-dimensional parameter space governed by partial differential equations, where the iterative approach robustly avoids the complexities associated with approximating high-dimensional joint observed measures.
- 1 January 2026
- Published by Begell House Inc. Publishers in International Journal for Uncertainty Quantification
- Vol. 16 (3) , 27-60
ITERATIVE DATA-CONSISTENT INVERSION WITH MULTIPLE PUSH-FORWARD CONSTRAINTS
A foundational challenge in uncertainty quantification involves estimating a probability measure on the space of uncertain parameters such that its push-forward through a computational model matches an observed probability measure on the output data associated with quantities of interest (QoI). When multiple, distinct sets of observational data are available, the desired parameter measure should simultaneously satisfy multiple push-forward constraints associated with various subsets of the QoI. In this work, we present a convergent measure-theoretic framework for solving this problem based on an iterative application of data-consistent inversion (DCI). We first rigorously establish the theoretical optimality of the DCI solution to the standard problem, proving that it minimizes the f-divergence over the space of all possible pullback measures that satisfy the push-forward constraint. This optimality property provides the foundation for our iterative DCI scheme, which is shown to converge to a solution of the multiple push-forward constraint problem. This iterative solution minimizes the cumulative f-divergence across all constraints and, under uniform initializations, represents the maximal entropy solution (the I-projection) onto the intersection of the solution sets. We provide a rigorous convergence analysis for the proposed method and demonstrate its practical utility through numerical examples, including a high-dimensional parameter space governed by partial differential equations, where the iterative approach robustly avoids the complexities associated with approximating high-dimensional joint observed measures.
- 1 January 2026
- Published by Begell House Inc. Publishers in International Journal for Uncertainty Quantification
- Vol. 16 (2) , 75-100
OPTIMAL EXPERIMENTAL DESIGN CRITERIA FOR DATA-CONSISTENT INVERSION
The ability to design effective experiments is crucial for obtaining data that can substantially reduce the uncertainty in the predictions made using computational models. An optimal experimental design (OED) refers to the choice of a particular experiment that optimizes a particular design criterion, e.g., maximizing a utility function, which measures the information content of the data. However, traditional approaches for optimal experimental design typically require solving a large number of computationally intensive inverse problems to find the data that maximize the utility function. Here, we introduce two novel OED criteria that are specifically crafted for the data-consistent inversion (DCI) framework, but do not require solving inverse problems. DCI is a specific approach for solving a class of stochastic inverse problems by constructing a pullback measure on uncertain parameters from an observed probability measure on the outputs of a quantities of interest (QoI) map. While expected information gain (EIG) has been used for both DCI and Bayesian based OED, the characteristics and properties of DCI solutions differ from those of solutions to Bayesian inverse problems which should be reflected in the OED criteria. The new design criteria developed in this study, called the expected scaling effect and the expected skewness effect, leverage the geometric structure of pre-images associated with observable data sets, allowing for an intuitive and direct approach to OED. These criteria utilize singular value computations derived from sampled and approximated Jacobians of the experimental designs while avoiding the generally more computationally expensive step of solving the stochastic inverse problem. We present both simultaneous and sequential (greedy) formulations of OED based on these innovative criteria. Numerical results demonstrate the effectiveness in our approach for DCI solutions to stochastic inverse problems.
- 1 January 2026
- Published by Begell House Inc. Publishers in International Journal for Uncertainty Quantification
- Vol. 16 (2) , 75-100
OPTIMAL EXPERIMENTAL DESIGN CRITERIA FOR DATA-CONSISTENT INVERSION
The ability to design effective experiments is crucial for obtaining data that can substantially reduce the uncertainty in the predictions made using computational models. An optimal experimental design (OED) refers to the choice of a particular experiment that optimizes a particular design criterion, e.g., maximizing a utility function, which measures the information content of the data. However, traditional approaches for optimal experimental design typically require solving a large number of computationally intensive inverse problems to find the data that maximize the utility function. Here, we introduce two novel OED criteria that are specifically crafted for the data-consistent inversion (DCI) framework, but do not require solving inverse problems. DCI is a specific approach for solving a class of stochastic inverse problems by constructing a pullback measure on uncertain parameters from an observed probability measure on the outputs of a quantities of interest (QoI) map. While expected information gain (EIG) has been used for both DCI and Bayesian based OED, the characteristics and properties of DCI solutions differ from those of solutions to Bayesian inverse problems which should be reflected in the OED criteria. The new design criteria developed in this study, called the expected scaling effect and the expected skewness effect, leverage the geometric structure of pre-images associated with observable data sets, allowing for an intuitive and direct approach to OED. These criteria utilize singular value computations derived from sampled and approximated Jacobians of the experimental designs while avoiding the generally more computationally expensive step of solving the stochastic inverse problem. We present both simultaneous and sequential (greedy) formulations of OED based on these innovative criteria. Numerical results demonstrate the effectiveness in our approach for DCI solutions to stochastic inverse problems.
- 2 September 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 13 (3) , 1475-1500
Building Population-Informed Priors for Bayesian Inference Using Data-Consistent Stochastic Inversion
Bayesian inference provides a powerful tool for leveraging observational data to inform model predictions and uncertainties. However, when such data are limited, Bayesian inference may not adequately constrain uncertainty without the use of highly informative priors. Common approaches for constructing informative priors typically rely on either assumptions or knowledge of the underlying physics, which is not always available. In this work, we consider the scenario where data are available on a population of assets/individuals, which occurs in many problem domains such as biomedical or digital twin applications, and leverage this population-level data to systematically constrain the Bayesian prior and subsequently improve individualized inferences. The approach proposed in this paper is based upon a recently developed technique known as data-consistent inversion (DCI) for constructing a pullback probability measure. Succinctly, we utilize DCI to build population-informed priors for subsequent Bayesian inference on individuals. While the approach is general and applies to nonlinear maps and arbitrary priors, we prove that for linear inverse problems with Gaussian priors, the population-informed prior produces an increase in the information gain as measured by the determinant and trace of the inverse posterior covariance. We also demonstrate that the Kullback–Leibler divergence often improves with high probability. Numerical results, including linear-Gaussian examples and one inspired by digital twins for additively manufactured assets, indicate that there is significant value in using these population-informed priors.
- 2 September 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 13 (3) , 1475-1500
Building Population-Informed Priors for Bayesian Inference Using Data-Consistent Stochastic Inversion
Bayesian inference provides a powerful tool for leveraging observational data to inform model predictions and uncertainties. However, when such data are limited, Bayesian inference may not adequately constrain uncertainty without the use of highly informative priors. Common approaches for constructing informative priors typically rely on either assumptions or knowledge of the underlying physics, which is not always available. In this work, we consider the scenario where data are available on a population of assets/individuals, which occurs in many problem domains such as biomedical or digital twin applications, and leverage this population-level data to systematically constrain the Bayesian prior and subsequently improve individualized inferences. The approach proposed in this paper is based upon a recently developed technique known as data-consistent inversion (DCI) for constructing a pullback probability measure. Succinctly, we utilize DCI to build population-informed priors for subsequent Bayesian inference on individuals. While the approach is general and applies to nonlinear maps and arbitrary priors, we prove that for linear inverse problems with Gaussian priors, the population-informed prior produces an increase in the information gain as measured by the determinant and trace of the inverse posterior covariance. We also demonstrate that the Kullback–Leibler divergence often improves with high probability. Numerical results, including linear-Gaussian examples and one inspired by digital twins for additively manufactured assets, indicate that there is significant value in using these population-informed priors.
- Open Access
Optimal Experimental Design Criteria for Data-Consistent Inversion
The ability to design effective experiments is crucial for obtaining data that can substantially reduce the uncertainty in the predictions made using computational models. An optimal experimental design (OED) refers to the choice of a particular experiment that optimizes a particular design criteria, e.g., maximizing a utility function, which measures the information content of the data. However, traditional approaches for optimal experimental design typically require solving a large number of computationally intensive inverse problems to find the data that maximizes the utility function. Here, we introduce two novel OED criteria that are specifically crafted for the data consistent inversion (DCI) framework, but do not require solving inverse problems. DCI is a specific approach for solving a class of stochastic inverse problems by constructing a pullback measure on uncertain parameters from an observed probability measure on the outputs of a quantity of interest (QoI) map. While expected information gain (EIG) has been used for both DCI and Bayesian based OED, the characteristics and properties of DCI solutions differ from those of solutions to Bayesian inverse problems which should be reflected in the OED criteria. The new design criteria developed in this study, called the expected scaling effect and the expected skewness effect, leverage the geometric structure of pre-images associated with observable data sets, allowing for an intuitive and computationally efficient approach to OED. These criteria utilize singular value computations derived from sampled and approximated Jacobians of the experimental designs. We present both simultaneous and sequential (greedy) formulations of OED based on these innovative criteria. Numerical results demonstrate the effectiveness in our approach for solving stochastic inverse problems.
Open AccessOptimal Experimental Design Criteria for Data-Consistent Inversion
The ability to design effective experiments is crucial for obtaining data that can substantially reduce the uncertainty in the predictions made using computational models. An optimal experimental design (OED) refers to the choice of a particular experiment that optimizes a particular design criteria, e.g., maximizing a utility function, which measures the information content of the data. However, traditional approaches for optimal experimental design typically require solving a large number of computationally intensive inverse problems to find the data that maximizes the utility function. Here, we introduce two novel OED criteria that are specifically crafted for the data consistent inversion (DCI) framework, but do not require solving inverse problems. DCI is a specific approach for solving a class of stochastic inverse problems by constructing a pullback measure on uncertain parameters from an observed probability measure on the outputs of a quantity of interest (QoI) map. While expected information gain (EIG) has been used for both DCI and Bayesian based OED, the characteristics and properties of DCI solutions differ from those of solutions to Bayesian inverse problems which should be reflected in the OED criteria. The new design criteria developed in this study, called the expected scaling effect and the expected skewness effect, leverage the geometric structure of pre-images associated with observable data sets, allowing for an intuitive and computationally efficient approach to OED. These criteria utilize singular value computations derived from sampled and approximated Jacobians of the experimental designs. We present both simultaneous and sequential (greedy) formulations of OED based on these innovative criteria. Numerical results demonstrate the effectiveness in our approach for solving stochastic inverse problems.
- 30 January 2025
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 182, 184-212
A machine-learning enabled framework for quantifying uncertainties in parameters of computational models
- 30 January 2025
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 182, 184-212
A machine-learning enabled framework for quantifying uncertainties in parameters of computational models
- Open Access
Sequential Maximal Updated Density Parameter Estimation for Dynamical Systems with Parameter Drift
We present a novel method for generating sequential parameter estimates and quantifying epistemic uncertainty in dynamical systems within a data-consistent (DC) framework. The DC framework differs from traditional Bayesian approaches due to the incorporation of the push-forward of an initial density, which performs selective regularization in parameter directions not informed by the data in the resulting updated density. This extends a previous study that included the linear Gaussian theory within the DC framework and introduced the maximal updated density (MUD) estimate as an alternative to both least squares and maximum a posterior (MAP) estimates. In this work, we introduce algorithms for operational settings of MUD estimation in real or near-real time where spatio-temporal datasets arrive in packets to provide updated estimates of parameters and identify potential parameter drift. Computational diagnostics within the DC framework prove critical for evaluating (1) the quality of the DC update and MUD estimate and (2) the detection of parameter value drift. The algorithms are applied to estimate (1) wind drag parameters in a high-fidelity storm surge model, (2) thermal diffusivity field for a heat conductivity problem, and (3) changing infection and incubation rates of an epidemiological model.
Open AccessSequential Maximal Updated Density Parameter Estimation for Dynamical Systems with Parameter Drift
We present a novel method for generating sequential parameter estimates and quantifying epistemic uncertainty in dynamical systems within a data-consistent (DC) framework. The DC framework differs from traditional Bayesian approaches due to the incorporation of the push-forward of an initial density, which performs selective regularization in parameter directions not informed by the data in the resulting updated density. This extends a previous study that included the linear Gaussian theory within the DC framework and introduced the maximal updated density (MUD) estimate as an alternative to both least squares and maximum a posterior (MAP) estimates. In this work, we introduce algorithms for operational settings of MUD estimation in real or near-real time where spatio-temporal datasets arrive in packets to provide updated estimates of parameters and identify potential parameter drift. Computational diagnostics within the DC framework prove critical for evaluating (1) the quality of the DC update and MUD estimate and (2) the detection of parameter value drift. The algorithms are applied to estimate (1) wind drag parameters in a high-fidelity storm surge model, (2) thermal diffusivity field for a heat conductivity problem, and (3) changing infection and incubation rates of an epidemiological model.
- Open Access
A Distributions-based Approach for Data-Consistent Inversion
We formulate a novel approach to solve a class of stochastic problems, referred to as data-consistent inverse (DCI) problems, which involve the characterization of a probability measure on the parameters of a computational model whose subsequent push-forward matches an observed probability measure on specified quantities of interest (QoI) typically associated with the outputs from the computational model. Whereas prior DCI solution methodologies focused on either constructing non-parametric estimates of the densities or the probabilities of events associated with the pre-image of the QoI map, we develop and analyze a constrained quadratic optimization approach based on estimating push-forward measures using weighted empirical distribution functions. The method proposed here is more suitable for low-data regimes or high-dimensional problems than the density-based method, as well as for problems where the probability measure does not admit a density. Numerical examples are included to demonstrate the performance of the method and to compare with the density-based approach where applicable.
Open AccessA Distributions-based Approach for Data-Consistent Inversion
We formulate a novel approach to solve a class of stochastic problems, referred to as data-consistent inverse (DCI) problems, which involve the characterization of a probability measure on the parameters of a computational model whose subsequent push-forward matches an observed probability measure on specified quantities of interest (QoI) typically associated with the outputs from the computational model. Whereas prior DCI solution methodologies focused on either constructing non-parametric estimates of the densities or the probabilities of events associated with the pre-image of the QoI map, we develop and analyze a constrained quadratic optimization approach based on estimating push-forward measures using weighted empirical distribution functions. The method proposed here is more suitable for low-data regimes or high-dimensional problems than the density-based method, as well as for problems where the probability measure does not admit a density. Numerical examples are included to demonstrate the performance of the method and to compare with the density-based approach where applicable.
- Open Access
From Displacements to Distributions: A Machine-Learning Enabled Framework for Quantifying Uncertainties in Parameters of Computational Models
This work presents novel extensions for combining two frameworks for quantifying both aleatoric (i.e., irreducible) and epistemic (i.e., reducible) sources of uncertainties in the modeling of engineered systems. The data-consistent (DC) framework poses an inverse problem and solution for quantifying aleatoric uncertainties in terms of pullback and push-forward measures for a given Quantity of Interest (QoI) map. Unfortunately, a pre-specified QoI map is not always available a priori to the collection of data associated with system outputs. The data themselves are often polluted with measurement errors (i.e., epistemic uncertainties), which complicates the process of specifying a useful QoI. The Learning Uncertain Quantities (LUQ) framework defines a formal three-step machine-learning enabled process for transforming noisy datasets into samples of a learned QoI map to enable DC-based inversion. We develop a robust filtering step in LUQ that can learn the most useful quantitative information present in spatio-temporal datasets. The learned QoI map transforms simulated and observed datasets into distributions to perform DC-based inversion. We also develop a DC-based inversion scheme that iterates over time as new spatial datasets are obtained and utilizes quantitative diagnostics to identify both the quality and impact of inversion at each iteration. Reproducing Kernel Hilbert Space theory is leveraged to mathematically analyze the learned QoI map and develop a quantitative sufficiency test for evaluating the filtered data. An illustrative example is utilized throughout while the final two examples involve the manufacturing of shells of revolution to demonstrate various aspects of the presented frameworks.
Open AccessFrom Displacements to Distributions: A Machine-Learning Enabled Framework for Quantifying Uncertainties in Parameters of Computational Models
This work presents novel extensions for combining two frameworks for quantifying both aleatoric (i.e., irreducible) and epistemic (i.e., reducible) sources of uncertainties in the modeling of engineered systems. The data-consistent (DC) framework poses an inverse problem and solution for quantifying aleatoric uncertainties in terms of pullback and push-forward measures for a given Quantity of Interest (QoI) map. Unfortunately, a pre-specified QoI map is not always available a priori to the collection of data associated with system outputs. The data themselves are often polluted with measurement errors (i.e., epistemic uncertainties), which complicates the process of specifying a useful QoI. The Learning Uncertain Quantities (LUQ) framework defines a formal three-step machine-learning enabled process for transforming noisy datasets into samples of a learned QoI map to enable DC-based inversion. We develop a robust filtering step in LUQ that can learn the most useful quantitative information present in spatio-temporal datasets. The learned QoI map transforms simulated and observed datasets into distributions to perform DC-based inversion. We also develop a DC-based inversion scheme that iterates over time as new spatial datasets are obtained and utilizes quantitative diagnostics to identify both the quality and impact of inversion at each iteration. Reproducing Kernel Hilbert Space theory is leveraged to mathematically analyze the learned QoI map and develop a quantitative sufficiency test for evaluating the filtered data. An illustrative example is utilized throughout while the final two examples involve the manufacturing of shells of revolution to demonstrate various aspects of the presented frameworks.
- 3 February 2023
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 407
Parameter estimation with maximal updated densities
- 3 February 2023
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 407
Parameter estimation with maximal updated densities