Approximation of functions of few variables in high dimensions
From MaRDI portal
Publication:623354
DOI10.1007/s00365-010-9105-8zbMath1210.41009OpenAlexW2136128169MaRDI QIDQ623354
Guergana Petrova, Ronald A. DeVore, Przemysław Wojtaszczyk
Publication date: 14 February 2011
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00365-010-9105-8
Related Items (24)
Neural network approximation ⋮ A Survey of Compressed Sensing ⋮ Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation ⋮ Tensor Products of Approximation Spaces Associated with Regular Elliptic Operators ⋮ Adaptive near-optimal rank tensor approximation for high-dimensional operator equations ⋮ Fast hyperbolic wavelet regression meets ANOVA ⋮ Capturing ridge functions in high dimensions from point queries ⋮ Approximation of curve-based sleeve functions in high dimensions ⋮ Complexity of approximation of functions of few variables in high dimensions ⋮ Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points ⋮ \(N\)-widths and \(\varepsilon \)-dimensions for high-dimensional approximations ⋮ Learning general sparse additive models from point queries in high dimensions ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time ⋮ On \(n\)-widths of a Sobolev function class in Orlicz spaces ⋮ Information based complexity for high dimensional sparse functions ⋮ Jointly low-rank and bisparse recovery: Questions and partial answers ⋮ Sampling schemes and recovery algorithms for functions of few coordinate variables ⋮ Approximation of generalized ridge functions in high dimensions ⋮ Sparse mixture models inspired by ANOVA decompositions ⋮ On some aspects of approximation of ridge functions ⋮ Generalization bounds for sparse random feature expansions ⋮ Interpretable Approximation of High-Dimensional Data ⋮ On two continuum armed bandit problems in high dimensions
Cites Work
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint
- Tractability of multivariate problems. Volume I: Linear information
- New bounds for perfect hashing via information theory
- Diffusion wavelets
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Compressed sensing and best 𝑘-term approximation
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- Learning juntas
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Unnamed Item
This page was built for publication: Approximation of functions of few variables in high dimensions
