Hierarchical Structured Neural Network: Efficient Retrieval Scaling For Large Scale Recommendation

Abstract

Retrieval, the initial stage of a recommendation system, is tasked with down-selecting items from a pool of tens of millions of candidates to a few thousands. Embedding Based Retrieval (EBR) has been a typical choice for this problem, addressing the computational demands of deep neural networks across vast item corpora. EBR utilizes Two Tower or Siamese Networks to learn representations for users and items, and employ Approximate Nearest Neighbor (ANN) search to efficiently retrieve relevant items. Despite its popularity in industry, EBR faces limitations. The Two Tower architecture, relying on a single dot product interaction, struggles to capture complex data distributions due to limited capability in learning expressive interactions between users and items. Additionally, ANN index building and representation learning for user and item are often separate, leading to inconsistencies exacerbated by representation (e.g. continuous online training) and item drift (e.g. items expired and

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyrangadurai2024hierarchical

Related papers

• Deep Retrieval: Learning A Retrievable Structure For Large-scale Recommendations (2020)0.00
• Domain-adaptive And Scalable Dense Retrieval For Content-based Recommendation (2026)0.00
• Divide And Conquer: Towards Better Embedding-based Retrieval For Recommender Systems From A Multi-task Perspective (2023)7.16
• Gpu-accelerated Multi-relational Parallel Graph Retrieval For Web-scale Recommendations (2025)0.00
• Path-based Deep Network For Candidate Item Matching In Recommenders (2021)7.81
• Progressively Optimized Bi-granular Document Representation For Scalable Embedding Based Retrieval (2022)11.06
• An Efficient Embedding Based Ad Retrieval With Gpu-powered Feature Interaction (2025)0.00
• ESANS: Effective And Semantic-aware Negative Sampling For Large-scale Retrieval Systems (2025)2.26