Gaussian processes with built-in dimensionality reduction: Applications to high-dimensional uncertainty propagation
The DOI matches its Crossref record; 104 of the 104 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
LIII. On lines and planes of closest fit to systems of points in space
Pearson, K. (1901) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440109462720 · Cited by 11,934
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
PLS-regression: a basic tool of chemometrics
Wold, S., Sjöström, M., & Eriksson, L. (2001) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(01)00155-1 · Cited by 10,084
(2012) · Cited by 9,062
(2006) · Springer eBooks · Cited by 8,123
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070 · cited 5×
“, Ms do 3: τi ← arg max τ∈[0,τmax] F (γ (τ ;Wi−1)) {Using EGO [95]}”
MethodInfluentialPartial least-squares regression: a tutorial
Geladi, P., & Kowalski, B. R. (1986) · Analytica Chimica Acta · doi:10.1016/0003-2670(86)80028-9 · Cited by 6,992 · cited 7×
“The latter has been addressed by the locally weighted PLS [82], but at the expense of introducing an excessive amount of parameters.”
MethodInfluentialDesign and Analysis of Computer Experiments
Sacks, J., Welch, W. J., Mitchell, T. J., & Wynn, H. P. (1989) · Statistical Science · doi:10.1214/ss/1177012413 · Cited by 6,919
Inverse Problem Theory and Methods for Model Parameter Estimation
Tarantola, A. (2005) · doi:10.1137/1.9780898717921 · Cited by 6,585 · cited 1×
“In fact, standard MC, as well as advanced variations, are routinely applied to the uncertainty propagation (UP) problem [7–9], model calibration [10,11], stochastic optimization [12–14], involving complex physical models.”
BackgroundStochastic Finite Elements: A Spectral Approach
Ghanem, R., & Spanos, P. D. (1991) · Springer eBooks · doi:10.1007/978-1-4612-3094-6 · Cited by 6,552 · cited 4×
“For example, if the input uncertainty is described via a Gaussian random field, dimensionality reduction can be achieved via a truncated Karhunen–Loève expansion (KLE) [49].”
BackgroundInfluentialGlobal Sensitivity Analysis. The Primer
Saltelli, A., Ratto, M., Andres, T., Campolongo, F., Cariboni, J., Gatelli, D., Saisana, M., & Tarantola, S. (2007) · doi:10.1002/9780470725184 · Cited by 6,430
A Limited Memory Algorithm for Bound Constrained Optimization
Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916069 · Cited by 6,221 · cited 6×
“Require: Observed inputs X, observed outputs y, maximum number of iterations Ml , convergence tolerance l > 0, number of iterations of the Stiefel manifold optimization m, number of iterations of the BFGS algorithm n, initial parameter estimates W0, φ0 and sn,0.”
BackgroundMethodInfluentialReversible jump Markov chain Monte Carlo computation and Bayesian model determination
GREEN, P. J. (1995) · Biometrika · doi:10.1093/biomet/82.4.711 · Cited by 5,930 · cited 1×
“, by reversible-jump MC [114] or by directly computing the model evidence.”
MethodMonte Carlo Statistical Methods
Kim, H. (2000) · Technometrics · doi:10.1080/00401706.2000.10485722 · Cited by 5,508
Gaussian Processes in Machine Learning
Rasmussen, C. E. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28650-9_4 · Cited by 5,397
The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
Xiu, D., & Karniadakis, G. E. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827501387826 · Cited by 4,807
Probability theory the logic of science
Jaynes, E. T., & Bretthorst, G. L. (2003) · Cited by 4,643
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.415 · Cited by 4,388 · cited 2×
“For example, see [39,40] for adaptive sampling targeted to overall surrogate improvement, [41] and [42] for single- and multi-objective global optimization, respectively, and [28] for the uncertainty propagation problem.”
BackgroundBayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276 · cited 1×
“, sensitivity analysis [45,46] or automatic relevance determination [39,47,48].”
BackgroundProbability Theory: The Logic of Science
Jaynes, E. T. (2003) · doi:10.1017/cbo9780511790423 · Cited by 4,045
Neural Information Processing Systems
(2018) · The Deep Learning Revolution · doi:10.7551/mitpress/11474.003.0014 · Cited by 3,730
Aspects of Multivariate Statistical Theory
Gleser, L. J. (1984) · Technometrics · doi:10.1080/00401706.1984.10487948 · Cited by 3,277
Aspects of multivariate statistical theory
Muirhead, R. J. 1. (1982) · Cited by 3,032
Monte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
Aspects of Multivariate Statistical Theory
Muirhead, R. J. (1982) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316559 · Cited by 2,260 · cited 1×
“Algorithm 2 Uniform sampling of Vd ( R D ) (for justification, see Bartlett decomposition theorem [93]).”
BackgroundEvaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Griewank, A., & Walther, A. (1987) · Cited by 2,166
A Taxonomy of Global Optimization Methods Based on Response Surfaces
Jones, D. R. (2001) · Journal of Global Optimization · doi:10.1023/a:1012771025575 · Cited by 2,159 · cited 1×
“For example, see [39,40] for adaptive sampling targeted to overall surrogate improvement, [41] and [42] for single- and multi-objective global optimization, respectively, and [28] for the uncertainty propagation problem.”
BackgroundPlessix, R.-E. (2006) · Geophysical Journal International · doi:10.1111/j.1365-246x.2006.02978.x · Cited by 1,937 · cited 1×
“Even though, in principle, it is possible to compute the gradients either by deriving the adjoint equations [76] or by using automatic differentiation [77], in many cases of interest this is not practical, since implementing any of these two approaches requires a significant amount of time for software development, va…”
BackgroundIntroduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
Spall, J. C. (2003) · Wiley eBooks · doi:10.1002/0471722138 · Cited by 1,890
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, Second Edition
Griewank, A., & Walther, A. (2008) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717761 · Cited by 1,529 · cited 1×
“Even though, in principle, it is possible to compute the gradients either by deriving the adjoint equations [76] or by using automatic differentiation [77], in many cases of interest this is not practical, since implementing any of these two approaches requires a significant amount of time for software development, va…”
BackgroundHigh-Order Collocation Methods for Differential Equations with Random Inputs
Xiu, D., & Hesthaven, J. S. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/040615201 · Cited by 1,522
Haario, H., Laine, M., Mira, A., & Saksman, E. (2006) · Statistics and Computing · doi:10.1007/s11222-006-9438-0 · Cited by 1,498
Riemann manifold langevin and hamiltonian monte carlo methods
Girolami, M., & Calderhead, B. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00765.x · Cited by 1,473 · cited 1×
“The big challenge is the construction of proposals that force W to remain on the Stiefel manifold, which could be achieved, for example, by modifying the Riemann manifold Hamiltonian MC of [113].”
BackgroundMonte Carlo Strategies in Scientific Computing
Hesterberg, T. (2002) · Technometrics · doi:10.1198/tech.2002.s85 · Cited by 1,409 · cited 1×
“The most straightforward UQ approaches are powered by Monte Carlo (MC) sampling [5,6].”
MethodChemometrics: Data Analysis for the Laboratory and Chemical Plant
Brereton, R. G. (2003) · Thammasat University Digital Collections · Cited by 1,355
Neal, R. M. (2001) · Statistics and Computing · doi:10.1023/a:1008923215028 · Cited by 1,172 · cited 1×
“The logarithm of this normalization constant is known as the model evidence, the equivalent of the partition function of statistical mechanics, is notoriously difficult to calculate [97,98].”
BackgroundUncertainty Quantification: Theory, Implementation, and Applications
Smith, R. C. (2013) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973228 · Cited by 1,138
Probabilistic Sensitivity Analysis of Complex Models: A Bayesian Approach
Oakley, J. E., & O'Hagan, A. (2004) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2004.05304.x · Cited by 1,085
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Neal, R. M. (2011) · Cited by 1,039
Dynamics of Heterogeneous Materials
Nesterenko, V. F. (2001) · Springer eBooks · doi:10.1007/978-1-4757-3524-6 · Cited by 1,012
Monte Carlo Statistical Methods (Springer Texts in Statistics)
Robert, C. P., & Casella, G. (2005) · Springer eBooks · Cited by 1,002
A Radial Basis Function Method for Global Optimization
Gutmann, H.-M. (2001) · Journal of Global Optimization · doi:10.1023/a:1011255519438 · Cited by 910 · cited 1×
“The surrogate may be based on a generalized polynomial chaos expansion [16–20], radial basis functions [21,22], relevance vector machines [23], adaptive sparse grid collocation [24], Gaussian processes (GP) [25–27,23,28–31], etc.”
BackgroundGeneral foundations of high‐dimensional model representations
Rabitz, H., & Aliş, Ö. F. (1999) · Journal of Mathematical Chemistry · doi:10.1023/a:1019188517934 · Cited by 904
A feasible method for optimization with orthogonality constraints
Wen, Z., & Yin, W. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0584-1 · Cited by 849 · cited 4×
“As shown in [94], the curve lives in the Stiefel manifold, i.”
BackgroundMethodInfluentialChemometrics: Data Analysis for the Laboratory and Chemical Plant
Booth, D. E. (2004) · Technometrics · doi:10.1198/tech.2004.s738 · Cited by 767
Currin, C., Mitchell, T., Morris, M., & Ylvisaker, D. (1991) · Journal of the American Statistical Association · doi:10.1080/01621459.1991.10475138 · Cited by 753
Monte Carlo Statistical Methods
(2005) · Technometrics · doi:10.1198/tech.2005.s272 · Cited by 725
Challenge problems: uncertainty in system response given uncertain parameters
Oberkampf, W. L., Helton, J. C., Joslyn, C., Wojtkiewicz, S. F., & Ferson, S. A. (2004) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2004.03.002 · Cited by 649
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Emmerich, M., Beume, N., & Naujoks, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31880-4_5 · Cited by 604 · cited 1×
“For example, see [39,40] for adaptive sampling targeted to overall surrogate improvement, [41] and [42] for single- and multi-objective global optimization, respectively, and [28] for the uncertainty propagation problem.”
BackgroundHigh Dimensional Model Representations
Li, G., Rosenthal, C. M., & RABITZ, H. A. (2001) · The Journal of Physical Chemistry A · doi:10.1021/jp010450t · Cited by 496
Morokoff, W. J., & Caflisch, R. E. (1995) · Journal of Computational Physics · doi:10.1006/jcph.1995.1209 · Cited by 482
Ma, X., & Zabaras, N. J. (2009) · Journal of Computational Physics · doi:10.1016/j.jcp.2009.01.006 · Cited by 457 · cited 1×
“The surrogate may be based on a generalized polynomial chaos expansion [16–20], radial basis functions [21,22], relevance vector machines [23], adaptive sparse grid collocation [24], Gaussian processes (GP) [25–27,23,28–31], etc.”
BackgroundDYNAMIC PROGRAMMING AND LAGRANGE MULTIPLIERS
Bellman, R. (1956) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.42.10.767 · Cited by 446
Solitary waves in the granular chain
SEN, S., HONG, J., BANG, J., AVALOS, E., & DONEY, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2007.10.007 · Cited by 446 · cited 1×
“In particular, a one-dimensional uncompressed chain of elastic spherical particles supports the formation and propagation of solitary waves [104], i.”
BackgroundMulti-level Monte Carlo Finite Element method for elliptic PDEs with stochastic coefficients
Barth, A., Schwab, C., & Zollinger, N. (2011) · Numerische Mathematik · doi:10.1007/s00211-011-0377-0 · Cited by 386
O'Hagan, A. (1991) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(91)90002-v · Cited by 342
Constrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions
Regis, R. G., & Shoemaker, C. A. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-0570-0 · Cited by 331 · cited 1×
“The surrogate may be based on a generalized polynomial chaos expansion [16–20], radial basis functions [21,22], relevance vector machines [23], adaptive sparse grid collocation [24], Gaussian processes (GP) [25–27,23,28–31], etc.”
BackgroundBayesian inference for the uncertainty distribution of computer model outputs
Oakley, J. (2002) · Biometrika · doi:10.1093/biomet/89.4.769 · Cited by 323
Active Subspace Methods in Theory and Practice: Applications to Kriging Surfaces
Constantine, P. G., Dow, E. A., & Wang, Q. (2014) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 282
Regression with Input-dependent Noise: A Gaussian Process Treatment
Goldberg, P. W., Williams, C. K. I., & Bishop, C. (1997) · Aston Publications Explorer (Aston University) · Cited by 275
Efficient Implementation of High Dimensional Model Representations
Alış, Ö. F., & Rabitz, H. (2001) · Journal of Mathematical Chemistry · doi:10.1023/a:1010979129659 · Cited by 257
The Curse of Highly Variable Functions for Local Kernel Machines
Bengio, Y., Delalleau, O., & Roux, N. L. (2005) · neural information processing systems · Cited by 255
Kuo, F. Y., Schwab, C., & Sloan, I. H. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110845537 · Cited by 239
Active Subspaces for Shape Optimization
Lukaczyk, T. W., Constantine, P. G., Palacios, F., & Alonso, J. J. (2014) · AIAA Multidisciplinary Design Optimization Conference (MDO) · doi:10.2514/6.2014-1171 · Cited by 200
Duvenaud, D., Nickisch, H., & Rasmussen, C. E. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1112.4394 · Cited by 183
Multi-output local Gaussian process regression: Applications to uncertainty quantification
Bilionis, I., & Zabaras, N. (2012) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.04.047 · Cited by 174 · cited 1×
“For example, see [39,40] for adaptive sampling targeted to overall surrogate improvement, [41] and [42] for single- and multi-objective global optimization, respectively, and [28] for the uncertainty propagation problem.”
BackgroundSelf-citationBilionis, I., Zabaras, N., Konomi, B. A., & Lin, G. (2013) · Journal of Computational Physics · doi:10.1016/j.jcp.2013.01.011 · Cited by 167
Self-citationA Bayesian Approach to the Design and Analysis of Computer Experiments
Currin, C. (1988) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/814584 · Cited by 161
Sankaran, S., & Marsden, A. L. (2011) · Journal of Biomechanical Engineering · doi:10.1115/1.4003259 · Cited by 146
Kim, S., Kano, M., Nakagawa, H., & Hasebe, S. (2011) · International Journal of Pharmaceutics · doi:10.1016/j.ijpharm.2011.10.007 · Cited by 141 · cited 7×
“The latter has been addressed by the locally weighted PLS [82], but at the expense of introducing an excessive amount of parameters.”
BackgroundInfluentialUncertainty quantification with experimental data and complex system models
Russi, T. (2010) · eScholarship (California Digital Library) · Cited by 132
Ferreira, A. P., & Tobyn, M. (2014) · Pharmaceutical Development and Technology · doi:10.3109/10837450.2014.898656 · Cited by 123
Bayesian functional {ANOVA} modeling using Gaussian process prior distributions
Kaufman, C. G., & Sain, S. R. (2010) · Bayesian Analysis · doi:10.1214/10-ba505 · Cited by 122
Active subspaces for sensitivity analysis and dimension reduction of an integrated hydrologic model
Jefferson, J. L., Gilbert, J. M., Constantine, P. G., & Maxwell, R. M. (2015) · Computers & Geosciences · doi:10.1016/j.cageo.2015.07.001 · Cited by 119 · cited 1×
“In this section, we discuss the classic approach to discovering the active subspace using gradient information [69,67, 68,73,70,74,75,90,91].”
BackgroundKernel principal component analysis for stochastic input model generation
Ma, X., & Zabaras, N. J. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.05.037 · Cited by 106 · cited 1×
“If the stochastic input model is to be built from data, one may use principal component analysis (PCA) [50], also known as empirical KLE, or even non-linear dimensionality reduction maps such as kernel PCA [51].”
MethodUncertainty Analysis and other Inference Tools for Complex Computer Codes
O’Hagan, A., Kennedy, M. C., & Oakley, J. E. (1999) · Oxford University Press eBooks · doi:10.1093/oso/9780198504856.003.0022 · Cited by 97
Additive Covariance kernels for high-dimensional Gaussian Process modeling
Durrande, N., Ginsbourger, D., & Roustant, O. (2012) · Annales de la faculté des sciences de Toulouse Mathématiques · doi:10.5802/afst.1342 · Cited by 96
Nonstationary Gaussian Process Regression Using Point Estimates of Local Smoothness
Plagemann, C., Kristian Kersting, B., & Burgard, W. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87481-2_14 · Cited by 91 · cited 1×
“(18) can be relaxed to allow for heteroscedastic (input dependent) noise [85,86], but this is beyond the scope of this work.”
BackgroundSolution of inverse problems with limited forward solver evaluations: a Bayesian perspective
Bilionis, I., & Zabaras, N. J. (2013) · Inverse Problems · doi:10.1088/0266-5611/30/1/015004 · Cited by 76
Self-citationScaling Multidimensional Inference for Structured Gaussian Processes
Gilboa, E., Saatçi, Y., & Cunningham, J. P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.192 · Cited by 73
Plate, T. A. (1999) · Behaviormetrika · doi:10.2333/bhmk.26.29 · Cited by 68 · cited 1×
“The first such effort can be traced to [60] and has been recently revisited by [61–65].”
BackgroundGradient-Enhanced Universal Kriging for Uncertainty Propagation
Lockwood, B., & Anitescu, M. (2012) · Nuclear Science and Engineering · doi:10.13182/nse10-86 · Cited by 67
Chen, P., Zabaras, N. J., & Bilionis, I. (2014) · Journal of Computational Physics · doi:10.1016/j.jcp.2014.12.028 · Cited by 61 · cited 1×
“To this end, the results of [37] on infinite mixtures of GP’s could be leveraged.”
BackgroundSelf-citationMonte Carlo is Fundamentally Unsound
O’Hagan, A. (1987) · Journal of the Royal Statistical Society Series D (The Statistician) · doi:10.2307/2348519 · Cited by 60 · cited 1×
“O’Hagan, this slow convergence is due to the fact that “Monte Carlo is fundamentally unsound” [15], in the sense that it fails to learn exploitable patterns from the collected data.”
BackgroundActive-learning-based surrogate models for empirical performance tuning
Balaprakash, P., Gramacy, R. B., & Wild, S. M. (2013) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster.2013.6702683 · Cited by 57
Assessing Relevance Determination Methods Using DELVE
Neal, R. M. (1998) · Cited by 55
Bilionis, I., & Koutsourelakis, P. (2012) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.01.033 · Cited by 50
Self-citationComputing active subspaces with Monte CarloPreprint
Constantine, P. G., & Gleich, D. F. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.0545 · Cited by 47
Crop physiology calibration in the CLM
Bilionis, I., Drewniak, B. A., & Constantinescu, E. M. (2015) · Geoscientific model development · doi:10.5194/gmd-8-1071-2015 · Cited by 46 · cited 1×
“In fact, standard MC, as well as advanced variations, are routinely applied to the uncertainty propagation (UP) problem [7–9], model calibration [10,11], stochastic optimization [12–14], involving complex physical models.”
BackgroundSelf-citationA stochastic optimization approach to coarse-graining using a relative-entropy framework
Bilionis, I., & Zabaras, N. J. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4789308 · Cited by 42 · cited 1×
“For example, in [14] the authors use this idea to learn the quantum mechanical energy of binary alloys on a fixed lattice by expressing it as the sum of interactions between clusters of atoms, a response surface with thousands of input variables.”
BackgroundSelf-citationConditional sampling and experiment design for quantifying manufacturing error of transonic airfoil
Wang, Q., Chen, H., Hu, R., & Constantine, P. G. (2011) · AIAA Aerospace Sciences Meeting · doi:10.2514/6.2011-658 · Cited by 42
Multidimensional Adaptive Relevance Vector Machines for Uncertainty Quantification
Bilionis, I., & Zabaras, N. J. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/120861345 · Cited by 32 · cited 1×
“The surrogate may be based on a generalized polynomial chaos expansion [16–20], radial basis functions [21,22], relevance vector machines [23], adaptive sparse grid collocation [24], Gaussian processes (GP) [25–27,23,28–31], etc.”
BackgroundSelf-citationA Data-Driven Stochastic Method for Elliptic PDEs with Random Coefficients
Cheng, M., Hou, T. Y., Yan, M., & Zhang, Z. (2013) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/130913249 · Cited by 32
Discovering an active subspace in a single-diode solar cell model
Constantine, P. G., Zaharatos, B., & Campanelli, M. B. (2016) · Cited by 29
Bayesian Uncertainty Propagation Using Gaussian Processes
Bilionis, I., & Zabaras, N. J. (2017) · Springer eBooks · doi:10.1007/978-3-319-12385-1_16 · Cited by 27
Self-citationA Surrogate Accelerated Bayesian Inverse Analysis of the HyShot II Flight Data
Constantine, P. G., Wang, Q., Doostan, A., & Iaccarino, G. (2011) · AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference (SDM) · doi:10.2514/6.2011-2037 · Cited by 21
Output Based Dimensionality Reduction of Geometric Variability in Compressor Blades
Dow, E. A., & Wang, Q. (2013) · AIAA Aerospace Sciences Meeting · doi:10.2514/6.2013-420 · Cited by 15 · cited 1×
“In this section, we discuss the classic approach to discovering the active subspace using gradient information [69,67, 68,73,70,74,75,90,91].”
BackgroundBayesian Uncertainty Propagation Using Gaussian Processes
Bilionis, I., & Zabaras, N. J. (2015) · Springer eBooks · doi:10.1007/978-3-319-11259-6_16-1 · Cited by 11 · cited 2×
“In other words, it makes it possible to produce error bars for the results of the UQ analysis, see [33–36,28,23, 30,31,37] and [38] for a recent review focusing on the uncertainty propagation problem.”
BackgroundSelf-citationWei, J., Lin, G., Jiang, L., & Efendiev, Y. R. (2014) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2014006135 · Cited by 7 · cited 1×
“The UQ community has been embracing and extending HDMR [56,57], sometimes referring to it by the name functional analysis of variance (ANOVA) [58,59].”
MethodErratum: Active Subspace Methods in Theory and Practice: Applications to Kriging Surfaces
Constantine, P. G., Dow, E. A., & Wang, Q. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/140983598 · Cited by 6
Cited by
Tripathy, R. K., & Bilionis, I. (2018) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.08.036 · Cited by 464
Self-citationMachine learning in aerodynamic shape optimization
Li, J., Du, X., & Martins, J. R. R. A. (2022) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2022.100849 · Cited by 354
A Survey on High-dimensional Gaussian Process Modeling with Application to Bayesian Optimization
Binois, M., & Wycoff, N. (2022) · ACM Transactions on Evolutionary Learning and Optimization · doi:10.1145/3545611 · Cited by 180
Machine learning for high-dimensional dynamic stochastic economies
Scheidegger, S., & Bilionis, I. (2019) · Journal of Computational Science · doi:10.1016/j.jocs.2019.03.004 · Cited by 72
Self-citation
Metadata
- Authors
- Tripathy, R., Bilionis, I., & Gonzalez, M.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2016-09
- Volume
- 321
- Pages
- 191-223
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2282795067
- Cited by
- 184
- References
- 104
- FWCI
- 11.90
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.