Yaniv Plan

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 32

Top Topics

Compression Scheme

Compressed Sensing

Sample Complexity Bounds

Top Venues

IEEE Trans. Inf. Theory

IEEE J. Sel. Areas Inf. Theory

Publications

Aaron Berk, Simone Brugiapaglia, Yaniv Plan, Matthew Scott, Xia Sheng, Özgür Yilmaz
Model-adapted Fourier sampling for generative compressed sensing. CoRR (2023)
Aaron Berk, Simone Brugiapaglia, Babhru Joshi, Yaniv Plan, Matthew Scott, Özgür Yilmaz
A Coherence Parameter Characterizing Generative Compressed Sensing With Fourier Measurements. IEEE J. Sel. Areas Inf. Theory 3 (3) (2022)
Alireza Naderi, Yaniv Plan
Sparsity-Free Compressed Sensing With Applications to Generative Priors. IEEE J. Sel. Areas Inf. Theory 3 (3) (2022)
Aaron Berk, Simone Brugiapaglia, Babhru Joshi, Yaniv Plan, Matthew Scott, Özgür Yilmaz
A coherence parameter characterizing generative compressed sensing with Fourier measurements. CoRR (2022)
Michael P. Friedlander, Halyun Jeong, Yaniv Plan, Özgür Yilmaz
NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate. IEEE Trans. Inf. Theory 68 (2) (2022)
Aaron Berk, Yaniv Plan, Özgür Yilmaz
On the Best Choice of Lasso Program Given Data Parameters. IEEE Trans. Inf. Theory 68 (4) (2022)
Babhru Joshi, Xiaowei Li, Yaniv Plan, Özgür Yilmaz
PLUGIn: A simple algorithm for inverting generative models with recovery guarantees. NeurIPS (2021)
Alireza Naderi, Yaniv Plan
Beyond Independent Measurements: General Compressed Sensing with GNN Application. CoRR (2021)
Simon Foucart, Deanna Needell, Reese Pathak, Yaniv Plan, Mary Wootters
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns. IEEE Trans. Inf. Theory 67 (2) (2021)
Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. J. ACM 67 (6) (2020)
Halyun Jeong, Xiaowei Li, Yaniv Plan, Özgür Yilmaz
Sub-Gaussian Matrices on Sets: Optimal Tail Dependence and Applications. CoRR (2020)
Aaron Berk, Yaniv Plan, Özgür Yilmaz
On the best choice of Lasso program given data parameters. CoRR (2020)
Michael P. Friedlander, Halyun Jeong, Yaniv Plan, Özgür Yilmaz
NBIHT: An Efficient Algorithm for 1-bit Compressed Sensing with Optimal Error Decay Rate. CoRR (2020)
Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa
Tight analyses for non-smooth stochastic gradient descent. COLT (2019)
Navid Ghadermarzy, Yaniv Plan, Özgür Yilmaz
Learning Tensors From Partial Binary Measurements. IEEE Trans. Signal Process. 67 (1) (2019)
Simon Foucart, Deanna Needell, Reese Pathak, Yaniv Plan, Mary Wootters
Weighted matrix completion from non-random, non-uniform sampling patterns. CoRR (2019)
Xiaoyi Gu, Shenyinying Tu, Hao-Jun Michael Shi, Mindy Case, Deanna Needell, Yaniv Plan
Optimizing Quantization for Lasso Recovery. IEEE Signal Process. Lett. 25 (1) (2018)
Navid Ghadermarzy, Yaniv Plan, Özgür Yilmaz
Learning tensors from partial binary measurements. CoRR (2018)
Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa
Tight Analyses for Non-Smooth Stochastic Gradient Descent. CoRR (2018)
Aaron Berk, Yaniv Plan, Özgür Yilmaz
Parameter instability regimes for sparse proximal denoising programs. CoRR (2018)
Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. NeurIPS (2018)
Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals. IEEE Trans. Inf. Theory 63 (6) (2017)
Navid Ghadermarzy, Yaniv Plan, Özgür Yilmaz
Near-optimal sample complexity for convex tensor completion. CoRR (2017)
Xiaoyi Gu, Shenyinying Tu, Hao-Jun Michael Shi, Mindy Case, Deanna Needell, Yaniv Plan
Optimizing quantization for Lasso recovery. CoRR (2016)
Yaniv Plan, Roman Vershynin
The Generalized Lasso With Non-Linear Observations. IEEE Trans. Inf. Theory 62 (3) (2016)
Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters
One-Bit Compressive Sensing of Dictionary-Sparse Signals. CoRR (2016)
Christopher Liaw, Abbas Mehrabian, Yaniv Plan, Roman Vershynin
A simple tool for bounding the deviation of random matrices on geometric sets. CoRR (2016)
Tengyao Wang, Quentin Berthet, Yaniv Plan
Average-case Hardness of RIP Certification. CoRR (2016)
Tengyao Wang, Quentin Berthet, Yaniv Plan
Average-case hardness of RIP certification. NIPS (2016)
Yaniv Plan, Roman Vershynin
The generalized Lasso with non-linear observations. CoRR (2015)
Raja Giryes, Yaniv Plan, Roman Vershynin
On the Effective Measure of Dimension in the Analysis Cosparse Model. IEEE Trans. Inf. Theory 61 (10) (2015)
Roger Donaldson, Arijit Gupta, Yaniv Plan, Thomas Reimer
Random mappings designed for commercial search engines. CoRR (2015)
Raja Giryes, Yaniv Plan, Roman Vershynin
On the Effective Measure of Dimension in the Analysis Cosparse Model. CoRR (2014)
Yaniv Plan, Roman Vershynin
Dimension Reduction by Random Hyperplane Tessellations. Discret. Comput. Geom. 51 (2) (2014)
Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters
Exponential decay of reconstruction error from binary measurements of sparse signals. CoRR (2014)
Yaniv Plan, Roman Vershynin
Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach. IEEE Trans. Inf. Theory 59 (1) (2013)
Mary Wootters, Yaniv Plan, Mark A. Davenport, Ewout van den Berg
Lower bounds for quantized matrix completion. ISIT (2013)
Albert Ai, Alex Lapanowski, Yaniv Plan, Roman Vershynin
One-bit compressed sensing with non-Gaussian measurements CoRR (2012)
Mark A. Davenport, Yaniv Plan, Ewout van den Berg, Mary Wootters
1-Bit Matrix Completion CoRR (2012)
Yaniv Plan, Roman Vershynin
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach CoRR (2012)
Yonina C. Eldar, Deanna Needell, Yaniv Plan
Unicity conditions for low-rank matrix recovery CoRR (2011)
Yaniv Plan, Roman Vershynin
One-bit compressed sensing by linear programming CoRR (2011)
Emmanuel J. Candès, Yaniv Plan
Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements. IEEE Trans. Inf. Theory 57 (4) (2011)
Emmanuel J. Candès, Yaniv Plan
A Probabilistic and RIPless Theory of Compressed Sensing. IEEE Trans. Inf. Theory 57 (11) (2011)
Emmanuel J. Candès, Yaniv Plan
A probabilistic and RIPless theory of compressed sensing CoRR (2010)
Emmanuel J. Candès, Yaniv Plan
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements CoRR (2010)
Emmanuel J. Candès, Yaniv Plan
Matrix Completion With Noise. Proc. IEEE 98 (6) (2010)
Emmanuel J. Candès, Yaniv Plan
Accurate low-rank matrix recovery from a small number of linear measurements. Allerton (2009)
Emmanuel J. Candès, Yaniv Plan
Matrix Completion With Noise CoRR (2009)
Emmanuel J. Candès, Yaniv Plan
Accurate low-rank matrix recovery from a small number of linear measurements CoRR (2009)