Abstract:
Variational inequalities are a universal optimization paradigm that is interesting in itself, but also incorporates classical minimization and saddle point problems. Modern realities encourage to consider stochastic formulations of optimization problems. In this paper, we present an analysis of a method that gives optimal convergence estimates for monotone stochastic finite-sum variational inequalities. In contrast to the previous works, our method supports batching and does not lose the oracle complexity optimality. The effectiveness of the algorithm, especially in the case of small but not single batches is confirmed experimentally.
The work of A. Pichugin and M. Pechin was supported by a grant for research centers in the field of artificial intelligence, provided by the Analytical Center for the Government of the Russian Federation in accordance with the subsidy agreement (agreement identifier 000000D730321P5Q0002) and the agreement with the Moscow Institute of Physics and Technology dated November 1, 2021 no. 70-2021-00138.
Presented:A. A. Shananin Received: 01.09.2023 Revised: 15.09.2023 Accepted: 18.10.2023
Citation:
A. Pichugin, M. Pechin, A. Beznosikov, A. Savchenko, A. Gasnikov, “Optimal analysis of method with batching for monotone stochastic finite-sum variational inequalities”, Dokl. RAN. Math. Inf. Proc. Upr., 514:2 (2023), 212–224; Dokl. Math., 108:suppl. 2 (2023), S348–S359