Roman Vershynin

According to our database, Roman Vershynin authored at least 54 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Covariance's Loss is Privacy's Gain: Computationally Efficient, Private and Accurate Synthetic Data.

March Boedihardjo, Thomas Strohmer, Roman Vershynin

Found. Comput. Math., February, 2024

Online Differentially Private Synthetic Data Generation.

Yiyun He, Roman Vershynin, Yizhe Zhu

CoRR, 2024

An Algorithm for Streaming Differentially Private Data.

Girish Kumar, Thomas Strohmer, Roman Vershynin

CoRR, 2024

2023

The quarks of attention: Structure and capacity of neural attention building blocks.

Pierre Baldi, Roman Vershynin

Artif. Intell., June, 2023

AVIDA: An alternating method for visualizing and integrating data.

Kathryn Dover, Zixuan Cang, Anna Ma, Qing Nie, Roman Vershynin

J. Comput. Sci., April, 2023

Privacy of Synthetic Data: A Statistical Framework.

March Boedihardjo, Thomas Strohmer, Roman Vershynin

IEEE Trans. Inf. Theory, 2023

Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrieval.

Yan Shuo Tan, Roman Vershynin

J. Mach. Learn. Res., 2023

Differentially private low-dimensional representation of high-dimensional data.

Yiyun He, Thomas Strohmer, Roman Vershynin, Yizhe Zhu

CoRR, 2023

Covariance loss, Szemeredi regularity, and differential privacy.

March Boedihardjo, Thomas Strohmer, Roman Vershynin

CoRR, 2023

Algorithmically Effective Differentially Private Synthetic Data.

Yiyun He, Roman Vershynin, Yizhe Zhu

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Private Sampling: A Noiseless Approach for Generating Differentially Private Synthetic Data.

March Boedihardjo, Thomas Strohmer, Roman Vershynin

SIAM J. Math. Data Sci., September, 2022

AVIDA: Alternating method for Visualizing and Integrating Data.

Kathryn Dover, Zixuan Cang, Anna Ma, Qing Nie, Roman Vershynin

CoRR, 2022

Private measures, random walks, and synthetic data.

March Boedihardjo, Thomas Strohmer, Roman Vershynin

CoRR, 2022

The Quarks of Attention.

Pierre Baldi, Roman Vershynin

CoRR, 2022

2021

A theory of capacity and sparse neural encoding.

Pierre Baldi, Roman Vershynin

Neural Networks, 2021

2020

Memory Capacity of Neural Networks with Threshold and Rectified Linear Unit Activations.

Roman Vershynin

SIAM J. Math. Data Sci., 2020

Memory capacity of neural networks with threshold and ReLU activations.

Roman Vershynin

CoRR, 2020

2019

Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors.

Pierre Baldi, Roman Vershynin

SIAM J. Math. Data Sci., 2019

The capacity of feedforward neural networks.

Pierre Baldi, Roman Vershynin

Neural Networks, 2019

2018

Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization.

Jess Banks, Cristopher Moore, Roman Vershynin, Nicolas Verzelen, Jiaming Xu

IEEE Trans. Inf. Theory, 2018

On Neuronal Capacity.

Pierre Baldi, Roman Vershynin

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods.

Yan Shuo Tan, Roman Vershynin

Proceedings of the Conference On Learning Theory, 2018

2017

Concentration and regularization of random graphs.

Can M. Le, Elizaveta Levina, Roman Vershynin

Random Struct. Algorithms, 2017

Phase Retrieval via Randomized Kaczmarz: Theoretical Guarantees.

Yan Shuo Tan, Roman Vershynin

CoRR, 2017

2016

The Generalized Lasso With Non-Linear Observations.

Yaniv Plan, Roman Vershynin

IEEE Trans. Inf. Theory, 2016

Four lectures on probabilistic methods for data science.

Roman Vershynin

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

Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization.

Jess Banks, Cristopher Moore, Roman Vershynin, Jiaming Xu

CoRR, 2016

2015

On the Effective Measure of Dimension in the Analysis Cosparse Model.

Raja Giryes, Yaniv Plan, Roman Vershynin

IEEE Trans. Inf. Theory, 2015

Concentration and regularization of random graphs.

Can M. Le, Roman Vershynin

CoRR, 2015

Sparse random graphs: regularization and concentration of the Laplacian.

Can M. Le, Elizaveta Levina, Roman Vershynin

CoRR, 2015

2014

Invertibility of symmetric random matrices.

Roman Vershynin

Random Struct. Algorithms, 2014

Dimension Reduction by Random Hyperplane Tessellations.

Yaniv Plan, Roman Vershynin

Discret. Comput. Geom., 2014

Optimization via Low-rank Approximation, with Applications to Community Detection in Networks.

Can M. Le, Elizaveta Levina, Roman Vershynin

CoRR, 2014

Community detection in sparse networks via Grothendieck's inequality.

Olivier Guédon, Roman Vershynin

CoRR, 2014

2013

Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach.

Yaniv Plan, Roman Vershynin

IEEE Trans. Inf. Theory, 2013

2012

One-bit compressed sensing with non-Gaussian measurements

Albert Ai, Alex Lapanowski, Yaniv Plan, Roman Vershynin

CoRR, 2012

Introduction to the non-asymptotic analysis of random matrices.

Roman Vershynin

Proceedings of the Compressed Sensing, 2012

2011

One-bit compressed sensing by linear programming

Yaniv Plan, Roman Vershynin

CoRR, 2011

2010

Uncertainty principles and vector quantization.

Yurii Lyubarskii, Roman Vershynin

IEEE Trans. Inf. Theory, 2010

Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit.

Deanna Needell, Roman Vershynin

IEEE J. Sel. Top. Signal Process., 2010

Introduction to the non-asymptotic analysis of random matrices

Roman Vershynin

CoRR, 2010

2009

Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method.

Roman Vershynin

SIAM J. Comput., 2009

Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit.

Deanna Needell, Roman Vershynin

Found. Comput. Math., 2009

2008

Greedy signal recovery and uncertainty principles.

Deanna Needell, Roman Vershynin

Proceedings of the Computational Imaging VI, 2008

Greedy signal recovery review.

Deanna Needell, Joel A. Tropp, Roman Vershynin

Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

2007

Sampling from large matrices: An approach through geometric functional analysis.

Mark Rudelson, Roman Vershynin

J. ACM, 2007

Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms

Roman Vershynin

CoRR, 2007

One sketch for all: fast algorithms for compressed sensing.

Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

Algorithmic linear dimension reduction in the l_1 norm for sparse vectors

Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin

CoRR, 2006

Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements.

Mark Rudelson, Roman Vershynin

Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

A Randomized Solver for Linear Systems with Exponential Convergence.

Thomas Strohmer, Roman Vershynin

Proceedings of the Approximation, 2006

2005

Error Correction via Linear Programming.

Emmanuel J. Candès, Mark Rudelson, Terence Tao, Roman Vershynin

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2002

Entropy, Combinatorial Dimensions and Random Averages.

Shahar Mendelson, Roman Vershynin

Proceedings of the Computational Learning Theory, 2002