Pavel Dvurechensky
13 papers · 2018–2024 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
🌉 Interdisciplinary Bridge · Bronze 🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Sprint 🐣 Hot Topic Early Bird 🗺️ Taxonomy Completionist (17)
🔬
Deep Specialist
(10)
💎
Century Club · Bronze
🗃️
Keyword Collector
(66)
🔥
Unstoppable · Bronze
Venues
Top co-authors
Research topics
Keywords
optimal transport
(4)
convex optimization
(4)
non-convex optimization
(3)
iteration complexity
(3)
distributed optimization
(2)
stochastic optimization
(2)
convergence rate
(2)
oracle complexity
(2)
complexity bound
(2)
entropic regularization
(2)
variational inequality
(1)
empirical risk minimization
(1)
reproducing kernel hilbert space
(1)
gradient descent
(1)
learning theory
(1)
communication complexity
(1)
nonsmooth optimization
(1)
composite optimization
(1)
accelerated gradient
(1)
maximum mean discrepancy
(1)
Papers
Analysis of Kernel Mirror Prox for Measure Optimization
AISTATS 2024
Barrier Algorithms for Constrained Non-Convex Optimization
ICML 2024
High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise
ICML 2024
Interaction-Force Transport Gradient Flows
NeurIPS 2024
High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance
ICML 2023
The power of first-order smooth optimization for black-box non-smooth problems
ICML 2022
Newton Method over Networks is Fast up to the Statistical Precision
ICML 2021
On a Combination of Alternating Minimization and Nesterov’s Momentum
ICML 2021
Self-Concordant Analysis of Frank-Wolfe Algorithms
ICML 2020
Near Optimal Methods for Minimizing Convex Functions with Lipschitz p-th Derivatives
COLT 2019
On the Complexity of Approximating Wasserstein Barycenters
ICML 2019
Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization
COLT 2019
Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm
ICML 2018