Complexity of approximation of functions of few variables in high dimensions
From MaRDI portal
Publication:2431335
DOI10.1016/J.JCO.2011.01.004zbMATH Open1343.65015OpenAlexW1996674925MaRDI QIDQ2431335FDOQ2431335
Authors: P. Wojtaszczyk 
Publication date: 13 April 2011
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2011.01.004
Recommendations
- Approximation of functions of few variables in high dimensions
- ``Curse of dimensionality for complexity of approximation for classes of functions satisfying Lipschitz condition
- Capturing ridge functions in high dimensions from point queries
- Learning functions of few arbitrary linear parameters in high dimensions
- Liberating the dimension for function approximation: standard information
Complexity and performance of numerical algorithms (65Y20) Algorithms for approximation of functions (65D15)
Cites Work
- Diffusion wavelets
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Families of \(k\)-independent sets
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Learning juntas
- Learning functions of few arbitrary linear parameters in high dimensions
- Approximation of functions of few variables in high dimensions
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint
- Tractability of multivariate problems. Volume I: Linear information
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- Capturing ridge functions in high dimensions from point queries
- Finite-order weights imply tractability of linear multivariate problems
- On the power of adaption
- Sperner capacities
- New bounds for perfect hashing via information theory
- On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective
Cited In (13)
- On some aspects of approximation of ridge functions
- Learning functions of few arbitrary linear parameters in high dimensions
- Approximation of functions of few variables in high dimensions
- Sampling schemes and recovery algorithms for functions of few coordinate variables
- On ``freezing of unessential variables
- Title not available (Why is that?)
- On \(n\)-widths of a Sobolev function class in Orlicz spaces
- \(N\)-widths and \(\varepsilon \)-dimensions for high-dimensional approximations
- Title not available (Why is that?)
- A survey of compressed sensing
- Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points
- Information based complexity for high dimensional sparse functions
- ``Curse of dimensionality for complexity of approximation for classes of functions satisfying Lipschitz condition
This page was built for publication: Complexity of approximation of functions of few variables in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431335)
