The following pages link to R. V. Vershinin (Q1589033):
Displaying 17 items.
- John's decompositions: Selecting a large part (Q5935812) (← links)
- Optimization via low-rank approximation for community detection in networks (Q5963526) (← links)
- Marchenko–Pastur law with relaxed independence conditions (Q6063726) (← links)
- A theory of capacity and sparse neural encoding (Q6079092) (← links)
- Covariance's loss is privacy's gain: computationally efficient, private and accurate synthetic data (Q6118081) (← links)
- The quarks of attention: structure and capacity of neural attention building blocks (Q6161491) (← links)
- Privacy of Synthetic Data: A Statistical Framework (Q6196117) (← links)
- Private measures, random walks, and synthetic data (Q6505774) (← links)
- Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets (Q6510306) (← links)
- Are most Boolean functions determined by low frequencies? (Q6518645) (← links)
- Hamiltonicity of Sparse Pseudorandom Graphs (Q6521036) (← links)
- Online Differentially Private Synthetic Data Generation (Q6521505) (← links)
- Metric geometry of the privacy-utility tradeoff (Q6532801) (← links)
- Private measures, random walks, and synthetic data (Q6550176) (← links)
- Covariance loss, Szemeredi regularity, and differential privacy (Q6668388) (← links)
- Can we spot a fake? (Q6750294) (← links)
- Jackson's inequality on the hypercube (Q6750499) (← links)
