Accurate low-rank matrix recovery from a small number of linear measurements. - Emmanuel J. Candès; Yaniv Plan (Allerton, 2009)

Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements - Emmanuel J. Candès; Yaniv Plan (CoRR, 2010)

Matrix Completion With Noise. - Emmanuel J. Candès; Yaniv Plan (Proc. IEEE, 2010)

Unicity conditions for low-rank matrix recovery - Yonina C. Eldar; Deanna Needell; Yaniv Plan (CoRR, 2011)

One-bit compressed sensing by linear programming - Yaniv Plan; Roman Vershynin (CoRR, 2011)

Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements. - Emmanuel J. Candès; Yaniv Plan (IEEE Trans. Inf. Theory, 2011)

A Probabilistic and RIPless Theory of Compressed Sensing. - Emmanuel J. Candès; Yaniv Plan (IEEE Trans. Inf. Theory, 2011)

One-bit compressed sensing with non-Gaussian measurements - Albert Ai; Alex Lapanowski; Yaniv Plan; Roman Vershynin (CoRR, 2012)

1-Bit Matrix Completion - Mark A. Davenport; Yaniv Plan; Ewout van den Berg; Mary Wootters (CoRR, 2012)

Lower bounds for quantized matrix completion. - Mary Wootters; Yaniv Plan; Mark A. Davenport; Ewout van den Berg (ISIT, 2013)

Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach. - Yaniv Plan; Roman Vershynin (IEEE Trans. Inf. Theory, 2013)

Dimension Reduction by Random Hyperplane Tessellations. - Yaniv Plan; Roman Vershynin (Discret. Comput. Geom., 2014)

Random mappings designed for commercial search engines. - Roger Donaldson; Arijit Gupta; Yaniv Plan; Thomas Reimer (CoRR, 2015)

On the Effective Measure of Dimension in the Analysis Cosparse Model. - Raja Giryes; Yaniv Plan; Roman Vershynin (IEEE Trans. Inf. Theory, 2015)

Average-case hardness of RIP certification. - Tengyao Wang; Quentin Berthet; Yaniv Plan (NIPS, 2016)

One-Bit Compressive Sensing of Dictionary-Sparse Signals. - Richard G. Baraniuk; Simon Foucart; Deanna Needell; Yaniv Plan; Mary Wootters (CoRR, 2016)

A simple tool for bounding the deviation of random matrices on geometric sets. - Christopher Liaw; Abbas Mehrabian; Yaniv Plan; Roman Vershynin (CoRR, 2016)

The Generalized Lasso With Non-Linear Observations. - Yaniv Plan; Roman Vershynin (IEEE Trans. Inf. Theory, 2016)

Near-optimal sample complexity for convex tensor completion. - Navid Ghadermarzy; Yaniv Plan; Özgür Yilmaz (CoRR, 2017)

Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals. - Richard G. Baraniuk; Simon Foucart; Deanna Needell; Yaniv Plan; Mary Wootters (IEEE Trans. Inf. Theory, 2017)

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. - Hassan Ashtiani; Shai Ben-David; Nicholas J. A. Harvey; Christopher Liaw; Abbas Mehrabian; Yaniv Plan (NeurIPS, 2018)

Parameter instability regimes for sparse proximal denoising programs. - Aaron Berk; Yaniv Plan; Özgür Yilmaz (CoRR, 2018)

Optimizing Quantization for Lasso Recovery. - Xiaoyi Gu; Shenyinying Tu; Hao-Jun Michael Shi; Mindy Case; Deanna Needell; Yaniv Plan (IEEE Signal Process. Lett., 2018)

Tight analyses for non-smooth stochastic gradient descent. - Nicholas J. A. Harvey; Christopher Liaw; Yaniv Plan; Sikander Randhawa (COLT, 2019)

Learning Tensors From Partial Binary Measurements. - Navid Ghadermarzy; Yaniv Plan; Özgür Yilmaz (IEEE Trans. Signal Process., 2019)

Sub-Gaussian Matrices on Sets: Optimal Tail Dependence and Applications. - Halyun Jeong; Xiaowei Li 008; Yaniv Plan; Özgür Yilmaz (CoRR, 2020)

Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. - Hassan Ashtiani; Shai Ben-David; Nicholas J. A. Harvey; Christopher Liaw; Abbas Mehrabian; Yaniv Plan (J. ACM, 2020)

PLUGIn: A simple algorithm for inverting generative models with recovery guarantees. - Babhru Joshi; Xiaowei Li 008; Yaniv Plan; Özgür Yilmaz (NeurIPS, 2021)

Beyond Independent Measurements: General Compressed Sensing with GNN Application. - Alireza Naderi; Yaniv Plan (CoRR, 2021)

Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns. - Simon Foucart; Deanna Needell; Reese Pathak; Yaniv Plan; Mary Wootters (IEEE Trans. Inf. Theory, 2021)

On the Best Choice of Lasso Program Given Data Parameters. - Aaron Berk; Yaniv Plan; Özgür Yilmaz (IEEE Trans. Inf. Theory, 2022)

NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate. - Michael P. Friedlander; Halyun Jeong; Yaniv Plan; Özgür Yilmaz (IEEE Trans. Inf. Theory, 2022)

A Coherence Parameter Characterizing Generative Compressed Sensing With Fourier Measurements. - Aaron Berk; Simone Brugiapaglia; Babhru Joshi; Yaniv Plan; Matthew Scott 003; Özgür Yilmaz (IEEE J. Sel. Areas Inf. Theory, 2022)

Sparsity-Free Compressed Sensing With Applications to Generative Priors. - Alireza Naderi; Yaniv Plan (IEEE J. Sel. Areas Inf. Theory, 2022)

Model-adapted Fourier sampling for generative compressed sensing. - Aaron Berk; Simone Brugiapaglia; Yaniv Plan; Matthew Scott 003; Xia Sheng; Özgür Yilmaz (CoRR, 2023)

Denoising guarantees for optimized sampling schemes in compressed sensing. - Yaniv Plan; Matthew Scott 003; Xia Sheng; Özgür Yilmaz (CoRR, 2025)