Private data release via learning thresholds
From MaRDI portal
Recommendations
Cites work
- A theory of the learnable
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- scientific article; zbMATH DE number 1256721 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- Interactive privacy via the median mechanism
- Learnability beyond AC 0
- Learning Decision Trees Using the Fourier Spectrum
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Learning intersections and thresholds of halfspaces
- On PAC learning algorithms for rich Boolean function classes
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the learnability of discrete distributions
- Pcps and the hardness of generating private synthetic data
- The Intersection of Two Halfspaces Has High Threshold Degree
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
- What can we learn privately?
Cited in
(22)- Efficient and secure outsourcing of differentially private data publication
- PCPs and the hardness of generating synthetic data
- Efficient algorithms for privately releasing marginals via convex relaxations
- Pure differential privacy for rectangle queries via private partitions
- Answering n^2+o(1) counting queries with differential privacy is hard
- Differentially private data releasing for smooth queries
- Faster algorithms for privately releasing marginals
- Nearly optimal private convolution
- Fast private data release algorithms for sparse queries
- The algorithmic foundations of differential privacy
- Using convex relaxations for efficiently and privately releasing marginals (extended abstract)
- Differential privacy on finite computers
- Private analysis of graph structure
- PrivBayes. Private data release via Bayesian networks
- Differentially private learning of geometric concepts
- Empirical risk minimization in the non-interactive local model of differential privacy
- Learning Privately with Labeled and Unlabeled Examples
- Exploiting metric structure for efficient private query release
- A learning theory approach to noninteractive database privacy
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- The power of linear reconstruction attacks
- Differential privacy: getting more for less
This page was built for publication: Private data release via learning thresholds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743387)
