Stability is stable: connections between replicability, privacy, and adaptive generalization
From MaRDI portal
Publication:6499247
DOI10.1145/3564246.3585246WikidataQ130957563 ScholiaQ130957563MaRDI QIDQ6499247FDOQ6499247
Authors: Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell 
Publication date: 8 May 2024
Cites Work
- 10.1162/153244302760200704
- Theory of Cryptography
- Learnability, stability and uniform convergence
- Title not available (Why is that?)
- Distribution-free performance bounds for potential function rules
- Preserving statistical validity in adaptive data analysis (extended abstract)
- Algorithmic stability for adaptive data analysis
- A finite sample distribution-free performance bound for local discrimination rules
- Information-Theoretic Lower Bounds for Distributed Function Computation
- Geometric random graphs on circles
- The reusable holdout: preserving validity in adaptive data analysis
- Private learning and sanitization: pure vs. approximate differential privacy
- Private PAC learning implies finite Littlestone dimension
- Title not available (Why is that?)
- Sample-efficient proper PAC learning with approximate differential privacy
- Fingerprinting codes and the price of approximate differential privacy
- Make Up Your Mind: The Price of Online Queries in Differential Privacy
- Learners that use little information
This page was built for publication: Stability is stable: connections between replicability, privacy, and adaptive generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499247)
