Pith. sign in

REVIEW 1 cited by

Training Recommender Systems at Scale: Communication-Efficient Model and Data Parallelism

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 2010.08899 v2 pith:5V6VY46G submitted 2020-10-18 cs.LG cs.DCstat.ML

classification cs.LGcs.DCstat.ML
keywords trainingcommunicationmodelparallelismdataduringnetworkonly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this paper, we consider hybrid parallelism -- a paradigm that employs both Data Parallelism (DP) and Model Parallelism (MP) -- to scale distributed training of large recommendation models. We propose a compression framework called Dynamic Communication Thresholding (DCT) for communication-efficient hybrid training. DCT filters the entities to be communicated across the network through a simple hard-thresholding function, allowing only the most relevant information to pass through. For communication efficient DP, DCT compresses the parameter gradients sent to the parameter server during model synchronization. The threshold is updated only once every few thousand iterations to reduce the computational overhead of compression. For communication efficient MP, DCT incorporates a novel technique to compress the activations and gradients sent across the network during the forward and backward propagation, respectively. This is done by identifying and updating only the most relevant neurons of the neural network for each training sample in the data. We evaluate DCT on publicly available natural language processing and recommender models and datasets, as well as recommendation systems used in production at Facebook. DCT reduces communication by at least $100\times$ and $20\times$ during DP and MP, respectively. The algorithm has been deployed in production, and it improves end-to-end training time for a state-of-the-art industrial recommender model by 37\%, without any loss in performance.

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. DISCD: Distributed Lossy Semantic Communication for Logical Deduction of Hypothesis

    cs.IT 2025-02 conditional novelty 4.0 of 10

    A distributed lossy semantic communication method that transmits the most content-informative first-order logic sentences improves hypothesis deduction accuracy per bit compared with random selection.

Pith tools