output
20172025
most citedContrarians synchronize beyond the limit of pairwise interactions

74 citations

Showing 2020Show all

7 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…

math.OC2020★ 13 cited

Zeroth-Order Algorithms for Smooth Saddle-Point Problems

Abdurakhmon Sadiev, Aleksandr Beznosikov, Pavel Dvurechensky +1

Saddle-point problems have recently gained increased attention from the machine learning community, mainly due to applications in training Generative Adversarial Networks using sto…

math.OC2020★ 1 cited

Linearly Convergent Gradient-Free Methods for Minimization of Parabolic Approximation

Aleksandra Bazarova, Aleksandr Beznosikov, Alexander Gasnikov

Finding the global minimum of non-convex functions is one of the main and most difficult problems in modern optimization. In the first part of the paper, we consider a certain clas…

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…

math.OC2020★ 15 cited

Gradient-Free Methods for Saddle-Point Problem

Aleksandr Beznosikov, Abdurakhmon Sadiev, Alexander Gasnikov

In the paper, we generalize the approach Gasnikov et. al, 2017, which allows to solve (stochastic) convex optimization problems with an inexact gradient-free oracle, to the convex-…

math.GT2020★ 9 cited

On faces of quasi-arithmetic Coxeter polytopes

Nikolay Bogachev, Alexander Kolpakov

We prove that each lower-dimensional face of a quasi-arithmetic Coxeter polytope, which happens to be itself a Coxeter polytope, is also quasi-arithmetic. We also provide a suffici…