Spectral Manifold Harmonization for Graph Imbalanced Regression

• URL: http://arxiv.org/abs/2507.01132v2
• Date: Fri, 11 Jul 2025 18:22:33 GMT
• Title: Spectral Manifold Harmonization for Graph Imbalanced Regression
• Authors: Brenda Nogueira, Gabe Gomes, Meng Jiang, Nitesh V. Chawla, Nuno Moniz,
• Abstract summary: We present Spectral Manifold Harmonization (SMH), a novel approach to address imbalanced regression challenges on graph-structured data.<n>SMH generates synthetic graph samples that preserve topological properties while focusing on the most relevant target distribution regions.<n> Experimental results demonstrate the potential of SMH on chemistry and drug discovery benchmark datasets.
• Score: 30.376583325991454
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph-structured data is ubiquitous in scientific domains, where models often face imbalanced learning settings. In imbalanced regression, domain preferences focus on specific target value ranges that represent the most scientifically valuable cases; however, we observe a significant lack of research regarding this challenge. In this paper, we present Spectral Manifold Harmonization (SMH), a novel approach to address imbalanced regression challenges on graph-structured data by generating synthetic graph samples that preserve topological properties while focusing on the most relevant target distribution regions. Conventional methods fail in this context because they either ignore graph topology in case generation or do not target specific domain ranges, resulting in models biased toward average target values. Experimental results demonstrate the potential of SMH on chemistry and drug discovery benchmark datasets, showing consistent improvements in predictive performance for target domain ranges. Code is available at https://github.com/brendacnogueira/smh-graph-imbalance.git.

Related papers

• A Theory of Random Graph Shift in Truncated-Spectrum vRKHS [26.195791008324495]
  This paper develops a theory of graph classification under domain shift through a random-graph generative lens.<n>We consider intra-class graphs sharing the same random graph model (RGM) and the domain shift induced by changes in RGM components.
  arXiv  Detail & Related papers  (2026-02-27T10:19:57Z)
• SPECTRA: Spectral Target-Aware Graph Augmentation for Imbalanced Molecular Property Regression [45.62053904749856]
  SPECTRA is a Spectral Target-Aware graph augmentation framework.<n>It generates realistic molecular graphs in the spectral domain.<n>It consistently improves error in relevant target ranges while maintaining competitive overall MAE.
  arXiv  Detail & Related papers  (2025-11-06T21:57:21Z)
• Semi-supervised Anomaly Detection with Extremely Limited Labels in Dynamic Graphs [5.415950005432774]
  We propose a novel GAD framework (EL$2$-DGAD) to tackle anomaly detection problem in dynamic graphs with extremely limited labels.<n>Specifically, a transformer-based graph encoder model is designed to more effectively preserve evolving graph structures beyond the local neighborhood.
  arXiv  Detail & Related papers  (2025-01-25T02:35:48Z)
• Distribution Learning for Molecular Regression [10.96062816455682]
  Distributional Mixture of Experts (DMoE) is a model-independent, and data-independent method for regression. We evaluate the performance of DMoE on different molecular property prediction datasets.
  arXiv  Detail & Related papers  (2024-07-30T00:21:51Z)
• Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models [22.421702511126373]
  We leverage statistical inference on block models to guide the development of a spectral clustering algorithm for directed graphs.<n>We establish a theoretical upper bound on the misclustering error of its spectral relaxation, and based on this relaxation, introduce a novel, self-adaptive spectral clustering method for directed graphs.
  arXiv  Detail & Related papers  (2024-03-28T15:47:13Z)
• Graph Out-of-Distribution Generalization via Causal Intervention [69.70137479660113]
  We introduce a conceptually simple yet principled approach for training robust graph neural networks (GNNs) under node-level distribution shifts. Our method resorts to a new learning objective derived from causal inference that coordinates an environment estimator and a mixture-of-expert GNN predictor. Our model can effectively enhance generalization with various types of distribution shifts and yield up to 27.4% accuracy improvement over state-of-the-arts on graph OOD generalization benchmarks.
  arXiv  Detail & Related papers  (2024-02-18T07:49:22Z)
