Roman Vershynin

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 38

Top Topics

Memory Capacity

Differentially Private

Top Venues

IEEE Trans. Inf. Theory

SIAM J. Math. Data Sci.

Random Struct. Algorithms

Publications

March Boedihardjo, Thomas Strohmer, Roman Vershynin
Metric geometry of the privacy-utility tradeoff. CoRR (2024)
Girish Kumar, Thomas Strohmer, Roman Vershynin
An Algorithm for Streaming Differentially Private Data. CoRR (2024)
Yiyun He, Roman Vershynin, Yizhe Zhu
Online Differentially Private Synthetic Data Generation. CoRR (2024)
March Boedihardjo, Thomas Strohmer, Roman Vershynin
Covariance's Loss is Privacy's Gain: Computationally Efficient, Private and Accurate Synthetic Data. Found. Comput. Math. 24 (1) (2024)
Yiyun He, Roman Vershynin, Yizhe Zhu
Algorithmically Effective Differentially Private Synthetic Data. CoRR (2023)
Yan Shuo Tan, Roman Vershynin
Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrieval. J. Mach. Learn. Res. 24 (2023)
Kathryn Dover, Zixuan Cang, Anna Ma, Qing Nie, Roman Vershynin
AVIDA: An alternating method for visualizing and integrating data. J. Comput. Sci. 68 (2023)
Yiyun He, Thomas Strohmer, Roman Vershynin, Yizhe Zhu
Differentially private low-dimensional representation of high-dimensional data. CoRR (2023)
Yiyun He, Roman Vershynin, Yizhe Zhu
Algorithmically Effective Differentially Private Synthetic Data. COLT (2023)
March Boedihardjo, Thomas Strohmer, Roman Vershynin
Covariance loss, Szemeredi regularity, and differential privacy. CoRR (2023)
Pierre Baldi, Roman Vershynin
The quarks of attention: Structure and capacity of neural attention building blocks. Artif. Intell. 319 (2023)
March Boedihardjo, Thomas Strohmer, Roman Vershynin
Privacy of Synthetic Data: A Statistical Framework. IEEE Trans. Inf. Theory 69 (1) (2023)
Kathryn Dover, Zixuan Cang, Anna Ma, Qing Nie, Roman Vershynin
AVIDA: Alternating method for Visualizing and Integrating Data. CoRR (2022)
March Boedihardjo, Thomas Strohmer, Roman Vershynin
Private Sampling: A Noiseless Approach for Generating Differentially Private Synthetic Data. SIAM J. Math. Data Sci. 4 (3) (2022)
March Boedihardjo, Thomas Strohmer, Roman Vershynin
Private measures, random walks, and synthetic data. CoRR (2022)
Pierre Baldi, Roman Vershynin
The Quarks of Attention. CoRR (2022)
March Boedihardjo, Thomas Strohmer, Roman Vershynin
Privacy of synthetic data: a statistical framework. CoRR (2021)
March Boedihardjo, Thomas Strohmer, Roman Vershynin
Private sampling: a noiseless approach for generating differentially private synthetic data. CoRR (2021)
Pierre Baldi, Roman Vershynin
A theory of capacity and sparse neural encoding. Neural Networks 143 (2021)
March Boedihardjo, Thomas Strohmer, Roman Vershynin
Covariance's Loss is Privacy's Gain: Computationally Efficient, Private and Accurate Synthetic Data. CoRR (2021)
Pierre Baldi, Roman Vershynin
A theory of capacity and sparse neural encoding. CoRR (2021)
Roman Vershynin
Memory Capacity of Neural Networks with Threshold and Rectified Linear Unit Activations. SIAM J. Math. Data Sci. 2 (4) (2020)
Roman Vershynin
Memory capacity of neural networks with threshold and ReLU activations. CoRR (2020)
Pierre Baldi, Roman Vershynin
The capacity of feedforward neural networks. Neural Networks 116 (2019)
Yan Shuo Tan, Roman Vershynin
Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrieval. CoRR (2019)
Pierre Baldi, Roman Vershynin
The capacity of feedforward neural networks. CoRR (2019)
Pierre Baldi, Roman Vershynin
Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors. SIAM J. Math. Data Sci. 1 (4) (2019)
Yan Shuo Tan, Roman Vershynin
Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods. COLT (2018)
Pierre Baldi, Roman Vershynin
On Neuronal Capacity. NeurIPS (2018)
Jess Banks, Cristopher Moore, Roman Vershynin, Nicolas Verzelen, Jiaming Xu
Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization. IEEE Trans. Inf. Theory 64 (7) (2018)
Can M. Le, Elizaveta Levina, Roman Vershynin
Concentration and regularization of random graphs. Random Struct. Algorithms 51 (3) (2017)
Yan Shuo Tan, Roman Vershynin
Phase Retrieval via Randomized Kaczmarz: Theoretical Guarantees. CoRR (2017)
Yan Shuo Tan, Roman Vershynin
Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods. CoRR (2017)
Jess Banks, Cristopher Moore, Roman Vershynin, Nicolas Verzelen, Jiaming Xu
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. ISIT (2017)
Yaniv Plan, Roman Vershynin
The Generalized Lasso With Non-Linear Observations. IEEE Trans. Inf. Theory 62 (3) (2016)
Christopher Liaw, Abbas Mehrabian, Yaniv Plan, Roman Vershynin
A simple tool for bounding the deviation of random matrices on geometric sets. CoRR (2016)
Roman Vershynin
Four lectures on probabilistic methods for data science. CoRR (2016)
Jess Banks, Cristopher Moore, Roman Vershynin, Jiaming Xu
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. CoRR (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)
Can M. Le, Elizaveta Levina, Roman Vershynin
Sparse random graphs: regularization and concentration of the Laplacian. CoRR (2015)
Can M. Le, Roman Vershynin
Concentration and regularization of random graphs. CoRR (2015)
Raja Giryes, Yaniv Plan, Roman Vershynin
On the Effective Measure of Dimension in the Analysis Cosparse Model. CoRR (2014)
Can M. Le, Elizaveta Levina, Roman Vershynin
Optimization via Low-rank Approximation, with Applications to Community Detection in Networks. CoRR (2014)
Yaniv Plan, Roman Vershynin
Dimension Reduction by Random Hyperplane Tessellations. Discret. Comput. Geom. 51 (2) (2014)
Olivier Guédon, Roman Vershynin
Community detection in sparse networks via Grothendieck's inequality. CoRR (2014)
Roman Vershynin
Invertibility of symmetric random matrices. Random Struct. Algorithms 44 (2) (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)
Albert Ai, Alex Lapanowski, Yaniv Plan, Roman Vershynin
One-bit compressed sensing with non-Gaussian measurements CoRR (2012)
Yaniv Plan, Roman Vershynin
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach CoRR (2012)
Yaniv Plan, Roman Vershynin
One-bit compressed sensing by linear programming CoRR (2011)
Deanna Needell, Roman Vershynin
Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit. IEEE J. Sel. Top. Signal Process. 4 (2) (2010)
Roman Vershynin
Introduction to the non-asymptotic analysis of random matrices CoRR (2010)
Yurii Lyubarskii, Roman Vershynin
Uncertainty principles and vector quantization. IEEE Trans. Inf. Theory 56 (7) (2010)
Deanna Needell, Roman Vershynin
Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit. Found. Comput. Math. 9 (3) (2009)
Roman Vershynin
Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method. SIAM J. Comput. 39 (2) (2009)
Deanna Needell, Joel A. Tropp, Roman Vershynin
Greedy signal recovery review. ACSCC (2008)
Deanna Needell, Joel A. Tropp, Roman Vershynin
Greedy Signal Recovery Review CoRR (2008)
Deanna Needell, Roman Vershynin
Greedy signal recovery and uncertainty principles. Computational Imaging (2008)
Roman Vershynin
Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms CoRR (2007)
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin
One sketch for all: fast algorithms for compressed sensing. STOC (2007)
Mark Rudelson, Roman Vershynin
Sampling from large matrices: An approach through geometric functional analysis. J. ACM 54 (4) (2007)
Thomas Strohmer, Roman Vershynin
A Randomized Solver for Linear Systems with Exponential Convergence. APPROX-RANDOM (2006)
Mark Rudelson, Roman Vershynin
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. CISS (2006)
Roman Vershynin
Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method. FOCS (2006)
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin
Algorithmic linear dimension reduction in the l_1 norm for sparse vectors CoRR (2006)
Roman Vershynin
Beyond Hirsch Conjecture: walks on random polytopes and smoothed complexity of the simplex method CoRR (2006)
Emmanuel J. Candès, Mark Rudelson, Terence Tao, Roman Vershynin
Error Correction via Linear Programming. FOCS (2005)
Shahar Mendelson, Roman Vershynin
Entropy, Combinatorial Dimensions and Random Averages. COLT (2002)