On some aspects of approximation of ridge functions
From MaRDI portal
Publication:2344299
DOI10.1016/j.jat.2015.01.003zbMath1316.65023arXiv1406.1747OpenAlexW2077625299MaRDI QIDQ2344299
Publication date: 13 May 2015
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.1747
algorithmnoisy measurementsridge functionsDantzig selectorcompressed sensingapproximation of multivariate functionshigh-dimensional function approximation
Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)
Related Items (4)
Linear/ridge expansions: enhancing linear approximations by ridge functions ⋮ Approximation of curve-based sleeve functions in high dimensions ⋮ The recovery of ridge functions on the hypercube suffers from the curse of dimensionality ⋮ Approximation of generalized ridge functions in high dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Learning functions of few arbitrary linear parameters in high dimensions
- Approximation of functions of few variables in high dimensions
- Tractability of multivariate problems. Volume III: Standard information for operators
- Instance-optimality in probability with an \(\ell _1\)-minimization decoder
- Entropy and sampling numbers of classes of ridge functions
- The restricted isometry property and its implications for compressed sensing
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- A simple proof of the restricted isometry property for random matrices
- Optimal reconstruction of a function from its projections
- Identifying linear combinations of ridge functions
- Harmonic analysis of neural networks
- Fundamentality of ridge functions
- Approximation of infinitely differentiable multivariate functions is intractable
- Capturing ridge functions in high dimensions from point queries
- Complexity of approximation of functions of few variables in high dimensions
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Smallest singular value of random matrices and geometry of random polytopes
- Compressed sensing and best 𝑘-term approximation
- A Survey of Compressed Sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Ridgelets: a key to higher-dimensional intermittency?
- Compressive Sensing
- Compressed sensing
This page was built for publication: On some aspects of approximation of ridge functions
