Graph Regularized PCA

• URL: http://arxiv.org/abs/2601.10199v1
• Date: Thu, 15 Jan 2026 08:57:18 GMT
• Title: Graph Regularized PCA
• Abstract summary: Graph Regularized PCA (GR-PCA) is a graph-based regularization of PCA that incorporates the dependency structure of the data features.<n> GR-PCA concentrates variance on the intended support, produces loadings with lower graph-Laplacian energy, and remains competitive in out-of-sample reconstruction.<n>The advantage over PCA is most pronounced when high-frequency signals are graph-correlated, whereas PCA remains competitive when such signals are nearly rotationally invariant.
• Score: 3.7916397178670884
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: High-dimensional data often exhibit dependencies among variables that violate the isotropic-noise assumption under which principal component analysis (PCA) is optimal. For cases where the noise is not independent and identically distributed across features (i.e., the covariance is not spherical) we introduce Graph Regularized PCA (GR-PCA). It is a graph-based regularization of PCA that incorporates the dependency structure of the data features by learning a sparse precision graph and biasing loadings toward the low-frequency Fourier modes of the corresponding graph Laplacian. Consequently, high-frequency signals are suppressed, while graph-coherent low-frequency ones are preserved, yielding interpretable principal components aligned with conditional relationships. We evaluate GR-PCA on synthetic data spanning diverse graph topologies, signal-to-noise ratios, and sparsity levels. Compared to mainstream alternatives, it concentrates variance on the intended support, produces loadings with lower graph-Laplacian energy, and remains competitive in out-of-sample reconstruction. When high-frequency signals are present, the graph Laplacian penalty prevents overfitting, reducing the reconstruction accuracy but improving structural fidelity. The advantage over PCA is most pronounced when high-frequency signals are graph-correlated, whereas PCA remains competitive when such signals are nearly rotationally invariant. The procedure is simple to implement, modular with respect to the precision estimator, and scalable, providing a practical route to structure-aware dimensionality reduction that improves structural fidelity without sacrificing predictive performance.

Related papers

• Stability of Flow Models for Graph Signals [11.329941453877444]
  We analyze continuous normalized flow models parameterized by Graph Neural Networks (GNNs)<n>We derive explicit stability bounds on the generated probability distributions.<n>Experiments using synthetic smooth signals on block model graphs and real-world fMRI signals on brain connectomes demonstrate that this bound-oriented approach generative models are more robust to structural noise, without sacrificing output quality.
  arXiv  Detail & Related papers  (2026-07-08T15:04:39Z)
• Graph Diffusion Residuals for Control-Function Instrumental Variables [82.39671985893028]
  High-capacity first stages can interpolate treatment and leave too little residual information for the outcome equation.<n>We study Adaptive Anisotropic Instrumental Heat Flow (A-IHF), a deterministic graph-diffusion residual extractor for flexible control functions.<n>A-IHF treats treatment as a signal on a graph of first-stage features, uses pilot diffusion to detect large treatment jumps, attenuates conductance across those jumps, and computes the generated control with a sparse graph resolvent.
  arXiv  Detail & Related papers  (2026-06-12T17:02:53Z)
• When Do Graph Foundation Models Transfer? A Data-Centric Theory [68.54337055801571]
  Graph foundation models (GFMs) aim to reuse a single backbone across diverse graph domains, yet their transfer is often uneven and can exhibit negative transfer.<n>We show that for both set-based and message-passing tokenizations, any Lipschitz backbone admits an explicit decomposition of cross-domain output shift.<n>A key ingredient is positional-encoding (PE) stability: we establish stability guarantees for spectral PEs and highlight contrasting behaviors of eigenvector- versus subspace-based PEs.
  arXiv  Detail & Related papers  (2026-05-28T12:07:27Z)
• Delving into Non-Exchangeability for Conformal Prediction in Graph-Structured Multivariate Time Series [23.16459034215899]
  Conformal prediction (CP) offers uncertainty estimation with a solid coverage guarantee.<n>In graph-structured time series, inherent cross-node coupling can violate the exchangeability condition.<n>We propose a novel concept named Spectral Graph Exchangeability Conditional (SGCE)
  arXiv  Detail & Related papers  (2026-05-06T14:19:16Z)
• Curvature-Aware PCA with Geodesic Tangent Space Aggregation for Semi-Supervised Learning [52.452902154360565]
  GTSA-PCA is a geometric extension of Principal Component Analysis.<n>It integrates curvature awareness and geodesic consistency within a unified spectral framework.<n>Our results position GTSA-PCA as a principled bridge between statistical and geometric approaches to dimensionality reduction.
  arXiv  Detail & Related papers  (2026-04-20T20:36:36Z)
