Private stochastic convex optimization: optimal rates in linear time
From MaRDI portal
Publication:5144932
Cited in
(19)- Learning privately with labeled and unlabeled examples
- Differentially private SGD with non-smooth losses
- Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
- Communication-efficient and privacy-preserving large-scale federated learning counteracting heterogeneity
- PAC privacy: automatic privacy measurement and control of data processing
- Differentially private inference via noisy optimization
- Gradient complexity and non-stationary views of differentially private empirical risk minimization
- Private Stochastic Convex Optimization: Optimal Rates in Linear Time
- Differentially private SGD with random features
- On the privacy of noisy stochastic gradient descent for convex optimization
- Neural network-based parameter estimation for nonautonomous differential equations with discontinuous signals
- Resolving the mixing time of the Langevin algorithm to its stationary distribution for log-concave sampling
- Efficient private SCO for heavy-tailed data via averaged clipping
- Differentially private non-convex optimization under the KL condition with optimal rates
- Private stochastic optimization with large worst-case Lipschitz parameter: optimal rates for (non-smooth) convex losses and extension to non-convex losses
- Private least absolute deviations with heavy-tailed data
- Faster rates of private stochastic convex optimization
- Faster high-accuracy log-concave sampling via algorithmic warm starts
- Revisiting differentially private stochastic convex optimization in (non)-Euclidean space
This page was built for publication: Private stochastic convex optimization: optimal rates in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144932)