• Data Augmentation for Supervised Graph Outlier Detection via Latent Diffusion Models [39.33024157496401]
  We introduce GODM, a novel data augmentation for mitigating class imbalance in supervised graph outlier detection. Extensive experiments conducted on multiple datasets substantiate the effectiveness and efficiency of GODM. We encapsulate GODM into a plug-and-play package and release it at PyPI.
  arXiv  Detail & Related papers  (2023-12-29T16:50:40Z)
• Graph Out-of-Distribution Generalization with Controllable Data Augmentation [51.17476258673232]
  Graph Neural Network (GNN) has demonstrated extraordinary performance in classifying graph properties. Due to the selection bias of training and testing data, distribution deviation is widespread. We propose OOD calibration to measure the distribution deviation of virtual samples.
  arXiv  Detail & Related papers  (2023-08-16T13:10:27Z)
• Handling Missing Data via Max-Entropy Regularized Graph Autoencoder [37.8103274049137]
  MEGAE is a regularized graph autoencoder for graph attribute imputation. It aims at mitigating spectral concentration problem by maximizing the graph spectral entropy. It outperforms all the other state-of-the-art imputation methods on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2022-11-30T06:22:40Z)
• Model Inversion Attacks against Graph Neural Networks [65.35955643325038]
  We study model inversion attacks against Graph Neural Networks (GNNs) In this paper, we present GraphMI to infer the private training graph data. Our experimental results show that such defenses are not sufficiently effective and call for more advanced defenses against privacy attacks.
  arXiv  Detail & Related papers  (2022-09-16T09:13:43Z)
• BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
  A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG) Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data. We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
  arXiv  Detail & Related papers  (2021-12-06T03:35:21Z)
• Generalizing Graph Neural Networks on Out-Of-Distribution Graphs [51.33152272781324]
  Graph Neural Networks (GNNs) are proposed without considering the distribution shifts between training and testing graphs. In such a setting, GNNs tend to exploit subtle statistical correlations existing in the training set for predictions, even though it is a spurious correlation. We propose a general causal representation framework, called StableGNN, to eliminate the impact of spurious correlations.
  arXiv  Detail & Related papers  (2021-11-20T18:57:18Z)
• GCN-Based Linkage Prediction for Face Clustering on Imbalanced Datasets: An Empirical Study [5.416933126354173]
  We present a new method to alleviate the imbalanced labels and also augment graph representations using a Reverse-Imbalance Weighted Sampling strategy. The code and a series of imbalanced benchmark datasets are available at https://github.com/espectre/GCNs_on_imbalanced_datasets.
  arXiv  Detail & Related papers  (2021-07-06T08:45:26Z)
• Graph Classification by Mixture of Diverse Experts [67.33716357951235]
  We present GraphDIVE, a framework leveraging mixture of diverse experts for imbalanced graph classification. With a divide-and-conquer principle, GraphDIVE employs a gating network to partition an imbalanced graph dataset into several subsets. Experiments on real-world imbalanced graph datasets demonstrate the effectiveness of GraphDIVE.
  arXiv  Detail & Related papers  (2021-03-29T14:03:03Z)
• Beyond Low-Pass Filters: Adaptive Feature Propagation on Graphs [6.018995094882323]
  Graph neural networks (GNNs) have been extensively studied for prediction tasks on graphs. Most GNNs assume local homophily, i.e., strong similarities in localneighborhoods. We propose a flexible GNN model, which is capable of handling any graphs without beingrestricted by their underlying homophily.
  arXiv  Detail & Related papers  (2021-03-26T00:35:36Z)
• Identification of Latent Variables From Graphical Model Residuals [0.0]
  We present a novel method to control for the latent space when estimating a DAG by iteratively deriving proxies for the latent space from the residuals of the inferred model. We show that any improvement of prediction of an outcome is intrinsically capped and cannot rise beyond a certain limit as compared to the confounded model.
  arXiv  Detail & Related papers  (2021-01-07T02:28:49Z)

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.