The following pages link to Yaniv Plan (Q661169):
Displayed 26 items.
- (Q442533) (redirect page) (← links)
- Uniqueness conditions for low-rank matrix recovery (Q442534) (← links)
- Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism (Q661170) (← links)
- Near-ideal model selection by \(\ell _{1}\) minimization (Q834335) (← links)
- Dimension reduction by random hyperplane tessellations (Q2250053) (← links)
- One-bit compressed sensing with non-Gaussian measurements (Q2437341) (← links)
- One-Bit Compressed Sensing by Linear Programming (Q2841676) (← links)
- The Generalized Lasso With Non-Linear Observations (Q2976986) (← links)
- On the Effective Measure of Dimension in the Analysis Cosparse Model (Q2977253) (← links)
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach (Q2989476) (← links)
- High-dimensional estimation with geometric constraints: Table 1. (Q4603716) (← links)
- Learning Tensors From Partial Binary Measurements (Q4628162) (← links)
- Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns (Q4963966) (← links)
- Near-optimal sample complexity for convex tensor completion (Q5006503) (← links)
- NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate (Q5030352) (← links)
- <scp>Sub‐Gaussian</scp> Matrices on Sets: Optimal Tail Dependence and Applications (Q5043753) (← links)
- Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes (Q5056446) (← links)
- On the Best Choice of Lasso Program Given Data Parameters (Q5088405) (← links)
- Sensitivity of ℓ1 minimization to parameter choice (Q5155951) (← links)
- 1-Bit matrix completion (Q5177868) (← links)
- One-bit compressive sensing of dictionary-sparse signals (Q5229762) (← links)
- A Probabilistic and RIPless Theory of Compressed Sensing (Q5272230) (← links)
- A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets (Q5278301) (← links)
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements (Q5280996) (← links)
- A coherence parameter characterizing generative compressed sensing with Fourier measurements (Q6405456) (← links)
- Model-adapted Fourier sampling for generative compressed sensing (Q6454217) (← links)