Private measures, random walks, and synthetic data
From MaRDI portal
Publication:6550176
DOI10.1007/S00440-024-01279-ZMaRDI QIDQ6550176FDOQ6550176
Authors: March Boedihardjo, Thomas Strohmer, Roman Vershynin
Publication date: 4 June 2024
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)
Recommendations
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- High-dimensional probability. An introduction with applications in data science
- Optimal Transport
- A basic course in probability theory
- On the geometry of differential privacy
- Calculation of the Wasserstein Distance Between Probability Distributions on the Line
- New inapproximability bounds for TSP
- Differentially private data releasing for smooth queries
- The algorithmic foundations of differential privacy
- A (slightly) improved approximation algorithm for metric TSP
- Distance-based classification with Lipschitz functions
- Minimax Optimal Procedures for Locally Private Estimation
- Faster algorithms for privately releasing marginals
- Title not available (Why is that?)
- The complexity of differential privacy
- A learning theory approach to noninteractive database privacy
- Efficient algorithms for privately releasing marginals via convex relaxations
- Pcps and the hardness of generating private synthetic data
Cited In (2)
This page was built for publication: Private measures, random walks, and synthetic data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550176)