How Does Topology Bias Distort Message Passing? A Dirichlet Energy Perspective

• URL: http://arxiv.org/abs/2411.13892v2
• Date: Tue, 20 May 2025 05:38:53 GMT
• Title: How Does Topology Bias Distort Message Passing? A Dirichlet Energy Perspective
• Authors: Yanbiao Ji, Yue Ding, Dan Luo, Chang Liu, Yuxiang Lu, Xin Xin, Hongtao Lu,
• Abstract summary: We show how graph-based recommender systems are undermined by popularity bias.<n>This bias leads to overrepresentation of popular items, reinforcing biases and fairness issues through the user-system feedback loop.<n>We propose Test-time Simplicial propagation, which extends message passing to higher-order simplicial complexes.
• Score: 21.257609475244223
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph-based recommender systems have achieved remarkable effectiveness by modeling high-order interactions between users and items. However, such approaches are significantly undermined by popularity bias, which distorts the interaction graph's structure, referred to as topology bias. This leads to overrepresentation of popular items, thereby reinforcing biases and fairness issues through the user-system feedback loop. Despite attempts to study this effect, most prior work focuses on the embedding or gradient level bias, overlooking how topology bias fundamentally distorts the message passing process itself. We bridge this gap by providing an empirical and theoretical analysis from a Dirichlet energy perspective, revealing that graph message passing inherently amplifies topology bias and consistently benefits highly connected nodes. To address these limitations, we propose Test-time Simplicial Propagation (TSP), which extends message passing to higher-order simplicial complexes. By incorporating richer structures beyond pairwise connections, TSP mitigates harmful topology bias and substantially improves the representation and recommendation of long-tail items during inference. Extensive experiments across five real-world datasets demonstrate the superiority of our approach in mitigating topology bias and enhancing recommendation quality.

Related papers

• CoATA: Effective Co-Augmentation of Topology and Attribute for Graph Neural Networks [4.284944931789759]
  CoATA is a dual-channel GNN framework specifically designed for the Co-Augmentation of Topology and Attribute.<n>CoATA introduces contrastive learning, leveraging prototype alignment and consistency constraints, to facilitate mutual corrections between the augmented and original graphs.
  arXiv  Detail & Related papers  (2025-06-27T15:11:49Z)
• Understanding the Information Propagation Effects of Communication Topologies in LLM-based Multi-Agent Systems [58.95962217043371]
  We present a causal framework to analyze how agent outputs, whether correct or erroneous, propagate under topologies with varying sparsity.<n>Our empirical studies reveal that moderately sparse topologies, which effectively suppress error propagation while preserving beneficial information diffusion, typically achieve optimal task performance.<n>We propose a novel topology design approach, EIB-leanrner, that balances error suppression and beneficial information propagation by fusing connectivity patterns from both dense and sparse graphs.
  arXiv  Detail & Related papers  (2025-05-29T11:21:48Z)
• Recommendation System in Advertising and Streaming Media: Unsupervised Data Enhancement Sequence Suggestions [2.9633211091806997]
  We introduce a novel framework, Global Unsupervised Data-Augmentation (UDA4SR), which adopts a graph contrastive learning perspective to generate robust item embeddings for sequential recommendation. Our approach begins by integrating Generative Adrial Networks (GANs) for data augmentation, which serves as the first step to enhance the diversity and richness of the training data. To model users' dynamic and diverse interests more effectively, we enhance the CapsNet module with a novel target-attention mechanism.
  arXiv  Detail & Related papers  (2025-03-23T06:30:48Z)
• BiasConnect: Investigating Bias Interactions in Text-to-Image Models [73.76853483463836]
  We introduce BiasConnect, a novel tool designed to analyze and quantify bias interactions in Text-to-Image models.<n>Our method provides empirical estimates that indicate how other bias dimensions shift toward or away from an ideal distribution when a given bias is modified.<n>We demonstrate the utility of BiasConnect for selecting optimal bias mitigation axes, comparing different TTI models on the dependencies they learn, and understanding the amplification of intersectional societal biases in TTI models.
  arXiv  Detail & Related papers  (2025-03-12T19:01:41Z)
