default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaniv Plan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i28]Aaron Berk, Simone Brugiapaglia, Yaniv Plan, Matthew Scott, Xia Sheng, Özgür Yilmaz:
Model-adapted Fourier sampling for generative compressed sensing. CoRR abs/2310.04984 (2023)- 2022
- [j16]Alireza Naderi
, Yaniv Plan:
Sparsity-Free Compressed Sensing With Applications to Generative Priors. IEEE J. Sel. Areas Inf. Theory 3(3): 493-501 (2022) - [j15]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): 502-512 (2022) - [j14]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): 1157-1177 (2022) - [j13]Aaron Berk, Yaniv Plan, Özgür Yilmaz:
On the Best Choice of Lasso Program Given Data Parameters. IEEE Trans. Inf. Theory 68(4): 2573-2603 (2022) - [i27]Aaron Berk, Simone Brugiapaglia, Babhru Joshi, Yaniv Plan, Matthew Scott, Özgür Yilmaz:
A coherence parameter characterizing generative compressed sensing with Fourier measurements. CoRR abs/2207.09340 (2022) - 2021
- [j12]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): 1264-1290 (2021) - [c6]Babhru Joshi, Xiaowei Li, Yaniv Plan, Özgür Yilmaz:
PLUGIn: A simple algorithm for inverting generative models with recovery guarantees. NeurIPS 2021: 24719-24729 - [i26]Alireza Naderi, Yaniv Plan:
Beyond Independent Measurements: General Compressed Sensing with GNN Application. CoRR abs/2111.00327 (2021) - 2020
- [j11]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): 32:1-32:42 (2020) - [i25]Halyun Jeong, Xiaowei Li, Yaniv Plan, Özgür Yilmaz:
Sub-Gaussian Matrices on Sets: Optimal Tail Dependence and Applications. CoRR abs/2001.10631 (2020) - [i24]Aaron Berk, Yaniv Plan, Özgür Yilmaz:
On the best choice of Lasso program given data parameters. CoRR abs/2010.08884 (2020) - [i23]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 abs/2012.12886 (2020)
2010 – 2019
- 2019
- [j10]Navid Ghadermarzy, Yaniv Plan, Özgür Yilmaz:
Learning Tensors From Partial Binary Measurements. IEEE Trans. Signal Process. 67(1): 29-40 (2019) - [c5]Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa:
Tight analyses for non-smooth stochastic gradient descent. COLT 2019: 1579-1613 - [i22]Simon Foucart, Deanna Needell, Reese Pathak, Yaniv Plan, Mary Wootters:
Weighted matrix completion from non-random, non-uniform sampling patterns. CoRR abs/1910.13986 (2019) - 2018
- [j9]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): 45-49 (2018) - [c4]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: 3416-3425 - [i21]Navid Ghadermarzy, Yaniv Plan, Özgür Yilmaz:
Learning tensors from partial binary measurements. CoRR abs/1804.00108 (2018) - [i20]Aaron Berk, Yaniv Plan, Özgür Yilmaz:
Parameter instability regimes for sparse proximal denoising programs. CoRR abs/1810.11968 (2018) - [i19]Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa:
Tight Analyses for Non-Smooth Stochastic Gradient Descent. CoRR abs/1812.05217 (2018) - 2017
- [j8]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): 3368-3385 (2017) - [i18]Navid Ghadermarzy, Yaniv Plan, Özgür Yilmaz:
Near-optimal sample complexity for convex tensor completion. CoRR abs/1711.04965 (2017) - 2016
- [j7]Yaniv Plan, Roman Vershynin:
The Generalized Lasso With Non-Linear Observations. IEEE Trans. Inf. Theory 62(3): 1528-1537 (2016) - [c3]Tengyao Wang, Quentin Berthet, Yaniv Plan:
Average-case hardness of RIP certification. NIPS 2016: 3819-3827 - [i17]Christopher Liaw, Abbas Mehrabian, Yaniv Plan, Roman Vershynin:
A simple tool for bounding the deviation of random matrices on geometric sets. CoRR abs/1603.00897 (2016) - [i16]Tengyao Wang, Quentin Berthet, Yaniv Plan:
Average-case Hardness of RIP Certification. CoRR abs/1605.09646 (2016) - [i15]Xiaoyi Gu, Shenyinying Tu, Hao-Jun Michael Shi, Mindy Case, Deanna Needell, Yaniv Plan:
Optimizing quantization for Lasso recovery. CoRR abs/1606.03055 (2016) - [i14]Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters:
One-Bit Compressive Sensing of Dictionary-Sparse Signals. CoRR abs/1606.07531 (2016) - 2015
- [j6]Raja Giryes, Yaniv Plan, Roman Vershynin:
On the Effective Measure of Dimension in the Analysis Cosparse Model. IEEE Trans. Inf. Theory 61(10): 5745-5753 (2015) - [i13]Yaniv Plan, Roman Vershynin:
The generalized Lasso with non-linear observations. CoRR abs/1502.04071 (2015) - [i12]Roger Donaldson, Arijit Gupta, Yaniv Plan, Thomas Reimer:
Random mappings designed for commercial search engines. CoRR abs/1507.05929 (2015) - 2014
- [j5]Yaniv Plan, Roman Vershynin:
Dimension Reduction by Random Hyperplane Tessellations. Discret. Comput. Geom. 51(2): 438-461 (2014) - [i11]Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters:
Exponential decay of reconstruction error from binary measurements of sparse signals. CoRR abs/1407.8246 (2014) - [i10]Raja Giryes, Yaniv Plan, Roman Vershynin:
On the Effective Measure of Dimension in the Analysis Cosparse Model. CoRR abs/1410.0989 (2014) - 2013
- [j4]Yaniv Plan, Roman Vershynin:
Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach. IEEE Trans. Inf. Theory 59(1): 482-494 (2013) - [c2]Mary Wootters, Yaniv Plan, Mark A. Davenport, Ewout van den Berg:
Lower bounds for quantized matrix completion. ISIT 2013: 296-300 - 2012
- [i9]Yaniv Plan, Roman Vershynin:
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach. CoRR abs/1202.1212 (2012) - [i8]Albert Ai, Alex Lapanowski, Yaniv Plan, Roman Vershynin:
One-bit compressed sensing with non-Gaussian measurements. CoRR abs/1208.6279 (2012) - [i7]Mark A. Davenport, Yaniv Plan, Ewout van den Berg, Mary Wootters:
1-Bit Matrix Completion. CoRR abs/1209.3672 (2012) - 2011
- [j3]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): 2342-2359 (2011) - [j2]Emmanuel J. Candès, Yaniv Plan:
A Probabilistic and RIPless Theory of Compressed Sensing. IEEE Trans. Inf. Theory 57(11): 7235-7254 (2011) - [i6]Yonina C. Eldar, Deanna Needell, Yaniv Plan:
Unicity conditions for low-rank matrix recovery. CoRR abs/1103.5479 (2011) - [i5]Yaniv Plan, Roman Vershynin:
One-bit compressed sensing by linear programming. CoRR abs/1109.4299 (2011) - 2010
- [j1]Emmanuel J. Candès, Yaniv Plan:
Matrix Completion With Noise. Proc. IEEE 98(6): 925-936 (2010) - [i4]Emmanuel J. Candès, Yaniv Plan:
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements. CoRR abs/1001.0339 (2010) - [i3]Emmanuel J. Candès, Yaniv Plan:
A probabilistic and RIPless theory of compressed sensing. CoRR abs/1011.3854 (2010)
2000 – 2009
- 2009
- [c1]Emmanuel J. Candès, Yaniv Plan:
Accurate low-rank matrix recovery from a small number of linear measurements. Allerton 2009: 1223-1230 - [i2]Emmanuel J. Candès, Yaniv Plan:
Matrix Completion With Noise. CoRR abs/0903.3131 (2009) - [i1]Emmanuel J. Candès, Yaniv Plan:
Accurate low-rank matrix recovery from a small number of linear measurements. CoRR abs/0910.0413 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
