output
20132024
most citedGrowing scale-free simplices

73 citations

Showing 2020Show all

5 papers · 1 filter

math.OC2020★ 26 cited

Recent theoretical advances in decentralized distributed convex optimization

Eduard Gorbunov, Alexander Rogozin, Aleksandr Beznosikov +2

In the last few years, the theory of decentralized distributed convex optimization has made significant progress. The lower bounds on communications rounds and oracle calls have ap…

nlin.AO2020★ 53 cited

D-dimensional oscillators in simplicial structures: odd and even dimensions display different synchronization scenarios

X. Dai, K. Kovalenko, M. Molodyk +8

From biology to social science, the functioning of a wide range of systems is the result of elementary interactions which involve more than two constituents, so that their descript…

cs.LG2020★ 3 cited

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms

Aleksandr Beznosikov, Valentin Samokhin, Alexander Gasnikov

This paper focuses on the distributed optimization of stochastic saddle point problems. The first part of the paper is devoted to lower bounds for the centralized and decentralized…

physics.soc-ph2020★ 73 cited

Growing scale-free simplices

K. Kovalenko, I. Sendiña-Nadal, N. Khalil +6

The past two decades have seen significant successes in our understanding of complex networked systems, from the mapping of real-world social, biological and technological networks…

econ.EM2020★ 2 cited

New robust inference for predictive regressions

Rustam Ibragimov, Jihyun Kim, Anton Skrobotov

We propose two robust methods for testing hypotheses on unknown parameters of predictive regression models under heterogeneous and persistent volatility as well as endogenous, pers…