Categories: FAANG

Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Loss

A central issue in machine learning is how to train models on sensitive user data. Industry has widely adopted a simple algorithm: Stochastic Gradient Descent with noise (a.k.a. Stochastic Gradient Langevin Dynamics). However, foundational theoretical questions about this algorithm’s privacy loss remain open — even in the seemingly simple setting of smooth convex losses over a bounded domain. Our main result resolves these questions: for a large range of parameters, we characterize the differential privacy up to a constant factor. This result reveals that all previous analyses for this…
AI Generated Robotic Content

Recent Posts

Never forget…

submitted by /u/ShadowBoxingBabies [link] [comments]

11 hours ago

A Reinforcement Learning Based Universal Sequence Design for Polar Codes

To advance Polar code design for 6G applications, we develop a reinforcement learning-based universal sequence…

11 hours ago

Democratizing business intelligence: BGL’s journey with Claude Agent SDK and Amazon Bedrock AgentCore

This post is cowritten with James Luo from BGL. Data analysis is emerging as a…

11 hours ago

An ‘Intimacy Crisis’ Is Driving the Dating Divide

In his book The Intimate Animal, sex and relationships researcher Justin Garcia says people have…

12 hours ago

New fire just dropped: ComfyUI-CacheDiT ⚡

ComfyUI-CacheDiT brings 1.4-1.6x speedup to DiT (Diffusion Transformer) models through intelligent residual caching, with zero…

1 day ago