mlsanityData to 14 Oct 2026

RecBundle: A Next-Generation Geometric Paradigm for Explainable Recommender Systems

arXiv 2603.16088 ↗First posted 17 Mar 2026cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Recommender systems are inherently dynamic feedback loops where prolonged local interactions accumulate into macroscopic structural degradation such as information cocoons. Existing representation learning paradigms are universally constrained by the assumption of a single flat space, forcing topologically grounded user associations and semantically driven historical interactions to be fitted within the same vector space. This excessive coupling of heterogeneous information renders it impossible for researchers to mechanistically distinguish and identify the sources of systemic bias. To overcome this theoretical bottleneck, we introduce Fiber Bundle from modern differential geometry and propose a novel geometric analysis paradigm for recommender systems. This theory naturally decouples the system space into two hierarchical layers: the base manifold formed by user interaction networks, and the fibers attached to individual user nodes that carry their dynamic preferences. Building upon this, we construct RecBundle, a framework oriented toward next-generation recommender systems that formalizes user collaboration as geometric connection and parallel transport on the base manifold, while mapping content evolution to holonomy transformations on fibers. From this foundation, we identify future application directions encompassing quantitative mechanisms for information cocoons and evolutionary bias, geometric meta-theory for adaptive recommendation, and novel inference architectures integrating large language models (LLMs). Empirical analysis on real-world MovieLens and Amazon Beauty datasets validates the effectiveness of this geometric framework.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 39 references that are in the map. First posted on arXiv 17 Mar 2026.

Builds on

22 of 39 references.

References · 22

  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  2. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
  3. 2019Meta-Learning with Implicit Gradientscited by 525
  4. 2018TADAM: Task dependent adaptive metric for improved few-shot learningcited by 408
  5. 2020Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networkscited by 153
  6. 2019MeLU: Meta-Learned User Preference Estimator for Cold-Start Recommendationcited by 121
  7. 2018An elementary introduction to information geometrycited by 76
  8. 2019Hierarchically Structured Meta-learningcited by 68
  9. 2025Virgo: A Preliminary Exploration on Reproducing o1-like MLLMcited by 68
  10. 2024Enhancing LLM Reasoning with Reward-guided Tree Searchcited by 58
  11. 2020Interpretable Rumor Detection in Microblogs by Attending to User Interactionscited by 44
  12. 2020MAMO: Memory-Augmented Meta-Optimization for Cold-start Recommendationcited by 39
10 more
  1. 2022User-controllable Recommendation Against Filter Bubblescited by 22
  2. 2020MetaSelector: Meta-Learning for Recommendation with User-Level Adaptive Model Selectioncited by 13
  3. 2023Reconciling the accuracy-diversity trade-off in recommendationscited by 10
  4. 2021Bundle Networks: Fiber Bundles, Local Trivializations, and a Generative Approach to Exploring Many-to-one Mapscited by 7
  5. 2024On Practical Diversified Recommendation with Controllable Category Diversity Frameworkcited by 7
  6. 2025Enhancing Large Language Models through Structured Reasoningcited by 5
  7. 2019Rapidly-Exploring Quotient-Space Trees: Motion Planning using Sequential Simplificationscited by 3
  8. 2020Multilevel Motion Planning: A Fiber Bundle Formulationcited by 2
  9. 2018Quotient-Space Motion Planningcited by 1
  10. 2025Alleviating User-Sensitive bias with Fair Generative Sequential Recommendation Modelcited by 1

Built on by

Not cited yet.