A weighted _1-minimization approach for sparse polynomial chaos expansions
From MaRDI portal
Publication:349012
DOI10.1016/J.JCP.2014.02.024zbMATH Open1349.65198arXiv1308.0624OpenAlexW1980635834MaRDI QIDQ349012FDOQ349012
Authors: Ji Peng, Jerrad Hampton, Alireza Doostan 
Publication date: 5 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Abstract: This work proposes a method for sparse polynomial chaos (PC) approximation of high-dimensional stochastic functions based on non-adapted random sampling. We modify the standard l1 -minimization algorithm, originally proposed in the context of compressive sampling, using a priori information about the decay of the PC coefficients and refer to the resulting algorithm as weighted l1 -minimization. We provide conditions under which we may guarantee recovery using this weighted scheme. Numerical tests are used to compare the weighted and non-weighted methods for the recovery of solutions to two differential equations with high-dimensional random inputs: a boundary value problem with a random elliptic operator and a 2-D thermally driven cavity flow with random boundary condition.
Full work available at URL: https://arxiv.org/abs/1308.0624
Recommendations
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
- Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- Sparse polynomial chaos expansions: literature survey and benchmark
- Some greedy algorithms for sparse polynomial chaos expansions
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
sparse approximationuncertainty quantificationpolynomial chaoscompressive samplingbasis pursuit denoising (BPDN)stochastic PDEs (SPDEs)weighted \(\ell_1\)-minimization
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Probabilistic models, generic numerical methods in probability and statistics (65C20) Sampling theory in information and communication theory (94A20)
Cites Work
- Automated solution of differential equations by the finite element method. The FEniCS book
- Probing the Pareto frontier for basis pursuit solutions
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Atomic Decomposition by Basis Pursuit
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- 10.1162/15324430152748236
- Decoding by Linear Programming
- A new approach to variable selection in least squares problems
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Compressed sensing
- Signal Recovery by Proximal Forward-Backward Splitting
- Compressed sensing and best \(k\)-term approximation
- Sparse Legendre expansions via \(\ell_1\)-minimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparsity and incoherence in compressive sampling
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Title not available (Why is that?)
- Some basic hypergeometric orthogonal polynomials that generalize Jacobi polynomials
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Sparse representations in unions of bases
- Numerical methods for stochastic computations. A spectral method approach.
- Spectral Methods for Uncertainty Quantification
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- High-Order Collocation Methods for Differential Equations with Random Inputs
- The restricted isometry property and its implications for compressed sensing
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- Atomic decomposition by basis pursuit
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Stochastic collocation algorithms using \(\ell_1\)-minimization
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A stochastic projection method for fluid flow. II: Random process
- Non-intrusive low-rank separated approximation of high-dimensional stochastic models
- Sparse tensor discretization of elliptic SPDEs
- On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods
- Bayesian Compressive Sensing
- Accurate solutions to the square thermally driven cavity at high Rayleigh number
- Sparse tensor Galerkin discretization of parametric and random parabolic PDEs---analytic regularity and generalized polynomial chaos approximation
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Sparse pseudospectral approximation method
- Mid-frequency structural dynamics with parameter uncertainty.
- Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
- Analytic regularity and GPC approximation for control problems constrained by linear parametric elliptic and parabolic PDEs
- On the Theorem of Uniform Recovery of Random Sampling Matrices
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- On the use of a priori information for sparse signal approximations
- A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
- Accuracy Guarantees for <formula formulatype="inline"> <tex Notation="TeX">$\ell_1$</tex></formula>-Recovery
- New bounds on the restricted isometry constant \(\delta _{2k}\)
Cited In (76)
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem
- Probabilistic modeling and global sensitivity analysis for CO\(_2\) storage in geological formations: a spectral approach
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- A new surrogate modeling technique combining Kriging and polynomial chaos expansions - application to uncertainty analysis in computational dosimetry
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Compressive sensing adaptation for polynomial chaos expansions
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- A generalized multi-resolution expansion for uncertainty propagation with application to cardiovascular modeling
- Some greedy algorithms for sparse polynomial chaos expansions
- Sparse polynomial approximation in positive order Sobolev spaces with bounded mixed derivatives and applications to elliptic problems with random loading
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
- Efficient uncertainty quantification of CFD problems by combination of proper orthogonal decomposition and compressed sensing
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- Infinite-dimensional compressed sensing and function interpolation
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
- Coordinate transformation and polynomial chaos for the Bayesian inference of a Gaussian process with parametrized prior covariance function
- Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions
- Level set methods for stochastic discontinuity detection in nonlinear problems
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- Neural network training using \(\ell_1\)-regularization and bi-fidelity data
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing
- Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations
- A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems
- Bayesian adaptation of chaos representations using variational inference and sampling on geodesics
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Effectively Subsampled Quadratures for Least Squares Polynomial Approximations
- Correcting for unknown errors in sparse high-dimensional function approximation
- Data fusion for uncertainty quantification with non-intrusive polynomial chaos
- Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
- Stochastic collocation algorithms using \(\ell_1\)-minimization
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- Interpolation via weighted \(\ell_{1}\) minimization
- Quantifying initial and wind forcing uncertainties in the gulf of Mexico
- Sparse polynomial chaos expansions using variational relevance vector machines
- Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs
- A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- Global sensitivity analysis based on high-dimensional sparse surrogate construction
- A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach
- Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- An adaptive WENO collocation method for differential equations with random coefficients
- Global sensitivity analysis: a Bayesian learning based polynomial chaos approach
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling
- Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression
- New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Active learning polynomial chaos expansion for reliability analysis by maximizing expected indicator function prediction error
- A General Framework of Rotational Sparse Approximation in Uncertainty Quantification
- Non-intrusive reduced-order model for time-dependent stochastic partial differential equations utilizing dynamic mode decomposition and polynomial chaos expansion
- Towards optimal sampling for learning sparse approximation in high dimensions
- A Reduced-Basis Polynomial-Chaos Approach with a Multi-parametric Truncation Scheme for Problems with Uncertainties
- A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property
- Sparse Bayesian learning for complex‐valued rational approximations
- Using automatic differentiation for compressive sensing in uncertainty quantification
- Bi-fidelity variational auto-encoder for uncertainty quantification
- Sufficient conditions on stable reconstruction of weighted problem
- Analysis of sparse recovery for Legendre expansions using envelope bound
- Conditional Karhunen-Loève regression model with basis adaptation for high-dimensional problems: uncertainty quantification and inverse modeling
- An active sparse polynomial chaos expansion approach based on sequential relevance vector machine
- Sequential Stochastic Response Surface Method Using Moving Least Squares-Based Sparse Grid Scheme for Efficient Reliability Analysis
Uses Software
This page was built for publication: A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q349012)
