On the sample complexity of privately learning unbounded high-dimensional Gaussians
From MaRDI portal
Cites work
- A universally acceptable smoothing factor for kernel density estimates
- Bounds on the sample complexity for private learning and private data release
- Classification by polynomial surfaces
- Combinatorial methods in density estimation
- Composable and versatile privacy via truncated CDP
- Concentrated differential privacy: simplifications, extensions, and lower bounds
- Differential privacy and robust statistics
- Fingerprinting codes and the price of approximate differential privacy
- Finite sample differentially private confidence intervals
- scientific article; zbMATH DE number 5485439 (Why is no real title available?)
- scientific article; zbMATH DE number 7014213 (Why is no real title available?)
- Learning Poisson binomial distributions
- Make Up Your Mind: The Price of Online Queries in Differential Privacy
- Maximum selection and sorting with adversarial comparators
- Nonasymptotic universal smoothing factors, kernel complexity and Yatracos classes
- On the geometry of differential privacy
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Privacy-preserving statistical estimation with optimal convergence rates
- Rates of convergence of minimum distance estimators and Kolmogorov's entropy
- Robust estimators in high dimensions without the computational intractability
- Robust traceability from trace amounts
- Sharper bounds for Gaussian and empirical processes
- Simultaneous private learning of multiple concepts
- Theory of Cryptography
- Tight lower bounds for differentially private selection
Cited in
(4)
This page was built for publication: On the sample complexity of privately learning unbounded high-dimensional Gaussians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028650)
