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

A Complete Guide to Matrices for Machine Learning with Python

Matrices are a key concept not only in linear algebra but also with regard to…

17 hours ago

An Efficient and Streaming Audio Visual Active Speaker Detection System

This paper delves into the challenging task of Active Speaker Detection (ASD), where the system…

17 hours ago

Benchmarking Amazon Nova and GPT-4o models with FloTorch

Based on original post by Dr. Hemant Joshi, CTO, FloTorch.ai A recent evaluation conducted by…

17 hours ago

How Google Cloud measures its climate impact through Life Cycle Assessment (LCA)

As AI creates opportunities for business growth and societal benefits, we’re working to reduce their…

17 hours ago

Sony testing AI to drive PlayStation characters

PlayStation characters may one day engage you in theoretically endless conversations, if a new internal…

18 hours ago

15-inch MacBook Air (M4, 2025) Review: Bluer and Better

The latest 15-inch MacBook Air is bluer and better than ever before—and it dropped in…

18 hours ago