Roman Vershynin

75 papers A* 7B 1Misc 1Journal 62Unranked 3

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