74 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- A. Gasnikov4 profiles16 · h 31
- A. Beznosikov2 profiles11 · h 18
- A. M. Raigorodskii2 profiles6 · h 7
- D. Musatov5 · h 9
- K. Alfaro-Bittner2 profiles5 · h 8
- K. Kovalenko2 profiles5 · h 5
- S. Boccaletti5 · h 60
- A. Rogozin4 · h 13
- Eduard A. Gorbunov4 · h 29
- M. Perc4 · h 119
- A. Polyanskii3 · h 8
- Abdurakhmon Sadiev2 · h 11
- Moscow Institute of Physics and TechnologyRU31 papers
- Institute for Information Transmission ProblemsRU11 papers
- National Research University Higher School of EconomicsRU8 papers
- Buryat State UniversityRU7 papers
- Lomonosov Moscow State UniversityRU7 papers
- The Russian Presidential Academy of National Economy and Public AdministrationRU7 papers
- Institute for Complex SystemsIT6 papers
- Universidad Rey Juan CarlosES6 papers
- Alma Mater EuropaeaSI4 papers
- China Medical UniversityTW4 papers
- China Medical University HospitalTW4 papers
- Complexity Science HubAT4 papers
33 papers
On tropical knapsack-type problems
I. M. Buchinskiy, M. V. Kotov, A. V. Treier
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup…
On lower bounds of the density of planar periodic sets without unit distances
Alexander Tolmachev
Determining the maximal density of planar sets without unit distances is a fundamental problem in combinatorial geometry. This paper investigates lower bounds f…
A note on Borsuk's problem in Minkowski spaces
Andrei M. Raigorodskii, Arsenii Sagdeev
In 1993, Kahn and Kalai famously constructed a sequence of finite sets in -dimensional Euclidean spaces that cannot be partitioned into less than …
Randomized gradient-free methods in convex optimization
Alexander Gasnikov, Darina Dvinskikh, Pavel Dvurechensky +3
This review presents modern gradient-free methods to solve convex optimization problems. By gradient-free methods, we mean those that use only (noisy) realizations of the objective…
Why are there six degrees of separation in a social network?
Ivan Samoylenko, David Aleja, Eva Primo +11
A wealth of evidence shows that real world networks are endowed with the small-world property i.e., that the maximal distance between any two of their nodes scales logarithmically…
Coverings of planar and three-dimensional sets with subsets of smaller diameter
Alexander Tolmachev, Dmitry Protasov, Vsevolod Voronov
Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given there is a minim…
SARAH-based Variance-reduced Algorithm for Stochastic Finite-sum Cocoercive Variational Inequalities
Aleksandr Beznosikov, Alexander Gasnikov
Variational inequalities are a broad formalism that encompasses a vast number of applications. Motivated by applications in machine learning and beyond, stochastic methods are of g…
Decentralized convex optimization over time-varying graphs: a survey
Alexander Rogozin, Alexander Gasnikov, Aleksander Beznosikov +1
Decentralized optimization over time-varying networks has a wide range of applications in distributed learning, signal processing and various distributed control problems. The agen…
Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches
Alexander Rogozin, Demyan Yarmoshik, Ksenia Kopylova +1
Decentralized optimization is a common paradigm used in distributed signal processing and sensing as well as privacy-preserving and large-scale machine learning. It is assumed that…
Compression and Data Similarity: Combination of Two Techniques for Communication-Efficient Solving of Distributed Variational Inequalities
Aleksandr Beznosikov, Alexander Gasnikov
Variational inequalities are an important tool, which includes minimization, saddles, games, fixed-point problems. Modern large-scale and computationally expensive practical applic…
A Unified Analysis of Variational Inequality Methods: Variance Reduction, Sampling, Quantization and Coordinate Descent
Aleksandr Beznosikov, Alexander Gasnikov, Karina Zainulina +2
In this paper, we present a unified analysis of methods for such a wide class of problems as variational inequalities, which includes minimization problems and saddle point problem…
Vector Centrality in Hypergraphs
Kirill Kovalenko, Miguel Romance, Ekaterina Vasilyeva +9
Identifying the most influential nodes in networked systems is of vital importance to optimize their function and control. Several scalar metrics have been proposed to that effect,…
Predicting transitions in cooperation levels from network connectivity
A. Zhuk, I. Sendiña-Nadal, I. Leyva +4
Networks determine our social circles and the way we cooperate with others. We know that topological features like hubs and degree assortativity affect cooperation, and we know tha…
Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks
Aleksandr Beznosikov, Alexander Rogozin, Dmitry Kovalev +1
Decentralized optimization methods have been in the focus of optimization community due to their scalability, increasing popularity of parallel algorithms and many applications. In…
Contrarians synchronize beyond the limit of pairwise interactions
K. Kovalenko, X. Dai, K. Alfaro-Bittner +3
We give evidence that a population of pure contrarians globally coupled D-dimensional Kuramoto oscillators reaches a collective synchronous state when the interplay between the uni…
Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
Vsevolod Voronov, Anna Neopryatnaya, Eugene Dergachev
This paper is devoted to the development of algorithms for finding unit distance graphs with chromatic number greater than 4, embedded in a two-dimensional sphere or plane. Such gr…
One-Point Gradient-Free Methods for Smooth and Non-Smooth Saddle-Point Problems
Aleksandr Beznosikov, Vasilii Novitskii, Alexander Gasnikov
In this paper, we analyze gradient-free methods with one-point feedback for stochastic saddle point problems . For non-smooth and smooth cases, we present…
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…
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…
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…
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…
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…
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-…
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…