Pith. sign in

REVIEW 1 cited by

Rethinking Memory and Communication Cost for Efficient Large Language Model Training

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.06003 v2 pith:CHJ5KWTG submitted 2023-10-09 cs.LG cs.AI

classification cs.LGcs.AI
keywords communicationtraininglanguagelargememoryefficiencymodelparo
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, various distributed strategies for large language model training have been proposed. However, these methods provided limited solutions for the trade-off between memory consumption and communication cost. In this paper, we rethink the impact of memory consumption and communication costs on the training speed of large language models, and propose a memory-communication balanced strategy set Partial Redundancy Optimizer (PaRO). PaRO provides comprehensive options which reduces the amount and frequency of inter-group communication with minor memory redundancy by fine-grained sharding strategy, thereby improving the training efficiency in various training scenarios. Additionally, we propose a Hierarchical Overlapping Ring (HO-Ring) communication topology to enhance communication efficiency between nodes or across switches in large language model training. Our experiments demonstrate that PaRO significantly improves training throughput by 1.19x-2.50x compared to the SOTA method and achieves a near-linear scalability. The HO-Ring algorithm improves communication efficiency by 36.5% compared to the traditional Ring algorithm.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Distributed Optimization under Heavy-Tailed Noise

    cs.LG 2025-02 conditional novelty 7.0 of 10

    Coordinate-wise two-sided clipping at inner and outer optimizers (Bi2Clip) achieves provable convergence under heavy-tailed noise with unbounded variance, while needing no preconditioner memory.

Pith tools