• Graph Foundation Models for Recommendation: A Comprehensive Survey [55.70529188101446]
  Large language models (LLMs) are designed to process and comprehend natural language, making both approaches highly effective and widely adopted. Recent research has focused on graph foundation models (GFMs) GFMs integrate the strengths of GNNs and LLMs to model complex RS problems more efficiently by leveraging the graph-based structure of user-item relationships alongside textual understanding.
  arXiv  Detail & Related papers  (2025-02-12T12:13:51Z)
• RelGNN: Composite Message Passing for Relational Deep Learning [56.48834369525997]
  We introduce RelGNN, a novel GNN framework specifically designed to capture the unique characteristics of relational databases. At the core of our approach is the introduction of atomic routes, which are sequences of nodes forming high-order tripartite structures. RelGNN consistently achieves state-of-the-art accuracy with up to 25% improvement.
  arXiv  Detail & Related papers  (2025-02-10T18:58:40Z)
• Hypergraph Diffusion for High-Order Recommender Systems [5.71357784811215]
  We introduce WaveHDNN, an innovative wavelet-enhanced hypergraph diffusion framework. WaveHDNN integrates a Heterophily-aware Collaborative, designed to capture user-item interactions across diverse categories, with a Multi-scale Group-wise Structure. Cross-view contrastive learning is employed to maintain robust and consistent representations.
  arXiv  Detail & Related papers  (2025-01-28T05:59:29Z)
• Multi-Channel Hypergraph Contrastive Learning for Matrix Completion [37.05130230844348]
  Graph neural networks (GNNs) have been widely used in matrix completion, which captures users' preferences over items. We propose a Multi-Channel Hypergraph Contrastive Learning framework for matrix completion, named MHCL. Experiments on five public datasets demonstrate that the proposed method significantly outperforms the current state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-11-02T22:59:36Z)
• Causality and Independence Enhancement for Biased Node Classification [56.38828085943763]
  We propose a novel Causality and Independence Enhancement (CIE) framework, applicable to various graph neural networks (GNNs) Our approach estimates causal and spurious features at the node representation level and mitigates the influence of spurious correlations. Our approach CIE not only significantly enhances the performance of GNNs but outperforms state-of-the-art debiased node classification methods.
  arXiv  Detail & Related papers  (2023-10-14T13:56:24Z)
• GUESR: A Global Unsupervised Data-Enhancement with Bucket-Cluster Sampling for Sequential Recommendation [58.6450834556133]
  We propose graph contrastive learning to enhance item representations with complex associations from the global view. We extend the CapsNet module with the elaborately introduced target-attention mechanism to derive users' dynamic preferences. Our proposed GUESR could not only achieve significant improvements but also could be regarded as a general enhancement strategy.
  arXiv  Detail & Related papers  (2023-03-01T05:46:36Z)
• Self-supervised Graph-based Point-of-interest Recommendation [66.58064122520747]
  Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce. We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation. In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
  arXiv  Detail & Related papers  (2022-10-22T17:29:34Z)
• The Devil is in the Conflict: Disentangled Information Graph Neural Networks for Fraud Detection [17.254383007779616]
  We argue that the performance degradation is mainly attributed to the inconsistency between topology and attribute. We propose a simple and effective method that uses the attention mechanism to adaptively fuse two views. Our model can significantly outperform stateof-the-art baselines on real-world fraud detection datasets.
  arXiv  Detail & Related papers  (2022-10-22T08:21:49Z)
