Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
From MaRDI portal
Publication:722765
DOI10.1016/j.jco.2018.05.003zbMath1470.41025arXiv1702.06781OpenAlexW2592060370MaRDI QIDQ722765
Publication date: 27 July 2018
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.06781
Gelfand numbers\(\ell_p(\ell_q)\)-spacesBesov spaces with small mixed smoothnessBlock sparsityCompressed sensingSparsity-in-levels
Sobolev spaces and other spaces of ``smooth functions, embedding theorems, trace theorems (46E35) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items (7)
The restricted isometry property of block diagonal matrices for group-sparse signal recovery ⋮ Entropy numbers of finite dimensional mixed-norm balls and function space embeddings with small mixed smoothness ⋮ Optimal sampling recovery of mixed order Sobolev embeddings via discrete {L}ittlewood--{P}aley type characterizations ⋮ Sampling numbers of smoothness classes via \(\ell^1\)-minimization ⋮ Kolmogorov widths of the intersection of two finite-dimensional balls in a mixed norm ⋮ Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness ⋮ Gelfand numbers of embeddings of Schatten classes
Cites Work
- Carl's inequality for quasi-Banach spaces
- A mathematical introduction to compressive sensing
- Learning functions of few arbitrary linear parameters in high dimensions
- Best \(m\)-term approximation and Sobolev-Besov spaces of dominating mixed smoothness -- the case of compact embeddings
- Weyl numbers of embeddings of tensor product Besov spaces
- Statistics for high-dimensional data. Methods, theory and applications.
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Oracle inequalities and optimal inference under group sparsity
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- Uniform recovery of fusion frame structured sparse signals
- Entropy and sampling numbers of classes of ridge functions
- Widths of embeddings in function spaces
- The benefit of group sparsity
- Linear widths of Hölder-Nikol'skij classes of periodic functions of several variables
- Widths of Hölder-Nikol'skij classes and finite-dimensional subsets in spaces with mixed norm
- Optimal sampling recovery of mixed order Sobolev embeddings via discrete {L}ittlewood--{P}aley type characterizations
- Kolmogorov widths in finite-dimensional spaces with mixed norms
- Gelfand numbers and widths
- Kolmogorov and linear widths of the weighted Besov classes with singularity at the origin
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Constructive sparse trigonometric approximation for functions with small mixed smoothness
- Gelfand numbers of embeddings of mixed Besov spaces
- The product of octahedra is badly approximated in the \(\ell_{2,1}\)-metric
- Capturing ridge functions in high dimensions from point queries
- The Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative
- One-Bit Compressed Sensing by Linear Programming
- Optimization with Sparsity-Inducing Penalties
- Counting Via Entropy: New Preasymptotics for the Approximation Numbers of Sobolev Embeddings
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Robust Recovery of Signals From a Structured Union of Subspaces
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Function spaces with dominating mixed smoothness
- Stable signal recovery from incomplete and inaccurate measurements
- Locally bounded linear topological spaces
- Compressed sensing
- A lower estimate for entropy numbers
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
