Y. Plan

From MaRDI portal
(Redirected from Person:442533)
Person:661169

Available identifiers

zbMath Open plan.yanivWikidataQ102404015 ScholiaQ102404015MaRDI QIDQ661169

List of research outcomes





PublicationDate of PublicationType
Model-adapted Fourier sampling for generative compressed sensing2023-10-07Paper
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes2022-12-08Paper
Sub-Gaussian matrices on sets: optimal tail dependence and applications2022-10-06Paper
A coherence parameter characterizing generative compressed sensing with Fourier measurements2022-07-19Paper
On the Best Choice of Lasso Program Given Data Parameters2022-07-13Paper
NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate2022-02-17Paper
Sensitivity of \(\ell_1\) minimization to parameter choice2021-10-13Paper
Near-optimal sample complexity for convex tensor completion2021-08-16Paper
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns2021-02-24Paper
One-bit compressive sensing of dictionary-sparse signals2019-08-19Paper
Learning Tensors From Partial Binary Measurements2019-03-06Paper
High-dimensional estimation with geometric constraints2018-02-19Paper
Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements2017-07-27Paper
A simple tool for bounding the deviation of random matrices on geometric sets2017-07-13Paper
A Probabilistic and RIPless Theory of Compressed Sensing2017-07-12Paper
Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach2017-06-08Paper
The Generalized Lasso With Non-Linear Observations2017-04-28Paper
On the Effective Measure of Dimension in the Analysis Cosparse Model2017-04-28Paper
1-bit matrix completion2015-03-06Paper
Dimension reduction by random hyperplane tessellations2014-07-04Paper
One-bit compressed sensing with non-Gaussian measurements2014-03-03Paper
One-bit compressed sensing by linear programming2013-07-26Paper
Uniqueness conditions for low-rank matrix recovery2012-08-01Paper
Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism2012-02-21Paper
Near-ideal model selection by \(\ell _{1}\) minimization2009-08-19Paper

Research outcomes over time

This page was built for person: Y. Plan