On the privacy of noisy stochastic gradient descent for convex optimization
type: Item
instance of: scholarly article
title: On the privacy of noisy stochastic gradient descent for convex optimization
author: Jason M. Altschuler
author: Jinho Bok
author: Kunal Talwar
published in: SIAM Journal on Computing
publication date: 2024-08-06T00:00:00Z
Mathematics Subject Classification ID: 68P27
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 7892775
zbMATH Keywords: differential privacy
zbMATH Keywords: convex optimization
zbMATH Keywords: noisy stochastic gradient descent
zbMATH Keywords: stochastic gradient Langevin dynamics
zbMATH Keywords: privacy amplification by iteration
zbMATH Keywords: shifted divergences
MaRDI profile type: Publication
cites work: Convex optimization: algorithms and complexity
cites work: Sampling from a log-concave distribution with projected Langevin Monte Carlo
cites work: Q5396633
cites work: Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
cites work: High-dimensional Bayesian inference via the unadjusted Langevin algorithm
cites work: Theory of Cryptography
cites work: Private stochastic convex optimization: optimal rates in linear time
cites work: What Can We Learn Privately?
cites work: Private selection from private candidates
cites work: Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
cites work: Rényi Divergence and Kullback-Leibler Divergence
cites work: Probability with Martingales
DOI: 10.1137/23M1556538
description: scientific article; zbMATH DE number 7892775