Obserwuj
Ekaterina Borodich
Ekaterina Borodich
MIPT
Zweryfikowany adres z phystech.edu
Tytuł
Cytowane przez
Cytowane przez
Rok
On accelerated methods for saddle-point problems with composite structure
V Tominin, Y Tominin, E Borodich, D Kovalev, A Gasnikov, ...
arXiv preprint arXiv:2103.09344, 2021
342021
Optimal gradient sliding and its application to optimal distributed optimization under similarity
D Kovalev, A Beznosikov, E Borodich, A Gasnikov, G Scutari
Advances in Neural Information Processing Systems 35, 33494-33507, 2022
322022
Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes
A Sadiev, E Borodich, A Beznosikov, D Dvinskikh, S Chezhegov, ...
EURO Journal on Computational Optimization 10, 100041, 2022
192022
Decentralized personalized federated min-max problems
E Borodich, A Beznosikov, A Sadiev, V Sushko, N Savelyev, M Takác, ...
arXiv preprint arXiv:2106.07289, 2021
122021
Optimal algorithm with complexity separation for strongly convex-strongly concave composite saddle point problems
E Borodich, G Kormakov, D Kovalev, A Beznosikov, A Gasnikov
arXiv preprint arXiv:2307.12946, 2023
42023
Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
D Kovalev, E Borodich, A Gasnikov, D Feoktistov
arXiv preprint arXiv:2405.18031, 2024
12024
Variance reduction for minimax problems with a small dimension of one of the variables
EL Gladin, ED Borodich
Компьютерные исследования и моделирование 14 (2), 257-275, 2022
12022
Decentralized personalized federated learning for min-max problems
E Borodich, A Beznosikov, A Sadiev, V Sushko, N Savelyev, M Takáč, ...
arXiv preprint arXiv:2106.07289, 2021
12021
On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
D Kovalev, E Borodich
arXiv preprint arXiv:2411.14601, 2024
2024
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–9