mlsanityData to 7 Oct 2026

Hi-SAM: A Hierarchical Structure-Aware Multi-modal Framework for Large-Scale Recommendation

arXiv 2602.11799 ↗First posted 12 Feb 2026cs.AI cs.IRcited by 1

Not on the map. Why?

Abstract (arXiv)

Multi-modal recommendation has gained traction as items possess rich attributes like text and images. Semantic ID-based approaches effectively discretize this information into compact tokens. However, two challenges persist: (1) Suboptimal Tokenization: existing methods (e.g., RQ-VAE) lack disentanglement between shared cross-modal semantics and modality-specific details, causing redundancy or collapse; (2) Architecture-Data Mismatch: vanilla Transformers treat semantic IDs as flat streams, ignoring the hierarchy of user interactions, items, and tokens. Expanding items into multiple tokens amplifies length and noise, biasing attention toward local details over holistic semantics. We propose Hi-SAM, a Hierarchical Structure-Aware Multi-modal framework with two designs: (1) Disentangled Semantic Tokenizer (DST): unifies modalities via geometry-aware alignment and quantizes them via a coarse-to-fine strategy. Shared codebooks distill consensus while modality-specific ones recover nuances from residuals, enforced by mutual information minimization; (2) Hierarchical Memory-Anchor Transformer (HMAT): splits positional encoding into inter- and intra-item subspaces via Hierarchical RoPE to restore hierarchy. It inserts Anchor Tokens to condense items into compact memory, retaining details for the current item while accessing history only through compressed summaries. Experiments on real-world datasets show consistent improvements over SOTA baselines, especially in cold-start scenarios. Deployed on a large-scale social platform serving millions of users, Hi-SAM achieved a 6.55% gain in the core online metric.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 44 of its 66 references that are in the map. First posted on arXiv 12 Feb 2026.

Builds on

44 of 66 references.

References · 44

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2023BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Modelscited by 6,069
  5. 2023Qwen Technical Reportcited by 3,273
  6. 2018Self-Attentive Sequential Recommendationcited by 1,169
  7. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  8. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
  9. 2021SoundStream: An End-to-End Neural Audio Codeccited by 756
  10. 2016Wide & Deep Learning for Recommender Systemscited by 745
  11. 2022Autoregressive Image Generation using Residual Quantizationcited by 706
  12. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
32 more
  1. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  2. 2022Recommendation as Language Processing (RLP): A Unified Pretrain, Personalized Prompt & Predict Paradigm (P5)cited by 396
  3. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  4. 2023A Survey on Large Language Models for Recommendationcited by 378
  5. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  6. 2023TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendationcited by 336
  7. 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
  8. 2022Balanced Multimodal Learning via On-the-fly Gradient Modulationcited by 259
  9. 2023Multimodal Deep Learningcited by 257
  10. 2020CLUB: A Contrastive Log-ratio Upper Bound of Mutual Informationcited by 233
  11. 2023Recommender Systems with Generative Retrievalcited by 191
  12. 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 172
  13. 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
  14. 2023Where to Go Next for Recommender Systems? ID- vs. Modality-based Recommender Models Revisitedcited by 124
  15. 2022Towards Universal Sequence Representation Learning for Recommender Systemscited by 120
  16. 2022Learning Vector-Quantized Item Representation for Transferable Sequential Recommenderscited by 112
  17. 2023CoLLM: Integrating Collaborative Embeddings into Large Language Models for Recommendationcited by 99
  18. 2021Mining Latent Structures for Multimedia Recommendationcited by 79
  19. 2024Wukong: Towards a Scaling Law for Large-Scale Recommendationcited by 72
  20. 2024Gramian Multimodal Representation Learning and Alignmentcited by 52
  21. 2023Better Generalization with Semantic IDs: A Case Study in Ranking for Recommendationscited by 50
  22. 2025MTGR: Industrial-Scale Generative Recommendation Framework in Meituancited by 47
  23. 2023Multi-Modal Self-Supervised Learning for Recommendationcited by 44
  24. 2022Understanding Scaling Laws for Recommendation Modelscited by 38
  25. 2021Scaling Law for Recommendation Models: Towards General-purpose User Representationscited by 26
  26. 2023Scaling Law of Large Sequential Recommendation Modelscited by 23
  27. 2021Latent Structure Mining with Contrastive Modality Fusion for Multimedia Recommendationcited by 18
  28. 2020SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedbackcited by 15
  29. 2025Climber: Toward Efficient Scaling Laws for Large Recommendation Modelscited by 8
  30. 2025VT-FSL: Bridging Vision and Text with LLMs for Few-Shot Learningcited by 7
  31. 2025Progressive Semantic Residual Quantization for Multimodal-Joint Interest Modeling in Music Recommendationcited by 3
  32. 2026When Text-as-Vision Meets Semantic IDs in Generative Recommendation: An Empirical Studycited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.