Tiangang Cui

Tiangang Cui

Auto-generated profile, based on publicly available information

Tiangang Cui

School of Mathematics and Statistics, The University of Sydney, Sydney, Australia

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2016 in Journal of Computational Physics
Verified
Journal Article
Closed access
TCTiangang Cui
Tiangang Cui
KLKody Law
Kody Law
YMYoussef M. Marzouk
Youssef M. Marzouk

29 October 2014 in Inverse Problems
Verified
Journal Article
Open access
TCT Cui
T Cui
JMJ Martin
J Martin
YMY M Marzouk
Y M Marzouk
ASA Solonen
A Solonen
ASA Spantini
A Spantini

15 August 2014 in International Journal for Numerical Methods in Engineering
Verified
Journal Article
Open access
PDF file
TCTiangang Cui
Tiangang Cui
YMYoussef M. Marzouk
Youssef M. Marzouk
KWKaren E. Willcox
Karen E. Willcox
Summary: One of the major challenges in the Bayesian solution of inverse problems governed by partial differential equations (PDEs) is the computational cost of repeatedly evaluating numerical PDE models, as required by Markov chain Monte Carlo (MCMC) methods for posterior sampling. This paper proposes a data‐driven projection‐based model reduction technique to reduce this computational cost. The proposed technique has two distinctive features. First, the model reduction strategy is tailored to inverse problems: the snapshots used to construct the reduced‐order model are computed adaptively from the posterior distribution. Posterior exploration and model reduction are thus pursued simultaneously. Second, to avoid repeated evaluations of the full‐scale numerical model as in a standard MCMC method, we couple the full‐scale model and the reduced‐order model together in the MCMC algorithm. This maintains accurate inference while reducing its overall computational cost. In numerical experiments considering steady‐state flow in a porous medium, the data‐driven reduced‐order model achieves better accuracy than a reduced‐order model constructed using the classical approach. It also improves posterior sampling efficiency by several orders of magnitude compared with a standard MCMC method. Copyright © 2014 John Wiley & Sons, Ltd.

1 January 2015 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
ASAlessio Spantini
Alessio Spantini
ASAntti Solonen
Antti Solonen
TCTiangang Cui
Tiangang Cui
JMJames Martin
James Martin
LTLuis Tenorio
Luis Tenorio
YMYoussef Marzouk
Youssef Marzouk
In the Bayesian approach to inverse problems, data are often informative, relative to the prior, only on a low-dimensional subspace of the parameter space. Significant computational savings can be achieved by using this subspace to characterize and approximate the posterior distribution of the parameters. We first investigate approximation of the posterior covariance matrix as a low-rank update of the prior covariance matrix. We prove optimality of a particular update, based on the leading eigendirections of the matrix pencil defined by the Hessian of the negative log-likelihood and the prior precision, for a broad class of loss functions. This class includes the Förstner metric for symmetric positive definite matrices, as well as the Kullback--Leibler divergence and the Hellinger distance between the associated distributions. We also propose two fast approximations of the posterior mean and prove their optimality with respect to a weighted Bayes risk under squared-error loss. These approximations are dep...

20 October 2011 in Water Resources Research
Verified
Journal Article
Open access
PDF file
TCT. Cui
T. Cui
Colin FoxColin Fox
Colin Fox
MOM. J. O'SUllivan
M. J. O'SUllivan
The aim of this research is to estimate the parameters of a large‐scale numerical model of a geothermal reservoir using Markov chain Monte Carlo (MCMC) sampling, within the framework of Bayesian inference. All feasible parameters that are consistent with the measured data are summarized by the posterior distribution, and hence parameter estimation and uncertainty quantification are both given by calculating expected values of statistics of interest over the posterior distribution. It appears to be computationally infeasible to use the standard Metropolis‐Hastings algorithm (MH) to sample the high dimensional computationally expensive posterior distribution. To improve the sampling efficiency, a new adaptive delayed‐acceptance MH algorithm (ADAMH) is implemented to adaptively build a stochastic model of the error introduced by the use of a reduced‐order model. This use of adaptivity differs from existing adaptive MCMC algorithms that tune proposal distributions of the Metropolis‐Hastings algorithm (MH), though ADAMH also implements that technique. For the 3‐D geothermal reservoir model we present here, ADAMH shows a great improvement in the computational efficiency of the MCMC sampling, and promising results for parameter estimation and uncertainty quantification are obtained. This algorithm could offer significant improvement in computational efficiency when implementing sample‐based inference in other large‐scale inverse problems.

1 March 2016 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
BPBenjamin Peherstorfer
Benjamin Peherstorfer
TCTiangang Cui
Tiangang Cui
YMYoussef Marzouk
Youssef Marzouk
KWKaren Willcox
Karen Willcox