Pith. sign in

REVIEW 1 cited by

The Architectural Implications of Facebook's DNN-based Personalized Recommendation

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 1906.03109 v4 pith:AET7FVDP submitted 2019-06-06 cs.DC cs.LG

classification cs.DCcs.LG
keywords recommendationpersonalizeddeepmodelsoptimizationresearchworkloadsaccomplished
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The widespread application of deep learning has changed the landscape of computation in the data center. In particular, personalized recommendation for content ranking is now largely accomplished leveraging deep neural networks. However, despite the importance of these models and the amount of compute cycles they consume, relatively little research attention has been devoted to systems for recommendation. To facilitate research and to advance the understanding of these workloads, this paper presents a set of real-world, production-scale DNNs for personalized recommendation coupled with relevant performance metrics for evaluation. In addition to releasing a set of open-source workloads, we conduct in-depth analysis that underpins future system design and optimization for at-scale recommendation: Inference latency varies by 60% across three Intel server generations, batching and co-location of inferences can drastically improve latency-bounded throughput, and the diverse composition of recommendation models leads to different optimization strategies.

Discussion (0). Sign in 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. HE-LRM: Encrypted Deep Learning Recommendation Models using Fully Homomorphic Encryption

    cs.CR 2025-06 conditional novelty 6.0 of 10

    Client-side digit decomposition and block-diagonal packing enable server-side private embedding lookups in FHE, cutting embedding-lookup latency by up to 56x versus CodedHeLUT and enabling end-to-end encrypted DLRM in...

Pith tools