Correcting for unknown errors in sparse high-dimensional function approximation (Q2424851)

From MaRDI portal

Revision as of 16:15, 19 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Correcting for unknown errors in sparse high-dimensional function approximation	scientific article

Statements

scholarly article

0 references

Correcting for unknown errors in sparse high-dimensional function approximation (English)

0 references

0 references

0 references

Simone Brugiapaglia

0 references

Numerische Mathematik

0 references

publication date

25 June 2019

0 references

full work available at URL

https://arxiv.org/abs/1711.07622

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Infinite-dimensional compressed sensing and function interpolation

0 references

Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data

0 references

Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations

0 references

Sparse Polynomial Approximation of High-Dimensional Functions

0 references

BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING

0 references

A survey of cross-validation procedures for model selection

0 references

Weighted LAD-LASSO method for robust parameter estimation and variable selection in regression

0 references

Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison

0 references

Hierarchical Tensor Approximation of Output Quantities of Parameter-Dependent PDEs

0 references

On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels

0 references

Square-root lasso: pivotal recovery of sparse signals via conic programming

0 references

Pivotal estimation via square-root lasso in nonparametric regression

0 references

Robustness to Unknown Error in Sparse Regularization

0 references

The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Enhancing sparsity by reweighted \(\ell _{1}\) minimization

0 references

Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

0 references

High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs

0 references

Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs

0 references

Polynomial approximation via compressed sensing of high-dimensional functions on lower sets

0 references

Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs

0 references

ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S

0 references

On multivariate polynomial interpolation

0 references

Compressed sensing

0 references

Signal Recovery and the Large Sieve

0 references

A non-adapted sparse approximation of PDEs with stochastic inputs

0 references

Multivariate polynomial interpolation on lower sets

0 references

A mathematical introduction to compressive sensing

0 references

Recovering Compressively Sampled Signals Using Partial Support Information

0 references

0 references

Graph Implementations for Nonsmooth Convex Programs

0 references

0 references

New development in freefem++

0 references

Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection

0 references

Compressed sensing and matrix completion with constant proportion of corruptions

0 references

Solvability problems of bivariate interpolation I

0 references

Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations

0 references

Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization

0 references

A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions

0 references

Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations

0 references

Interpolation via weighted \(\ell_{1}\) minimization

0 references

Correcting Data Corruption Errors for Multivariate Function Approximation

0 references

Sharp Oracle Inequalities for Square Root Regularization

0 references

Recovery of Sparsely Corrupted Signals

0 references

Scaled sparse linear regression

0 references

Selective inference with unknown variance via the square-root lasso

0 references

0 references

Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015

0 references

The adaptive Lasso in high-dimensional sparse heteroscedastic models

0 references

Dense Error Correction Via $\ell^1$-Minimization

0 references

Simultaneous estimation and variable selection in median regression using Lasso-type penalty

0 references

STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION

0 references

Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00211-019-01051-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2424851

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2424851&oldid=36503712"