scientific article; zbMATH DE number 7053268
From MaRDI portal
Publication:5743387
zbMath1421.68038arXiv1107.2444MaRDI QIDQ5743387
Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio
Publication date: 10 May 2019
Full work available at URL: https://arxiv.org/abs/1107.2444
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Authentication, digital signatures and secret sharing (94A62)
Related Items (7)
Efficient and secure outsourcing of differentially private data publication ⋮ Differential privacy: getting more for less ⋮ PCPs and the hardness of generating synthetic data ⋮ Differential Privacy on Finite Computers ⋮ Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard ⋮ Unnamed Item ⋮ Efficient algorithms for privately releasing marginals via convex relaxations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning intersections and thresholds of halfspaces
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- On PAC learning algorithms for rich Boolean function classes
- On the learnability of discrete distributions
- Privately Releasing Conjunctions and the Statistical Query Barrier
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- PCPs and the Hardness of Generating Private Synthetic Data
- What Can We Learn Privately?
- Learnability beyond AC 0
- A theory of the learnable
- Learning Decision Trees Using the Fourier Spectrum
- The Intersection of Two Halfspaces Has High Threshold Degree
- On the complexity of differentially private data release
- Theory of Cryptography
This page was built for publication:
