Approximation of functions of few variables in high dimensions
From MaRDI portal
Publication:623354
DOI10.1007/s00365-010-9105-8zbMath1210.41009MaRDI 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
Interpretable Approximation of High-Dimensional Data, Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation, Jointly low-rank and bisparse recovery: Questions and partial answers, Neural network approximation, Fast hyperbolic wavelet regression meets ANOVA, Approximation of curve-based sleeve functions in high dimensions, On two continuum armed bandit problems in high dimensions, On \(n\)-widths of a Sobolev function class in Orlicz spaces, Adaptive near-optimal rank tensor approximation for high-dimensional operator equations, 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, Sparse mixture models inspired by ANOVA decompositions, Generalization bounds for sparse random feature expansions, Information based complexity for high dimensional sparse functions, Sampling schemes and recovery algorithms for functions of few coordinate variables, Approximation of generalized ridge functions in high dimensions, On some aspects of approximation of ridge functions, Capturing ridge functions in high dimensions from point queries, Complexity of approximation of functions of few variables in high dimensions, \(N\)-widths and \(\varepsilon \)-dimensions for high-dimensional approximations, Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points, Tensor Products of Approximation Spaces Associated with Regular Elliptic Operators, A Survey of Compressed Sensing
Cites Work
- Unnamed Item
- 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
