Sampling schemes and recovery algorithms for functions of few coordinate variables
From MaRDI portal
Publication:2307488
Recommendations
- Approximation of functions of few variables in high dimensions
- Learning functions of few arbitrary linear parameters in high dimensions
- Complexity of approximation of functions of few variables in high dimensions
- Learning general sparse additive models from point queries in high dimensions
- Infinite-dimensional compressed sensing and function interpolation
Cites work
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- A Sequential Method for Screening Experimental Variables
- A mathematical introduction to compressive sensing
- Approximation of functions of few variables in high dimensions
- Bounds on the rate of disjunctive codes
- Complexity of approximation of functions of few variables in high dimensions
- Deterministic constructions of compressed sensing matrices
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Information based complexity for high dimensional sparse functions
- Jointly low-rank and bisparse recovery: questions and partial answers
- Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms
- On r-cover-free families
- Robust sparse phase retrieval made easy
Cited in
(7)- Groebner basis methods for multichannel sampling with unknown offsets
- Jointly low-rank and bisparse recovery: questions and partial answers
- Recovery of Surfaces and Functions in High Dimensions: Sampling Theory and Links to Neural Networks
- Active Sampling for Multiple Output Identification
- scientific article; zbMATH DE number 61069 (Why is no real title available?)
- Active sampling for multiple output identification
- Worst-case recovery guarantees for least squares approximation using random samples
This page was built for publication: Sampling schemes and recovery algorithms for functions of few coordinate variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307488)