mlsanityData to 7 Oct 2026

M2GRL: A Multi-task Multi-view Graph Representation Learning Framework for Web-scale Recommender Systems

arXiv 2005.10110 ↗First posted 20 May 2020cs.IR cs.LGcited by 21

Not on the map. Why?

Abstract (arXiv)

Combining graph representation learning with multi-view data (side information) for recommendation is a trend in industry. Most existing methods can be categorized as multi-view representation fusion; they first build one graph and then integrate multi-view data into a single compact representation for each node in the graph. However, these methods are raising concerns in both engineering and algorithm aspects: 1) multi-view data are abundant and informative in industry and may exceed the capacity of one single vector, and 2) inductive bias may be introduced as multi-view data are often from different distributions. In this paper, we use a multi-view representation alignment approach to address this issue. Particularly, we propose a multi-task multi-view graph representation learning framework (M2GRL) to learn node representations from multi-view graphs for web-scale recommender systems. M2GRL constructs one graph for each single-view data, learns multiple separate representations from multiple graphs, and performs alignment to model cross-view relations. M2GRL chooses a multi-task learning paradigm to learn intra-view representations and cross-view relations jointly. Besides, M2GRL applies homoscedastic uncertainty to adaptively tune the loss weights of tasks during training. We deploy M2GRL at Taobao and train it on 57 billion examples. According to offline metrics and online A/B tests, M2GRL significantly outperforms other state-of-the-art algorithms. Further exploration on diversity recommendation in Taobao shows the effectiveness of utilizing multiple representations produced by method, which we argue is a promising direction for various industrial recommendation tasks of different focus.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 May 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 4; 2023: 2; 2024: 5; 2025: 4; 2026: 1.

21 papers.

Sort:

  1. 2022A Survey on Graph Representation Learning Methodscited by 66
  2. 2024Fair Resource Allocation in Multi-Task Learningcited by 34
  3. 2022Region Embedding with Intra and Inter-View Contrastive Learningcited by 24
  4. 2023Embedding in Recommender Systems: A Surveycited by 19
  5. 2024Double Correction Framework for Denoising Recommendationcited by 19
  6. 2021Beyond NDCG: behavioral testing of recommender systems with RecListcited by 8
  7. 2021Heterogeneous Graph Neural Network with Multi-view Representation Learningcited by 7
  8. 2024Heterophily-Aware Fair Recommendation using Graph Convolutional Networkscited by 7
  9. 2025LDC-MTL: Balancing Multi-Task Learning through Scalable Loss Discrepancy Controlcited by 7
  10. 2022Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendationcited by 6
  11. 2021Multi-Relational Graph based Heterogeneous Multi-Task Learning in Community Question Answeringcited by 4
  12. 2025Graph Contrastive Learning on Multi-label Classification for Recommendationscited by 2
9 more
  1. 2022View-Invariant Skeleton-based Action Recognition via Global-Local Contrastive Learningcited by 1
  2. 2024Multi-Relational Graph Neural Network for Out-of-Domain Link Predictioncited by 1
  3. 2024Hierarchical Structure Sharing Empowers Multi-task Heterogeneous GNNs for Customer Expansioncited by 1
  4. 2025A Re-node Self-training Approach for Deep Graph-based Semi-supervised Classification on Multi-view Image Datacited by 1
  5. 2021A Behavior-aware Graph Convolution Network Model for Video Recommendationcited by 0
  6. 2021Incentive Compatible Pareto Alignment for Multi-Source Large Graphscited by 0
  7. 2023Methodologies for Improving Modern Industrial Recommender Systemscited by 0
  8. 2025Entity Representation Learning Through Onsite-Offsite Graph for Pinterest Adscited by 0
  9. 2026Efficient Recommendations via Graph Coarsening and Label Propagationcited by 0