Pith. sign in

REVIEW 3 cited by

LinkSAGE: Optimizing Job Matching Using Graph Neural Networks

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 2402.13430 v1 pith:VJWYWPVI submitted 2024-02-20 cs.LG cs.AIcs.SI

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

We present LinkSAGE, an innovative framework that integrates Graph Neural Networks (GNNs) into large-scale personalized job matching systems, designed to address the complex dynamics of LinkedIns extensive professional network. Our approach capitalizes on a novel job marketplace graph, the largest and most intricate of its kind in industry, with billions of nodes and edges. This graph is not merely extensive but also richly detailed, encompassing member and job nodes along with key attributes, thus creating an expansive and interwoven network. A key innovation in LinkSAGE is its training and serving methodology, which effectively combines inductive graph learning on a heterogeneous, evolving graph with an encoder-decoder GNN model. This methodology decouples the training of the GNN model from that of existing Deep Neural Nets (DNN) models, eliminating the need for frequent GNN retraining while maintaining up-to-date graph signals in near realtime, allowing for the effective integration of GNN insights through transfer learning. The subsequent nearline inference system serves the GNN encoder within a real-world setting, significantly reducing online latency and obviating the need for costly real-time GNN infrastructure. Validated across multiple online A/B tests in diverse product scenarios, LinkSAGE demonstrates marked improvements in member engagement, relevance matching, and member retention, confirming its generalizability and practical impact.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Off-Policy Evaluation and Learning for Matching Markets

    cs.LG 2025-07 conditional novelty 7.0 of 10

    DiPS and DPR are new OPE estimators for matching markets that exploit the two-stage reward structure to reduce variance while controlling bias.

  2. A Scalable and Efficient Signal Integration System for Job Matching

    cs.LG 2025-07 conditional novelty 4.0 of 10

    STAR integrates fine-tuned LLM embeddings as node features into a large-scale GNN, improving job matching metrics across three LinkedIn products.

  3. Large Scalable Cross-Domain Graph Neural Networks for Personalized Notification at LinkedIn

    cs.LG 2025-06 conditional novelty 4.0 of 10

    At LinkedIn, a cross-domain GNN trained on a unified 8.6 billion-node graph with temporal modeling and multi-task learning reports a 0.62% CTR lift and a 0.10% WAU lift online.

Pith tools