• Self-supervised debiasing using low rank regularization [59.84695042540525]
  Spurious correlations can cause strong biases in deep neural networks, impairing generalization ability. We propose a self-supervised debiasing framework potentially compatible with unlabeled samples. Remarkably, the proposed debiasing framework significantly improves the generalization performance of self-supervised learning baselines.
  arXiv  Detail & Related papers  (2022-10-11T08:26:19Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing [67.83086131278904]
  Topology-imbalance is a graph-specific imbalance problem caused by the uneven topology positions of labeled nodes. We propose a novel position-aware graph structure learning framework named PASTEL. Our key insight is to enhance the connectivity of nodes within the same class for more supervision information.
  arXiv  Detail & Related papers  (2022-08-17T14:04:21Z)
• Counterfactual Intervention Feature Transfer for Visible-Infrared Person Re-identification [69.45543438974963]
  We find graph-based methods in the visible-infrared person re-identification task (VI-ReID) suffer from bad generalization because of two issues. The well-trained input features weaken the learning of graph topology, making it not generalized enough during the inference process. We propose a Counterfactual Intervention Feature Transfer (CIFT) method to tackle these problems.
  arXiv  Detail & Related papers  (2022-08-01T16:15:31Z)
• Self-Supervised Hypergraph Transformer for Recommender Systems [25.07482350586435]
  Self-Supervised Hypergraph Transformer (SHT) Self-Supervised Hypergraph Transformer (SHT) Cross-view generative self-supervised learning component is proposed for data augmentation over the user-item interaction graph.
  arXiv  Detail & Related papers  (2022-07-28T18:40:30Z)
• Hypergraph Contrastive Collaborative Filtering [44.8586906335262]
  We propose a new self-supervised recommendation framework Hypergraph Contrastive Collaborative Filtering (HCCF) HCCF captures local and global collaborative relations with a hypergraph-enhanced cross-view contrastive learning architecture. Our model effectively integrates the hypergraph structure encoding with self-supervised learning to reinforce the representation quality of recommender systems.
  arXiv  Detail & Related papers  (2022-04-26T10:06:04Z)
• FMP: Toward Fair Graph Message Passing against Topology Bias [43.70672256020857]
  A textsfFair textsfMessage textsfPassing (FMP) scheme is proposed to aggregate useful information from neighbors but minimize the effect of topology bias. The proposed FMP is effective, transparent, and compatible with back-propagation training.
  arXiv  Detail & Related papers  (2022-02-08T23:00:26Z)
• Knowledge-Enhanced Hierarchical Graph Transformer Network for Multi-Behavior Recommendation [56.12499090935242]
  This work proposes a Knowledge-Enhanced Hierarchical Graph Transformer Network (KHGT) to investigate multi-typed interactive patterns between users and items in recommender systems. KHGT is built upon a graph-structured neural architecture to capture type-specific behavior characteristics. We show that KHGT consistently outperforms many state-of-the-art recommendation methods across various evaluation settings.
  arXiv  Detail & Related papers  (2021-10-08T09:44:00Z)
• Knowledge-aware Coupled Graph Neural Network for Social Recommendation [29.648300580880683]
  We propose a Knowledge-aware Coupled Graph Neural Network (KCGN) that injects the inter-dependent knowledge across items and users into the recommendation framework. KCGN enables the high-order user- and item-wise relation encoding by exploiting the mutual information for global graph structure awareness. We further augment KCGN with the capability of capturing dynamic multi-typed user-item interactive patterns.
  arXiv  Detail & Related papers  (2021-10-08T09:13:51Z)
• Adversarial Feature Augmentation and Normalization for Visual Recognition [109.6834687220478]
  Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models. Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings. We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
  arXiv  Detail & Related papers  (2021-03-22T20:36:34Z)
• Policy-GNN: Aggregation Optimization for Graph Neural Networks [60.50932472042379]
  Graph neural networks (GNNs) aim to model the local graph structures and capture the hierarchical patterns by aggregating the information from neighbors. It is a challenging task to develop an effective aggregation strategy for each node, given complex graphs and sparse features. We propose Policy-GNN, a meta-policy framework that models the sampling procedure and message passing of GNNs into a combined learning process.
  arXiv  Detail & Related papers  (2020-06-26T17:03:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.