Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Vsevolod Plokhotnyuk

dblp:262/3722 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Efficient and distributed learning · 78% Language models and text generation · 22%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › federated learning › communication-efficient federated learning
communication-efficient aggregation
0.512021
Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable Devices · NeurIPS 2021
Machine learning › Efficient and distributed learning
distributed training
0.512021
Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable Devices · NeurIPS 2021
Machine learning › Efficient and distributed learning
federated learning
0.512021
Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable Devices · NeurIPS 2021
Natural language and speech › Language models and text generation
knowledge editing
0.412020
Editable Neural Networks · ICLR 2020

Methods — techniques the papers use, named apart from their topics

parameter server · 0.5gossip-based averaging · 0.5all-reduce protocol · 0.5constrained fine-tuning · 0.4
YearPublicationVenuePosition
2021 Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable Devices
abstract
Training deep neural networks on large datasets can often be accelerated by using multiple compute nodes. This approach, known as distributed training, can utilize hundreds of computers via specialized message-passing protocols such as Ring All-Reduce.However, running these protocols at scale requires reliable high-speed networking that is only available in dedicated clusters.In contrast, many real-world applications, such as federated learning and cloud-based distributed training, operate on unreliable devices with unstable network bandwidth.As a result, these applications are restricted to using parameter servers or gossip-based averaging protocols.In this work, we lift that restriction by proposing Moshpit All-Reduce — an iterative averaging protocol that exponentially converges to the global average.We demonstrate the efficiency of our protocol for distributed optimization with strong theoretical guarantees.The experiments show 1.3x speedup for ResNet-50 training on ImageNet compared to competitive gossip-based strategies and 1.5x speedup when training ALBERT-large on preemptible compute nodes.
Max Ryabinin, Eduard Gorbunov, Vsevolod Plokhotnyuk, Gennady Pekhimenko
NeurIPS3
2020 Editable Neural Networks
Anton Sinitsin, Vsevolod Plokhotnyuk, Dmitry V. Pyrkin, Sergei Popov, Artem Babenko
ICLR2