Hankun Cao

dblp:239/2939 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-8162-1540ORCID · reported

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

Computer networks · 1 · 1 first-author · 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
1 paper
Efficient and distributed learning · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
distributed training
0.612022
Adaptive Gradient Coding · IEEE/ACM Trans. Netw. 2022
Machine learning › Efficient and distributed learning › distributed training
gradient coding
0.612022
Adaptive Gradient Coding · IEEE/ACM Trans. Netw. 2022
Machine learning › Efficient and distributed learning › distributed training
straggler mitigation
0.612022
Adaptive Gradient Coding · IEEE/ACM Trans. Netw. 2022
Coding theory › error-correcting codes › coded computation
gradient coding
0.212022
Adaptive Gradient Coding · IEEE/ACM Trans. Netw. 2022

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

group coding · 1.1gradient coding · 1.1
YearPublicationVenuePosition
2022 Adaptive Gradient Coding
abstract
This paper focuses on mitigating the impact of stragglers in distributed learning system. Unlike the existing results designated for a fixed number of stragglers, we develop a new scheme calledAdaptive Gradient Coding (AGC)with flexible communication cost for varying number of stragglers. Our scheme gives an optimal tradeoff between computation load, straggler tolerance and communication cost by allowing workers to send multiple signals sequentially to the master. In particular, it can minimize the communication cost according to the unknown real-time number of stragglers in practical environments. In addition, we present aGroup AGC (G-AGC)by combining the group idea with AGC to resist more stragglers in some situations. The numerical and simulation results demonstrate that our adaptive schemes can achieve the smallest average running time.
Hankun Cao, Qifa Yan, Xiaohu Tang 0004, Guojun Han
IEEE/ACM Trans. Netw.1