• Graph Negative Feedback Bias Correction Framework for Adaptive Heterophily Modeling [15.157616444432563]
  Graph Neural Networks (GNNs) have emerged as a powerful framework for processing graph-structured data.<n>GNNs are inherently limited by the homophily assumption, leading to degradation in performance on heterophilic graphs.<n>We propose Graph Negative Feedback Bias Correction (GNFBC), a simple yet effective framework that is independent of any specific aggregation strategy.
  arXiv  Detail & Related papers  (2026-03-04T02:34:48Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• FUTON: Fourier Tensor Network for Implicit Neural Representations [56.48739018255443]
  Implicit neural representations (INRs) have emerged as powerful tools for encoding signals, yet dominant-based designs often suffer from slow convergence, overfitting to noise, and poor extrapolation.<n>We introduce FUTON, which models signals as generalized Fourier series whose coefficients are parameterized by a low-rank tensor decomposition.
  arXiv  Detail & Related papers  (2026-02-13T19:31:44Z)
• 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)
• PCA++: How Uniformity Induces Robustness to Background Noise in Contrastive Learning [12.061533430519702]
  High-dimensional data often contain low-dimensional signals obscured by structured background noise.<n>Motivated by contrastive learning, we address the problem of recovering shared signal subspaces from positive pairs, paired observations sharing the same signal but differing in background.<n>Our baseline, PCA+, uses alignment-only contrastive learning and succeeds when background variation is mild, but fails under strong noise or high-dimensional regimes.<n>We introduce PCA++, a hard-constrained contrastive PCA that enforces identity covariance on projected features.
  arXiv  Detail & Related papers  (2025-11-15T16:11:39Z)
• Covariance Scattering Transforms [36.771729185178586]
  We propose deep untrained networks that apply filters localized in the covariance spectrum to the input data and produce expressive hierarchical representations via nonlinearities.<n>Our experiments show that CSTs produce stable representations in low-data settings, as VNNs but without any training, and lead to comparable or better predictions.
  arXiv  Detail & Related papers  (2025-11-12T01:29:31Z)
• Learning Time-Varying Graphs from Incomplete Graph Signals [1.7430416823420511]
  We develop an efficient Alternating Direction Multiplier algorithm for solving the problem of imputing missing data from a graph.<n>We prove that the proposed ADMM scheme converges to and we derive a stationary point.
  arXiv  Detail & Related papers  (2025-10-19T11:12:13Z)
• Low-Rank Tensor Recovery via Variational Schatten-p Quasi-Norm and Jacobian Regularization [49.85875869048434]
  We propose a CP-based low-rank tensor function parameterized by neural networks for implicit neural representation.<n>To achieve sparser CP decomposition, we introduce a variational Schatten-p quasi-norm to prune redundant rank-1 components.<n>For smoothness, we propose a regularization term based on the spectral norm of the Jacobian and Hutchinson's trace estimator.
  arXiv  Detail & Related papers  (2025-06-27T11:23:10Z)
• Learn Beneficial Noise as Graph Augmentation [54.44813218411879]
  We propose PiNGDA, where positive-incentive noise (pi-noise) scientifically analyzes the beneficial effect of noise under the information theory.<n>We prove that the standard GCL with pre-defined augmentations is equivalent to estimate the beneficial noise via the point estimation.<n>Since the generator learns how to produce beneficial perturbations on graph topology and node attributes, PiNGDA is more reliable compared with the existing methods.
  arXiv  Detail & Related papers  (2025-05-25T08:20:34Z)
• Outlier-aware Tensor Robust Principal Component Analysis with Self-guided Data Augmentation [21.981038455329013]
  We propose a self-guided data augmentation approach that employs adaptive weighting to suppress outlier influence.<n>We show the improvements in both accuracy and computational efficiency compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-04-25T13:03:35Z)
• Online Graph Topology Learning via Time-Vertex Adaptive Filters: From Theory to Cardiac Fibrillation [37.69303106863453]
  We introduce AdaCGP, a sparsity-aware adaptive algorithm for dynamic graph topology estimation.<n>AdaCGP consistently outperforms state-of-the-art methods.<n>It tracks dynamic changes in propagation patterns more effectively than established methods.
  arXiv  Detail & Related papers  (2024-11-03T13:43:51Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• PCPL: Predicate-Correlation Perception Learning for Unbiased Scene Graph Generation [58.98802062945709]
  We propose a novel Predicate-Correlation Perception Learning scheme to adaptively seek out appropriate loss weights. Our PCPL framework is further equipped with a graph encoder module to better extract context features.
  arXiv  Detail & Related papers  (2020-09-02T08:30:09Z)
• Evaluating probabilistic classifiers: Reliability diagrams and score decompositions revisited [68.8204255655161]
  We introduce the CORP approach, which generates provably statistically Consistent, Optimally binned, and Reproducible reliability diagrams in an automated way. Corpor is based on non-parametric isotonic regression and implemented via the Pool-adjacent-violators (PAV) algorithm.
  arXiv  Detail & Related papers  (2020-08-07T08:22:26Z)
• When Does Preconditioning Help or Hurt Generalization? [74.25170084614098]
  We show how the textitimplicit bias of first and second order methods affects the comparison of generalization properties. We discuss several approaches to manage the bias-variance tradeoff, and the potential benefit of interpolating between GD and NGD.
  arXiv  Detail & Related papers  (2020-06-18T17:57:26Z)

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.