3.6k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Inception Institute of Artificial IntelligenceAE16 papers
- Carnegie Mellon UniversityUS15 papers
- École PolytechniqueFR11 papers
- Australian National UniversityAU10 papers
- Nankai UniversityCN8 papers
- Centre de Mathématiques Appliquées de l'École polytechniqueFR7 papers
- Nanyang Technological UniversitySG7 papers
- National Research University Higher School of EconomicsRU7 papers
- The University of SydneyAU7 papers
- University of WaterlooCA7 papers
- Hamad bin Khalifa UniversityQA6 papers
- Moscow Institute of Physics and TechnologyRU6 papers
3 papers · 2 filters
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…
Convergence of Proximal Point and Extragradient-Based Methods Beyond Monotonicity: the Case of Negative Comonotonicity
Eduard Gorbunov, Adrien Taylor, Samuel Horváth +1
Algorithms for min-max optimization and variational inequalities are often studied under monotonicity assumptions. Motivated by non-monotone machine learning applications, we follo…
Stochastic Gradient Methods with Preconditioned Updates
Abdurakhmon Sadiev, Aleksandr Beznosikov, Abdulla Jasem Almansoori +3
This work considers the non-convex finite sum minimization problem. There are several algorithms for such problems, but existing methods often work poorly when the problem is badly…