arXiv (All)
open access
From Privacy to Generalization: Linear Max-Information Bounds for Differentially Private Learning Algorithms
Understanding the relationship between generalization and privacy remains a challenge in modern machine learning theory, particularly for deep networks that are trained by variants of differentially private stochastic gradient descent (DP- SGD). In this work we make progress on this persistent open
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- How Far is Adam from Natural Gradient Descent?#1154627
- Fairness Pruning: Locating Demographic Bias in GLU-MLP Layers via Differential Activations#414114
- Revisiting the Provable-Auditable Privacy Gap of DP-SGD#793165
- Revisiting the Provable-Auditable Privacy Gap of DP-SGD#789161
- RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent#1037701
Record · ID 1129273
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive