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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yongjin Cai

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

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

Computer networks · 1 · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 87% High-performance computing · 13%
Artificial intelligence
1 paper
Efficient and distributed learning · 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
1.012026
Chameleon: Adaptive Fault Tolerance for Distributed Training via Real-time Policy Selection · INFOCOM 2026
Distributed systems › fault tolerance › resilience
adaptive fault tolerance
1.012026
Chameleon: Adaptive Fault Tolerance for Distributed Training via Real-time Policy Selection · INFOCOM 2026
Distributed systems
fault tolerance
1.012026
Chameleon: Adaptive Fault Tolerance for Distributed Training via Real-time Policy Selection · INFOCOM 2026
High-performance computing
large-scale training
0.312026
Chameleon: Adaptive Fault Tolerance for Distributed Training via Real-time Policy Selection · INFOCOM 2026

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

performance modeling · 2.0execution plan search · 2.0
YearPublicationVenuePosition
2026 Chameleon: Adaptive Fault Tolerance for Distributed Training via Real-time Policy Selection
abstract
Training large language models faces frequent interruptions due to various faults, demanding robust fault-tolerance. Existing backup-free methods, such as redundant computation, dynamic parallelism, and data rerouting, each incur performance penalties, whether from ongoing overhead, lengthy reconfigurations, or post-recovery inefficiencies. We propose Chameleon, an adaptive fault-tolerant system that intelligently selects optimal recovery strategies when a failure occurs. Chameleon achieves this through a unified performance model, expedient execution plan search, accurate performance estimation, and efficient communication optimizations. Experiments on a 32-card cluster show that Chameleon maintains a performance gap of within 11.00% between post-recovery and failure-free training, while preserving model convergence and efficient memory usage. Compared to state-of-the-art methods, Chameleon achieves up to 1.229x and 1.355x higher average throughput than Oobleck and Recycle, respectively.
Zhibin Wang 0002, Haoran Xia, Junhe Lu, Qianyu Jiang, Rong Gu 0001, Hengxi Xu, Xinjing Huang, Guanghuan Fang, Zhiheng Hu, Yongjin Cai, Chen Tian 0001
INFOCOM13