Matched Topological Subspace Detector

• URL: http://arxiv.org/abs/2504.05892v1
• Date: Tue, 08 Apr 2025 10:38:30 GMT
• Title: Matched Topological Subspace Detector
• Authors: Chengen Liu, Victor M. Tenorio, Antonio G. Marques, Elvin Isufi,
• Abstract summary: We propose Neyman-Pearson matched topological subspace detectors for signals defined at a single simplicial level (such as edges) or jointly across all levels of a simplicial complex.<n>We demonstrate the effectiveness of the proposed detectors on various real-world data, including foreign currency exchange networks.
• Score: 16.216899458761773
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Topological spaces, represented by simplicial complexes, capture richer relationships than graphs by modeling interactions not only between nodes but also among higher-order entities, such as edges or triangles. This motivates the representation of information defined in irregular domains as topological signals. By leveraging the spectral dualities of Hodge and Dirac theory, practical topological signals often concentrate in specific spectral subspaces (e.g., gradient or curl). For instance, in a foreign currency exchange network, the exchange flow signals typically satisfy the arbitrage-free condition and hence are curl-free. However, the presence of anomalies can disrupt these conditions, causing the signals to deviate from such subspaces. In this work, we formulate a hypothesis testing framework to detect whether simplicial complex signals lie in specific subspaces in a principled and tractable manner. Concretely, we propose Neyman-Pearson matched topological subspace detectors for signals defined at a single simplicial level (such as edges) or jointly across all levels of a simplicial complex. The (energy-based projection) proposed detectors handle missing values, provide closed-form performance analysis, and effectively capture the unique topological properties of the data. We demonstrate the effectiveness of the proposed topological detectors on various real-world data, including foreign currency exchange networks.

Related papers

• Topological Schrödinger Bridge Matching [4.496256885343707]
  We propose the Topological Schr"odinger Bridge problem (TSBP) for matching signal distributions on a topological domain.<n>We show that the optimal process follows the forward-backward dynamics governed by some unknowns.<n>We develop TSB-based models for matching topological signals by parameterizing the unknowns in the optimal process as neural networks and learning them through likelihood training.
  arXiv  Detail & Related papers  (2025-04-07T07:45:21Z)
• A Sampling Theory Perspective on Activations for Implicit Neural Representations [73.6637608397055]
  Implicit Neural Representations (INRs) have gained popularity for encoding signals as compact, differentiable entities. We conduct a comprehensive analysis of these activations from a sampling theory perspective. Our investigation reveals that sinc activations, previously unused in conjunction with INRs, are theoretically optimal for signal encoding.
  arXiv  Detail & Related papers  (2024-02-08T05:52:45Z)
• Topological Interfaces of Luttinger Liquids [0.0]
  Topological interfaces of two-dimensional conformal field theories exhibit striking spectral and entanglement characteristics. We show that a topological interface of two Luttinger liquids can be realized by coupling special one-dimensional superconductors. The proposed lattice model provides an experimentally-realizable alternative to spin and anyon chains for the analysis of several conjectured conformal fixed points.
  arXiv  Detail & Related papers  (2023-12-09T12:41:50Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Algebraic Topological Networks via the Persistent Local Homology Sheaf [15.17547132363788]
  We introduce a novel approach to enhance graph convolution and attention modules by incorporating local topological properties of the data. We consider the framework of sheaf neural networks, which has been previously leveraged to incorporate additional structure into graph neural networks' features.
  arXiv  Detail & Related papers  (2023-11-16T19:24:20Z)
• HoloNets: Spectral Convolutions do extend to Directed Graphs [59.851175771106625]
  Conventional wisdom dictates that spectral convolutional networks may only be deployed on undirected graphs. Here we show this traditional reliance on the graph Fourier transform to be superfluous. We provide a frequency-response interpretation of newly developed filters, investigate the influence of the basis used to express filters and discuss the interplay with characteristic operators on which networks are based.
  arXiv  Detail & Related papers  (2023-10-03T17:42:09Z)
• Dirac signal processing of higher-order topological signals [5.70896453969985]
  We propose an adaptive, unsupervised signal processing algorithm that learns to jointly filter topological signals supported on nodes, links and triangles. We test our algorithms on noisy synthetic data and noisy data of drifters in the ocean.
  arXiv  Detail & Related papers  (2023-01-12T13:53:27Z)
• ARISE: Graph Anomaly Detection on Attributed Networks via Substructure Awareness [70.60721571429784]
  We propose a new graph anomaly detection framework on attributed networks via substructure awareness (ARISE) ARISE focuses on the substructures in the graph to discern abnormalities. Experiments show that ARISE greatly improves detection performance compared to state-of-the-art attributed networks anomaly detection (ANAD) algorithms.
  arXiv  Detail & Related papers  (2022-11-28T12:17:40Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• A supervised learning algorithm for interacting topological insulators based on local curvature [6.281776745576886]
  We introduce a supervised machine learning scheme that uses only the curvature function at the high symmetry points as input data. We show that an artificial neural network trained with the noninteracting data can accurately predict all topological phases in the interacting cases. Intriguingly, the method uncovers a ubiquitous interaction-induced topological quantum multicriticality.
  arXiv  Detail & Related papers  (2021-04-22T18:00: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.