The DOI matches its Crossref record; 74 of the 74 references it cites were found in a registry or an index.
Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
Open accessAbstract
Sparse polynomial chaos expansions (PCE) are a popular surrogate modelling method that takes advantage of the properties of PCE, the sparsity-of-effects principle, and powerful sparse regression solvers to approximate computer models with many input parameters, relying on only a few model evaluations. Within the last decade, a large number of algorithms for the computation of sparse PCE have been published in the applied math and engineering literature. We present an extensive review of the existing methods and develop a framework for classifying the algorithms. Furthermore, we conduct a unique benchmark on a selection of methods to identify which approaches work best in practical applications. Comparing their accuracy on several benchmark models of varying dimensionality and complexity, we find that the choice of sparse regression solver and sampling scheme for the computation of a sparse PCE surrogate can make a significant difference of up to several orders of magnitude in the resulting mean-squared error. Different methods seem to be superior in different regimes of model dimensionality and experimental design size.
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
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
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
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
On the distribution of points in a cube and the approximate evaluation of integrals
Sobol', I. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90144-9 · Cited by 2,975
Global sensitivity analysis using polynomial chaos expansions
Sudret, B. (2008) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2007.04.002 · Cited by 2,539
Self-citationJi, S., Xue, Y., & Carin, L. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914345 · Cited by 2,406
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Halton, J. H. (1960) · Numerische Mathematik · doi:10.1007/bf01386213 · Cited by 1,985
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559 · cited 4×
“by differentiation (Tipping, 2001), by the expectation-maximization algorithm (Figueiredo, 2003; Wipf and Rao, 2004), by expectation-propagation (Seeger and Nickisch, 2008) or by a fast approximate algorithm (Faul and Tipping, 2002; Tipping and Faul, 2003).”
BackgroundMethodInfluentialHigh-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
Adaptive sparse polynomial chaos expansion based on least angle regression
Blatman, G., & Sudret, B. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2010.12.021 · Cited by 1,502
Self-citationA Survey of Sparse Representation: Algorithms and Applications
Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D. (2015) · IEEE Access · doi:10.1109/access.2015.2430359 · Cited by 1,092
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Birgin, E. G., Martínez, J. M., & Raydan, M. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497330963 · Cited by 1,056
Blatman, G., & Sudret, B. (2010) · Probabilistic Engineering Mechanics · doi:10.1016/j.probengmech.2009.10.003 · Cited by 832
Self-citationBayesian Compressive Sensing Using Laplace Priors
Babacan, S. D., Molina, R., & Katsaggelos, A. K. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2032894 · Cited by 804
Optimum Designs in Regression Problems
Kiefer, J., & Wolfowitz, J. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706252 · Cited by 791
Optimal Discretization of Random Fields
Li, C., & Der Kiureghian, A. (1993) · Journal of Engineering Mechanics · doi:10.1061/(asce)0733-9399(1993)119:6(1136 · Cited by 728
Echard, B., Gayton, N., Lemaire, M., & Relun, N. (2012) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2012.10.008 · Cited by 692
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Gu, M., & Eisenstat, S. C. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917055 · Cited by 677
The generalization of Latin hypercube sampling
Shields, M. D., & Zhang, J. (2016) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2015.12.002 · Cited by 652
Settles, B. (2012) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00429ed1v01y201207aim018 · Cited by 605
A Probabilistic and RIPless Theory of Compressed Sensing
Candes, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2161794 · Cited by 598
Adaptive sparseness for supervised learning
Figueiredo, M. A. T. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1227989 · Cited by 536
Minimization of $\ell_{1-2}$ for Compressed Sensing
Yin, P., Lou, Y., He, Q., & Xin, J. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140952363 · Cited by 473
Compressive sensing: From theory to applications, a survey
Qaisar, S., Bilal, R. M., Iqbal, W., Naureen, M., & Lee, S. (2013) · Journal of Communications and Networks · doi:10.1109/jcn.2013.000083 · Cited by 457
A non-adapted sparse approximation of PDEs with stochastic inputs
Doostan, A., & Owhadi, H. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.01.002 · Cited by 436
On the convergence of generalized polynomial chaos expansions
Ernst, O. G., Mugler, A., Starkloff, H.-J., & Ullmann, E. (2012) · ESAIM: Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an/2011045 · Cited by 414
A Comparison of Algorithms for Constructing Exact D-Optimal Designs
Cook, R. D., & Nachtrheim, C. J. (1980) · Technometrics · doi:10.1080/00401706.1980.10486162 · Cited by 408
POLYNOMIAL-CHAOS-BASED KRIGING
Schobi, R., Sudret, B., & Wiart, J. (2015) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2015012467 · Cited by 398
Self-citationDesign of computer experiments: space filling and beyond
Pronzato, L., & Müller, W. G. (2011) · Statistics and Computing · doi:10.1007/s11222-011-9242-3 · Cited by 396
Efficient computation of global sensitivity indices using sparse polynomial chaos expansions
Blatman, G., & Sudret, B. (2010) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2010.06.015 · Cited by 383
Self-citationWavelet-based image estimation: an empirical Bayes approach using Jeffrey's noninformative prior
Figueiredo, M. A. T., & Nowak, R. D. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.941856 · Cited by 235
Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies
Hampton, J., & Doostan, A. (2015) · Journal of Computational Physics · doi:10.1016/j.jcp.2014.09.019 · Cited by 212
DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING
Sargsyan, K., Safta, C., Najm, H. N., Debusschere, B. J., Ricciuto, D., & Thornton, P. (2014) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2013006821 · Cited by 190
Least squares polynomial chaos expansion: A review of sampling strategies
Hadigol, M., & Doostan, A. (2017) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2017.12.019 · Cited by 188
A weighted -minimization approach for sparse polynomial chaos expansions
Peng, J., Hampton, J., & Doostan, A. (2014) · Journal of Computational Physics · doi:10.1016/j.jcp.2014.02.024 · Cited by 183
Hu, C., & Youn, B. D. (2011) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-010-0568-9 · Cited by 183
A Critical Review of Surrogate Assisted Robust Design Optimization
Chatterjee, T., Chakraborty, S., & Chowdhury, R. (2019) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-017-9240-5 · Cited by 176
Enhancingℓ1-minimization estimates of polynomial chaos expansions using basis selection
Jakeman, J. D., Eldred, M. S., & Sargsyan, K. (2015) · Journal of Computational Physics · doi:10.1016/j.jcp.2015.02.025 · Cited by 174
Baumann, D., & Baumann, K. (2014) · Journal of Cheminformatics · doi:10.1186/s13321-014-0047-1 · Cited by 167
A review of some exchange algorithms for constructing discrete D-optimal designs
Nguyen, N.-K., & Miller, A. J. (1992) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(92)90064-m · Cited by 162
Bayesian sparse polynomial chaos expansion for global sensitivity analysis
Shao, Q., Younès, A., Fahs, M., & Mara, T. A. (2017) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2017.01.033 · Cited by 158
Coherence motivated sampling and convergence analysis of least squares polynomial Chaos regression
Hampton, J., & Doostan, A. (2015) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2015.02.006 · Cited by 134
Model Selection for Small Sample Regression
Chapelle, O., Vapnik, V. N., & Bengio, Y. (2002) · Machine Learning · doi:10.1023/a:1013943418833 · Cited by 129
Cheng, K., & Lü, Z. (2017) · Computers & Structures · doi:10.1016/j.compstruc.2017.09.002 · Cited by 125
A robust and efficient stepwise regression method for building sparse polynomial chaos expansions
Abraham, S., Raisee, M., Ghorbaniasl, G., Contino, F., & Lacor, C. (2016) · Journal of Computational Physics · doi:10.1016/j.jcp.2016.12.015 · Cited by 124
Sparse polynomial chaos expansions via compressed sensing and D-optimal design
Diaz, P., Doostan, A., & Hampton, J. (2018) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2018.03.020 · Cited by 113
Global sensitivity analysis using low-rank tensor approximations
Konakli, K., & Sudret, B. (2016) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2016.07.012 · Cited by 105
Self-citationA Compressed Sensing Approach for Partial Differential Equations with Random Input Data
Mathelin, L., & Gallivan, K. A. (2012) · Communications in Computational Physics · doi:10.4208/cicp.151110.090911a · Cited by 99
Lataniotis, C., Marelli, S., & Sudret, B. (2020) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2020031935 · Cited by 96
Self-citationSequential Design of Experiment for Sparse Polynomial Chaos Expansions
Fajraoui, N., Marelli, S., & Sudret, B. (2017) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/16m1103488 · Cited by 86
Self-citationKougioumtzoglou, I. A., Petromichelakis, I., & Psaros, A. F. (2020) · Probabilistic Engineering Mechanics · doi:10.1016/j.probengmech.2020.103082 · Cited by 75
PLS-based adaptation for efficient PCE representation in high dimensions
Papaioannou, I., Ehre, M., & Straub, D. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2019.02.046 · Cited by 68
Compressive sensing adaptation for polynomial chaos expansions
Tsilifis, P., Huan, X., Safta, C., Sargsyan, K., Lacaze, G., Oefelein, J. C., Najm, H. N., & Ghanem, R. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.12.010 · Cited by 65
D-MORPH regression: application to modeling with unknown parameters more than observation data
Li, G., & RABITZ, H. A. (2010) · Journal of Mathematical Chemistry · doi:10.1007/s10910-010-9722-2 · Cited by 59
Zhou, Y., Lü, Z., Hu, J., & Hu, Y. (2020) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.112906 · Cited by 58
Surrogate modeling based on resampled polynomial chaos expansions
Liu, Z., Lesselier, D., Sudret, B., & Wiart, J. (2020) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2020.107008 · Cited by 49
Self-citationEffectively Subsampled Quadratures for Least Squares Polynomial Approximations
Seshadri, P., Narayan, A., & Mahadevan, S. (2017) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/16m1057668 · Cited by 43
Sequential Design for Ranking Response Surfaces
Hu, R., & Ludkovski, M. (2017) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/15m1045168 · Cited by 34
Zhou, Y., Lü, Z., Cheng, K., & Ling, C. (2019) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2019.04.046 · Cited by 34
Marelli, S., Wagner, P., Lataniotis, C., & Sudret, B. (2020) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2020034395 · Cited by 32
Self-citationRegression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models
Tarakanov, A., & Elsheikh, A. H. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2019.108909 · Cited by 26
Sparse Polynomial Chaos expansions using variational relevance vector machines
Tsilifis, P., Papaioannou, I., Straub, D., & Nobile, F. (2020) · Journal of Computational Physics · doi:10.1016/j.jcp.2020.109498 · Cited by 26
An expanded sparse Bayesian learning method for polynomial chaos expansion
Zhou, Y., Lü, Z., Cheng, K., & Shi, Y. (2019) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2019.03.032 · Cited by 24
Global sensitivity analysis: A Bayesian learning based polynomial chaos approach
Bhattacharyya, B. (2020) · Journal of Computational Physics · doi:10.1016/j.jcp.2020.109539 · Cited by 21
Zhou, Y., Lü, Z., & Cheng, K. (2018) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-018-2062-8 · Cited by 15
Cited by
Adaptive approaches in metamodel-based reliability analysis: A review
Teixeira, R., Nogal, M., & O’Connor, A. (2021) · Structural Safety · doi:10.1016/j.strusafe.2020.102019 · Cited by 277
Metadata
- Authors
- Lüthen, N., Marelli, S., & Sudret, B.
- Venue
- SIAM/ASA Journal on Uncertainty Quantification
- Published
- 2021-01
- Volume
- 9
- Issue
- 2
- Pages
- 593-649
- ISSN
- 2166-2525 (ISSN-L)
- OpenAlex
- W3004945969
- Cited by
- 256
- References
- 74
- FWCI
- 20.34
- Type
- journal article
- Language
- en
- Open access
- green
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.