In this work, we revisit the problem of solving large-scale semidefinite...
Stochastic and adversarial data are two widely studied settings in onlin...
We show that convex-concave Lipschitz stochastic saddle point problems (...
Inspired by regularization techniques in statistics and machine learning...
We study the problem of approximating stationary points of Lipschitz and...
We study the problem of (ϵ,δ)-differentially private learning
of linear ...
We study stochastic monotone inclusion problems, which widely appear in
...
Stochastic and adversarial data are two widely studied settings in onlin...
We study differentially private stochastic optimization in convex and
no...
Much of the work in online learning focuses on the study of sublinear up...
We study the problem of circular seriation, where we are given a matrix ...
In this work, we conduct the first systematic study of stochastic variat...
This paper studies the complexity for finding approximate stationary poi...
Differentially private (DP) stochastic convex optimization (SCO) is a
fu...
Composite minimization is a powerful framework in large-scale convex
opt...
Uniform stability is a notion of algorithmic stability that bounds the w...
We study the question of whether parallelization in the exploration of t...