Skip to content
conftrace_

Dmitry Kovalev

26 papers · 2018–2025 · 6 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.

Jump to papers ↓
+9 more ↓ 🗺️ Taxonomy Completionist (25) 🏃 Academic Marathon · Sprint 🌍 Conference Polyglot · Silver 🌉 Interdisciplinary Bridge · Bronze 🐣 Hot Topic Early Bird
🔬 Deep Specialist (16) 🤝 Dynamic Duo (18) 🧬 Topic Evolution 🏆 Keyword Champion (5) 🗃️ Keyword Collector (115) ❓ The Questioner 🔥 Unstoppable · Bronze 💎 Century Club · Bronze ⚡ Prolific Year · Productive

Papers

An Optimal Algorithm for Strongly Convex Min-Min Optimization UAI 2025 Decentralized Optimization with Coupled Constraints ICLR 2025 On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms ICML 2025 Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks NeurIPS 2024 Is Consensus Acceleration Possible in Decentralized Optimization over Slowly Time-Varying Networks? ICML 2023 Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling NeurIPS 2022 An Optimal Algorithm for Strongly Convex Minimization under Affine Constraints AISTATS 2022 Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with an Inexact Prox NeurIPS 2022 IntSGD: Adaptive Floatless Compression of Stochastic Gradients ICLR 2022 Optimal Algorithms for Decentralized Stochastic Variational Inequalities NeurIPS 2022 Optimal Gradient Sliding and its Application to Optimal Distributed Optimization Under Similarity NeurIPS 2022 The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization NeurIPS 2022 The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization NeurIPS 2022 ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks ICML 2021 A Linearly Convergent Algorithm for Decentralized Optimization: Sending Less Bits for Free! AISTATS 2021 Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks NeurIPS 2021 Acceleration for Compressed Gradient Descent in Distributed and Federated Optimization ICML 2020 Don’t Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loop ALT 2020 From Local SGD to Local Fixed-Point Methods for Federated Learning ICML 2020 Linearly Converging Error Compensated SGD NeurIPS 2020 Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization NeurIPS 2020 Revisiting Stochastic Extragradient AISTATS 2020 Variance Reduced Coordinate Descent with Acceleration: New Method With a Surprising Application to Finite-Sum Problems ICML 2020 RSN: Randomized Subspace Newton NeurIPS 2019 Stochastic Proximal Langevin Algorithm: Potential Splitting and Nonasymptotic Rates NeurIPS 2019 Stochastic Spectral and Conjugate Descent Methods NeurIPS 2018