Yaniv Plan - RankMe

53 papers A* 3B 1Journal 47Unranked 2

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