Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
DOI10.1007/s10107-023-01953-5arXiv2104.02988OpenAlexW3147063886MaRDI QIDQ6120842
Digvijay Boob, Cristóbal Guzmán
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.02988
variational inequalitiesstochastic algorithmssaddle-point problemsdifferential privacyalgorithmic stability
Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Numerical analysis or methods applied to Markov chains (65C40) Stochastic approximation (62L20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On general minimax theorems
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Interior projection-like methods for monotone variational inequalities
- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds
- The Algorithmic Foundations of Differential Privacy
- Robust Stochastic Approximation Approach to Stochastic Programming
- Monotone Operators and the Proximal Point Algorithm
- Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities
- High-Dimensional Probability
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- 10.1162/153244302760200704
- Private stochastic convex optimization: optimal rates in linear time
- Solving variational inequalities with Stochastic Mirror-Prox algorithm
- Gaussian Differential Privacy
- Theory of Cryptography
This page was built for publication: Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
