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

Best guess as to which tools were used for this? VACE v2v?

credit to @ unreelinc submitted by /u/Leading_Primary_8447 [link] [comments]

5 hours ago

Calculating What Your Bank Spends on Marketing Compliance Reviews

By Taylor Mahoney, VP of Solutions ConsultingPicture this. The Federal Reserve has just dropped interest…

5 hours ago

AlphaGenome: AI for better understanding the genome

Introducing a new, unifying DNA sequence model that advances regulatory variant-effect prediction and promises to…

5 hours ago

TiC-LM: A Web-Scale Benchmark for Time-Continual LLM Pretraining

This paper was accepted to the ACL 2025 main conference as an oral presentation. This…

5 hours ago

Build an intelligent multi-agent business expert using Amazon Bedrock

In this post, we demonstrate how to build a multi-agent system using multi-agent collaboration in…

5 hours ago

How Schroders built its multi-agent financial analysis research assistant

Financial analysts spend hours grappling with ever-increasing volumes of market and company data to extract…

5 hours ago