Non-negative Matrix Factorisation with Topological Regularisation

• URL: http://arxiv.org/abs/2606.17531v1
• Date: Tue, 16 Jun 2026 05:15:42 GMT
• Title: Non-negative Matrix Factorisation with Topological Regularisation
• Abstract summary: We investigate the learning of interpretable bases in non-negative matrix factorisation.<n>Our approach is motivated by the observation that many data modalities can be viewed as non-negative functions on a structured domain.<n>We employ persistent homology as a stable, threshold-free topological quantifier and by designing topological scores that integrate into the NMF objective as regularisers.
• Score: 0.9239779358333178
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate the learning of interpretable bases in non-negative matrix factorisation (NMF) by regularising the topology of the learned basis functions. Our approach is motivated by the observation that many data modalities can be viewed as non-negative functions on a structured domain, where the quality of a basis is intrinsically linked to its topology. However, naive methods for incorporating the topology of the support are often hindered by discreteness and threshold dependence, rendering them unsuitable for continuous optimisation. We address these challenges by employing persistent homology as a stable, threshold-free topological quantifier and by designing topological scores that integrate into the NMF objective as regularisers. The resulting framework encompasses spatially coherent image components, periodic time-series structures, and clique-like graph signals within a unified modelling language.

Related papers

• Topological Flow Matching [56.16372813551555]
  Flow matching is a powerful generative modeling framework, valued for its simplicity and strong empirical performance.<n>We introduce topological flow matching, a topology-aware generalization of flow matching.<n>We demonstrate its effectiveness on diverse structured datasets, including brain fMRIs, ocean currents, seismic events, and traffic flows.
  arXiv  Detail & Related papers  (2026-06-14T16:29:33Z)
• K-Models: a Flexible and Interpretable Method for Ordinal Clustering with Application to Antigen-Antibody Interaction Profiles [65.21921642886367]
  K-Models is a novel framework that integrates ordinal constraints and estimates key underlying elements of the random process generating the observed functional profiles.<n>The proposed method is evaluated through simulations and real-world applications.
  arXiv  Detail & Related papers  (2026-05-14T13:35:44Z)
• Topological Signatures of Grokking [5.246889031503699]
  We study the grokking phenomenon through the lens of topology.<n> Persistent homology provides a unified geometric and topological characterization of representation learning.<n>Our results suggest that persistent homology offers a principled and interpretable framework for analyzing how neural networks latent structure during training.
  arXiv  Detail & Related papers  (2026-05-07T14:33:22Z)
• GRIFDIR: Graph Resolution-Invariant FEM Diffusion Models in Function Spaces over Irregular Domains [56.121725064621295]
  Score-based diffusion models in function spaces offer a principled framework for modelling function-valued data.<n>However, practical implementations have struggled to fully realise these benefits.<n>We propose a novel architecture that represents generalised convolutional kernels as finite graph kernels.
  arXiv  Detail & Related papers  (2026-05-05T08:33:52Z)
• Topological Detection of Hopf Bifurcations via Persistent Homology: A Functional Criterion from Time Series [0.0]
  We propose a framework for the detection of Hopf bifurcations directly from time series, based on persistent homology applied to phase space reconstructions via Takens embedding within the framework of Topological Data Analysis.<n>The results support the interpretation of dynamical transitions as topological phase transitions and demonstrate the potential of topological data analysis as a model-free tool for the quantitative analysis of nonlinear time series.
  arXiv  Detail & Related papers  (2026-03-28T20:25:38Z)
• Persistent Nonnegative Matrix Factorization via Multi-Scale Graph Regularization [5.524295668575852]
  We propose persistent nonnegative matrix factorization (pNMF) that produces a sequence of persistence-aligned embeddings rather than a single one.<n>We analyze the structural properties of the embeddings along the scale parameter and establish bounds on their increments between consecutive scales.<n>The resulting model defines a nontrivial solution path across scales, rather than a single factorization, which poses new computational challenges.
  arXiv  Detail & Related papers  (2026-02-26T02:23:50Z)
• SIGMA: Scalable Spectral Insights for LLM Collapse [51.863164847253366]
  We introduce SIGMA (Spectral Inequalities for Gram Matrix Analysis), a unified framework for model collapse.<n>By utilizing benchmarks that deriving and deterministic bounds on the matrix's spectrum, SIGMA provides a mathematically grounded metric to track the contraction of the representation space.<n>We demonstrate that SIGMA effectively captures the transition towards states, offering both theoretical insights into the mechanics of collapse.
  arXiv  Detail & Related papers  (2026-01-06T19:47:11Z)
• Persistent Homology via Finite Topological Spaces [0.0]
  We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets.<n>We show that standard poset-level simplifications preserve persistent invariants and prove stability of the resulting persistence diagrams under perturbations of the input metric in a density-based instantiation.
  arXiv  Detail & Related papers  (2025-12-29T10:14:56Z)
• Graph Neural Regularizers for PDE Inverse Problems [62.49743146797144]
  We present a framework for solving a broad class of ill-posed inverse problems governed by partial differential equations (PDEs)<n>The forward problem is numerically solved using the finite element method (FEM)<n>We employ physics-inspired graph neural networks as learned regularizers, providing a robust, interpretable, and generalizable alternative to standard approaches.
  arXiv  Detail & Related papers  (2025-10-23T21:43:25Z)
• Hallucination Detection in LLMs with Topological Divergence on Attention Graphs [60.83579255387347]
  Hallucination, i.e., generating factually incorrect content, remains a critical challenge for large language models.<n>We introduce TOHA, a TOpology-based HAllucination detector in the RAG setting.
  arXiv  Detail & Related papers  (2025-04-14T10:06:27Z)
• Conformable Convolution for Topologically Aware Learning of Complex Anatomical Structures [38.20599800950335]
  We introduce Conformable Convolution, a novel convolutional layer designed to explicitly enforce topological consistency.<n>Topological Posterior Generator (TPG) module identifies key topological features and guides the convolutional layers.<n>We showcase the effectiveness of our framework in the segmentation task, where preserving the interconnectedness of structures is critical.
  arXiv  Detail & Related papers  (2024-12-29T22:41:33Z)

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.