A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-off Perspective

• URL: http://arxiv.org/abs/2510.23507v1
• Date: Mon, 27 Oct 2025 16:40:52 GMT
• Title: A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-off Perspective
• Abstract summary: We introduce emphDFNMF, an end-to-end deep nonnegative tri-factorization tailored to graphs.<n>A single parameter $lambda$ tunes the fairness--utility balance, while nonnegativity yields parts-based factors and transparent soft memberships.<n>Across synthetic and real networks, DFNMF achieves substantially higher group balance at comparable modularity.
• Score: 0.7568373895297608
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fair graph clustering seeks partitions that respect network structure while maintaining proportional representation across sensitive groups, with applications spanning community detection, team formation, resource allocation, and social network analysis. Many existing approaches enforce rigid constraints or rely on multi-stage pipelines (e.g., spectral embedding followed by $k$-means), limiting trade-off control, interpretability, and scalability. We introduce \emph{DFNMF}, an end-to-end deep nonnegative tri-factorization tailored to graphs that directly optimizes cluster assignments with a soft statistical-parity regularizer. A single parameter $\lambda$ tunes the fairness--utility balance, while nonnegativity yields parts-based factors and transparent soft memberships. The optimization uses sparse-friendly alternating updates and scales near-linearly with the number of edges. Across synthetic and real networks, DFNMF achieves substantially higher group balance at comparable modularity, often dominating state-of-the-art baselines on the Pareto front. The code is available at https://github.com/SiamakGhodsi/DFNMF.git.

Related papers

• Subgraph Filtering for Fair Graph Neural Networks [4.075849063907074]
  Graph neural networks (GNNs) can exhibit unfair behavior even when sensitive attributes are excluded from node features.<n>We propose Subgraph Filtering for Fair Graph Neural Networks (SF-GNN)<n>SF-GNN identifies bias-prone edges by combining sensitive homophily with structural propagation amplifiers.<n>It then incorporates edge filtering into each message-passing step to selectively downweight or remove these edges while preserving the remaining graph structure.
  arXiv  Detail & Related papers  (2026-08-26T22:40:31Z)
• Beyond Instance-Level Alignment and Uniformity: Semantic Factor Learning for Collaborative Filtering [1.5984637249476494]
  Collaborative filtering (CF) is widely used in recommender systems (RecSys) due to its simplicity and efficiency.<n>Existing CF methods follow an instance-level learning paradigm.<n>We propose Semantic Factor enhanced Alignment and Uniformity (SaFeAU), a novel framework that augments interacted instances with semantic factors.<n>SaFeAU consistently outperforms GCN-based and MF-based state-of-the-art CF methods in both recommendation accuracy and computational efficiency.
  arXiv  Detail & Related papers  (2026-05-29T15:15:21Z)
