aiqbench analysis
This research introduces a scalable framework for graph-based recommendations by combining adaptive coarsening with multi-step label propagation, specifically targeting efficiency challenges in massive telecommunications networks. The study demonstrates that reducing graph size while preserving structural integrity can significantly boost predictive metrics like NDCG@5 without the heavy computational cost of training large Graph Neural Networks on full datasets. For practitioners balancing latency and accuracy in industrial recommendation systems, this approach offers a viable path to deploying high-performance models at scale using lightweight algorithms.
Efficient Recommendations via Graph Coarsening and Label Propagation
arXiv:2607.22287v1 Announce Type: new Abstract: Graph-based recommendations are widely adopted in real-world industrial applications. However, graphs in these systems often reach a massive scale, posing notable scalability and efficiency challenges. This requires techniques that can effectively balance predictive quality with computational cost. One promising approach is graph coarsening, an adaptive graph reduction technique that offers a way to systematically construct smaller, yet structurally representative, versions of the original large-scale graphs. In this work, we propose a flexible two-stage diffusion framework that combines graph coarsening with multi-step label propagation in the telecommunications domain. Domain-specific heuristics are applied to first aggregate nodes into meaningful communities, reducing graph size while preserving essential business-relevant relationships. An initial diffusion process done by a Label Propagation Algorithm (LPA) or a Graph Neural Network (GNN) propagates labels across the coarsened graph to produce coarse-grained predictions. Finally, a second LPA within subgraphs generates the final recommendations for individual users. On a real-world telecommunications dataset, when using LPA in both stages, our method achieves up to +24% NDCG@5 over the full-graph LPA baseline. Incorporating a lightweight GNN in the first stage further boosts NDCG@5 by more than 50%, but requires substantial training and inference time. Through extensive experiments and a detailed ablation, we quantify these trade-offs and demonstrate that our coarsening-driven approach delivers an optimal balance between scalability, latency, and recommendation quality.
Abstract:Graph-based recommendations are widely adopted in real-world industrial applications. However, graphs in these systems often reach a massive scale, posing notable scalability and efficiency challenges. This requires techniques that can effectively balance predictive quality with computational cost. One promising approach is graph coarsening, an adaptive graph reduction technique that offers a way to systematically construct smaller, yet structurally representative, versions of the original large-scale graphs. In this work, we propose a flexible two-stage diffusion framework that combines graph coarsening with multi-step label propagation in the telecommunications domain. Domain-specific heuristics are applied to first aggregate nodes into meaningful communities, reducing graph size while preserving essential business-relevant relationships. An initial diffusion process done by a Label Propagation Algorithm (LPA) or a Graph Neural Network (GNN) propagates labels across the coarsened graph to produce coarse-grained predictions. Finally, a second LPA within subgraphs generates the final recommendations for individual users. On a real-world telecommunications dataset, when using LPA in both stages, our method achieves up to +24% NDCG@5 over the full-graph LPA baseline. Incorporating a lightweight GNN in the first stage further boosts NDCG@5 by more than 50%, but requires substantial training and inference time. Through extensive experiments and a detailed ablation, we quantify these trade-offs and demonstrate that our coarsening-driven approach delivers an optimal balance between scalability, latency, and recommendation quality.
Machine Learning (cs.LG)
arXiv:2607.22287 [cs.LG]
(or arXiv:2607.22287v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2607.22287 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 312 words
Related coverage
ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions
arXiv · Jul 30, 2026
CoRe-GNN: Multilevel Message passing on Coarsened graphs
arXiv · Aug 4, 2026
Algebraic Multigrid Acceleration for Efficient Label Spreading
arXiv · Aug 28, 2026
Particle Competition and Cooperation for Robust Graph Convolutional Network Learning Under Label Noise
arXiv · Sep 21, 2026