Complexity of approximation of functions of few variables in high dimensions
From MaRDI portal
Publication:2431335
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
Cites work
- Approximation of functions of few variables in high dimensions
- Best subset selection, persistence in high-dimensional statistical learning and optimization under l₁ constraint
- Capturing ridge functions in high dimensions from point queries
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- Diffusion wavelets
- Families of \(k\)-independent sets
- Finite-order weights imply tractability of linear multivariate problems
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning functions of few arbitrary linear parameters in high dimensions
- Learning juntas
- New bounds for perfect hashing via information theory
- On sets of Boolean n-vectors with all k-projections surjective
- On the Size of Separating Systems and Families of Perfect Hash Functions
- On the power of adaption
- Sperner capacities
- Stable signal recovery from incomplete and inaccurate measurements
- Tractability of multivariate problems. Volume I: Linear information
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
- On n-widths of a Sobolev function class in Orlicz spaces
- scientific article; zbMATH DE number 4057841 (Why is no real title available?)
- \(N\)-widths and \(\varepsilon \)-dimensions for high-dimensional approximations
- scientific article; zbMATH DE number 2079345 (Why is no real title available?)
- 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)