• Generalizing GNNs with Tokenized Mixture of Experts [75.8310720413187]
  We show that improving stability requires reducing reliance on shift-sensitive features, leaving an irreducible worst-case generalization floor.<n>We propose STEM-GNN, a pretrain-then-finetune framework with a mixture-of-experts encoder for diverse computation paths.<n>Across nine node, link, and graph benchmarks, STEM-GNN achieves a stronger three-way balance, improving robustness to degree/homophily shifts and to feature/edge corruptions while remaining competitive on clean graphs.
  arXiv  Detail & Related papers  (2026-02-09T22:48:30Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• Mean-Field Control on Sparse Graphs: From Local Limits to GNNs via Neighborhood Distributions [5.081469534056712]
  Mean-field control (MFC) offers a scalable solution to the curse of dimensionality in multi-agent systems.<n>We bridge the gap to real-world network structures by proposing a rigorous framework for MFC on large sparse graphs.
  arXiv  Detail & Related papers  (2026-01-29T09:57:48Z)
• Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression [55.51959317490934]
  Large language models (LLMs) have demonstrated promising capabilities in Text-Attributed Graph (TAG) understanding.<n>We argue that graphs inherently contain rich structural and semantic information, and that their effective exploitation can unlock potential gains in LLMs reasoning performance.<n>We propose Homophily-aware Structural and Semantic Compression for LLMs (HS2C), a framework centered on exploiting graph homophily.
  arXiv  Detail & Related papers  (2026-01-13T03:35:18Z)
• GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning [50.40400074353263]
  Graph Neural Networks (GNNs) are powerful tools for precessing relational data but often struggle to generalize to unseen graphs.<n>We introduce textbfGraph textbfIn-context textbfL textbfTransformer (GILT), a framework built on an LLM-free and tuning-free architecture.
  arXiv  Detail & Related papers  (2025-10-06T08:09:15Z)
• Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum [78.27945336558987]
  Decentralized server (DFL) eliminates reliance on client-client architecture.<n>Non-smooth regularization is often incorporated into machine learning tasks.<n>We propose a novel novel DNCFL algorithm to solve these problems.
  arXiv  Detail & Related papers  (2025-04-17T08:32:25Z)
• Towards Unbiased Federated Graph Learning: Label and Topology Perspectives [30.103014192157115]
  Federated Graph Learning (FGL) enables privacy-preserving, distributed training of graph neural networks without sharing raw data.<n>We propose FairFGL, a novel framework that enhances fairness through fine-grained graph mining and collaborative learning.
  arXiv  Detail & Related papers  (2025-04-14T08:00:20Z)
• Sharper Error Bounds in Late Fusion Multi-view Clustering Using Eigenvalue Proportion [19.46433323866636]
  Multi-view clustering (MVC) aims to integrate complementary information from multiple views to enhance clustering performance.<n>We present a novel theoretical framework for analyzing the generalization error bounds of multiple kernel $k$-means.<n>We propose a low-pass graph filtering strategy within a multiple linear $k$-means framework to mitigate noise and redundancy.
  arXiv  Detail & Related papers  (2024-12-24T06:24:08Z)
• Chasing Fairness in Graphs: A GNN Architecture Perspective [73.43111851492593]
  We propose textsfFair textsfMessage textsfPassing (FMP) designed within a unified optimization framework for graph neural networks (GNNs) In FMP, the aggregation is first adopted to utilize neighbors' information and then the bias mitigation step explicitly pushes demographic group node presentation centers together. Experiments on node classification tasks demonstrate that the proposed FMP outperforms several baselines in terms of fairness and accuracy on three real-world datasets.
  arXiv  Detail & Related papers  (2023-12-19T18:00:15Z)
• AttenScribble: Attentive Similarity Learning for Scribble-Supervised Medical Image Segmentation [5.8447004333496855]
  In this paper, we present a straightforward yet effective scribble supervised learning framework. We create a pluggable spatial self-attention module which could be attached on top of any internal feature layers of arbitrary fully convolutional network (FCN) backbone. This attentive similarity leads to a novel regularization loss that imposes consistency between segmentation prediction and visual affinity.
  arXiv  Detail & Related papers  (2023-12-11T18:42:18Z)
• Client Orchestration and Cost-Efficient Joint Optimization for NOMA-Enabled Hierarchical Federated Learning [55.49099125128281]
  We propose a non-orthogonal multiple access (NOMA) enabled HFL system under semi-synchronous cloud model aggregation. We show that the proposed scheme outperforms the considered benchmarks regarding HFL performance improvement and total cost reduction.
  arXiv  Detail & Related papers  (2023-11-03T13:34:44Z)
• Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding [57.71603937699949]
  We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs. We show that the threshold on the number of training samples increases with the increase in the network width.
  arXiv  Detail & Related papers  (2023-09-12T13:03:47Z)
• Graph Neural Network Surrogates of Fair Graph Filtering [13.854091527965297]
  We introduce a filter-aware universal approximation framework for posterior objectives. This defines appropriate graph neural networks trained at runtime to be similar to filters. We show that our approach performs equally well or better than alternatives in meeting parity constraints.
  arXiv  Detail & Related papers  (2023-03-14T18:14:40Z)
• Crowd Counting via Perspective-Guided Fractional-Dilation Convolution [75.36662947203192]
  This paper proposes a novel convolution neural network-based crowd counting method, termed Perspective-guided Fractional-Dilation Network (PFDNet) By modeling the continuous scale variations, the proposed PFDNet is able to select the proper fractional dilation kernels for adapting to different spatial locations. It significantly improves the flexibility of the state-of-the-arts that only consider the discrete representative scales.
  arXiv  Detail & Related papers  (2021-07-08T07:57:00Z)

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.