Stability is stable: connections between replicability, privacy, and adaptive generalization

DOI10.1145/3564246.3585246MaRDI QIDQ6499247zbMATH OpenWikidataFDO

Authors Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell

Publication date 8 May 2024

zbMATH Keywords

replicabilitydifferential privacygeneralizationalgorithmic stability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 5485440 (Why is no real title available?)
• scientific article; zbMATH DE number 7650379 (Why is no real title available?)
• 10.1162/153244302760200704
• A finite sample distribution-free performance bound for local discrimination rules
• Algorithmic stability for adaptive data analysis
• Distribution-free performance bounds for potential function rules
• Fingerprinting codes and the price of approximate differential privacy
• Geometric random graphs on circles
• Information-Theoretic Lower Bounds for Distributed Function Computation
• Learnability, stability and uniform convergence
• Learners that use little information
• Make Up Your Mind: The Price of Online Queries in Differential Privacy
• Preserving statistical validity in adaptive data analysis (extended abstract)
• Private PAC learning implies finite Littlestone dimension
• Private learning and sanitization: pure vs. approximate differential privacy
• Sample-efficient proper PAC learning with approximate differential privacy
• The reusable holdout: preserving validity in adaptive data analysis
• Theory of Cryptography

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)