The following pages link to Lower Bounds for Sparse Recovery (Q5417699):
Displaying 23 items.
- On exact recovery of sparse vectors from linear measurements (Q382361) (← links)
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\) (Q609740) (← links)
- Bessel sequences of exponentials on fractal measures (Q647579) (← links)
- Fundamental barriers to high-dimensional regression with convex penalties (Q2119224) (← links)
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement (Q2251573) (← links)
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
- Approximate sparse recovery: optimizing time and measurements (Q2903525) (← links)
- Sparse Recovery With Graph Constraints (Q2978787) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Sparse Recovery with Partial Support Knowledge (Q3088079) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Taylor Polynomial Estimator for Estimating Frequency Moments (Q3448814) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Computable Performance Bounds on Sparse Recovery (Q4579665) (← links)
- Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery (Q4620895) (← links)
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting (Q4974108) (← links)
- Improved Algorithms for Adaptive Compressed Sensing (Q5002771) (← links)
- Tensor Regression Using Low-Rank and Sparse Tucker Decompositions (Q5037550) (← links)
- Querying a Matrix Through Matrix-Vector Products. (Q5091255) (← links)
- Efficient Least Residual Greedy Algorithms for Sparse Recovery (Q5102914) (← links)
- On the Fundamental Limits of Recovering Tree Sparse Vectors From Noisy Linear Measurements (Q5346147) (← links)
- (Q5743471) (← links)
- Randomized approximation of summable sequences -- adaptive and non-adaptive (Q6632941) (← links)
