Analytic Torsion and Spectral Gap Capture Persistent-Laplacian Performance

• URL: http://arxiv.org/abs/2606.16990v1
• Date: Mon, 15 Jun 2026 17:28:57 GMT
• Title: Analytic Torsion and Spectral Gap Capture Persistent-Laplacian Performance
• Abstract summary: We propose a compact spectral representation that distills the persistent Laplacian into three mathematically grounded invariants.<n>Our results suggest that these invariants provide a principled, fixed-length interface between spectral geometry and topological learning.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: While persistent Laplacians (PL) offer a richer geometric representation of data than persistent homology, utilizing their full eigenspectrum for learning tasks is often hampered by high dimensionality and the ``varying length'' problem across different filtration scales. We propose a compact spectral representation that distills the persistent Laplacian into three mathematically grounded invariants: Betti numbers, the spectral gap, and analytic torsion. Across benchmark datasets including MNIST, QM-3D, and SKEMPI WT, we demonstrate that this reduced feature space captures the essential predictive signal of the full spectrum, and in some cases outperforms it, while significantly reducing computational overhead and preventing the noise introduced by higher-frequency eigenvalues. Our results suggest that these invariants provide a principled, fixed-length interface between spectral geometry and topological learning.

Related papers

• Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery [5.506184984859199]
  Kernel spectral clustering with a single bandwidth can be inadequate for data exhibiting multiple characteristic pairwise-distance scales.<n>We address this issue through a multi- kernel formulation that aggregates kernels with different bandwidths.<n>We develop a rigorous theoretical analysis of the resulting method under a general high-dimensional, multi-scale mixture model.
  arXiv  Detail & Related papers  (2026-08-09T13:34:27Z)
• Fully Rotation-Equivariant Spectral-Spatial Learning for Multispectral Object Detection [26.632380150006753]
  FressDet is a fully rotation-equivariant spectral-spatial learning framework for multispectral object detection.<n>It captures the continuous, ordered nature of spectral structure and enables reliable spectral-spatial fusion across pyramid levels.<n>FressDet learns more discriminative and robust spectral-spatial representations even under rotational perturbations.
  arXiv  Detail & Related papers  (2026-07-06T14:29:51Z)
• MSGS: Multispectral 3D Gaussian Splatting [46.61006851229471]
  We present a multispectral extension to 3D Gaussian Splatting (3DGS) for wavelength-aware view synthesis.<n>Each Gaussian is augmented with spectral radiance, represented via per-band spherical harmonics, and optimized under a dual-loss supervision scheme combining RGB and multispectral signals.<n>Our method is evaluated on both public and self-captured real-world datasets, demonstrating consistent improvements over the RGB-only 3DGS baseline in terms of image quality and spectral consistency.
  arXiv  Detail & Related papers  (2026-04-14T23:03:38Z)
• Latent Dirichlet Transformer VAE for Hyperspectral Unmixing with Bundled Endmembers [1.9336815376402718]
  We propose the Latent Dirichlet Transformer Variational Autoencoder (LDVAE-T) for hyperspectral unmixing.<n>Our model combines the global context modeling capabilities of transformer architectures with physically meaningful constraints imposed by a Dirichlet prior in the latent space.<n>We evaluate our approach on three benchmark datasets, Samson, Jasper Ridge, and HYDICE Urban.
  arXiv  Detail & Related papers  (2025-11-21T20:15:37Z)
• Spectral Graph Clustering under Differential Privacy: Balancing Privacy, Accuracy, and Efficiency [53.98433419539793]
  We study the problem of spectral graph clustering under edge differential privacy (DP)<n>Specifically, we develop three mechanisms: (i) graph perturbation via randomized edge flipping combined with adjacency matrix shuffling, which enforces edge privacy; (ii) private graph projection with additive Gaussian noise in a lower-dimensional space to reduce dimensionality and computational complexity; and (iii) a noisy power iteration method that distributes Gaussian noise across iterations to ensure edge DP while maintaining convergence.
  arXiv  Detail & Related papers  (2025-10-08T15:30:27Z)
• Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization [48.25304391127552]
  Estimating the tangent spaces of a data manifold is a fundamental problem in data analysis.<n>We propose a method, Laplacian Eigenvector Gradient Orthogonalization (LEGO), that utilizes the global structure of the data to guide local tangent space estimation.
  arXiv  Detail & Related papers  (2025-10-02T17:59:45Z)
• Correct Estimation of Higher-Order Spectra: From Theoretical Challenges to Practical Multi-Channel Implementation in SignalSnap [0.0]
  Higher-order spectra offer powerful methods for solving critical problems in signal processing and data analysis.<n>Their practical use has remained limited due to unresolved mathematical issues in spectral estimation.<n>We introduce quasi-polyspectra to uncover non-stationary, time-dependent higher-order features.<n>We implement these new estimators in SignalSnap, an open-source GPU-accelerated library capable of efficiently analyzing datasets exceeding hundreds of gigabytes within minutes.
  arXiv  Detail & Related papers  (2025-05-02T12:36:30Z)
• Robust Spectral Anomaly Detection in EELS Spectral Images via Three Dimensional Convolutional Variational Autoencoders [0.0]
  We introduce a Three-Dimensional Convolutional Variational Autoencoder (3D-CVAE) for automated anomaly detection in EELS-SI data.<n>By employing negative log-likelihood loss and training on bulk spectra, the model learns to reconstruct bulk features characteristic of the defect-free material.<n>Our results show that 3D-CVAE achieves superior anomaly detection and maintains consistent performance across various shift magnitudes.
  arXiv  Detail & Related papers  (2024-12-16T23:55:08Z)
• Learning Exhaustive Correlation for Spectral Super-Resolution: Where Spatial-Spectral Attention Meets Linear Dependence [26.1694389791047]
  Spectral super-resolution aims to recover hyperspectral image (HSI) from easily obtainable RGB image. Two types of bottlenecks in existing Transformers limit performance improvement and practical applications. We propose a novel Exhaustive Correlation Transformer (ECT) for spectral super-resolution.
  arXiv  Detail & Related papers  (2023-12-20T08:30:07Z)
• Cross-Scope Spatial-Spectral Information Aggregation for Hyperspectral Image Super-Resolution [47.12985199570964]
  We propose a novel cross-scope spatial-spectral Transformer (CST) to investigate long-range spatial and spectral similarities for single hyperspectral image super-resolution. Specifically, we devise cross-attention mechanisms in spatial and spectral dimensions to comprehensively model the long-range spatial-spectral characteristics. Experiments over three hyperspectral datasets demonstrate that the proposed CST is superior to other state-of-the-art methods both quantitatively and visually.
  arXiv  Detail & Related papers  (2023-11-29T03:38:56Z)
• Hodge-Aware Contrastive Learning [101.56637264703058]
  Simplicial complexes prove effective in modeling data with multiway dependencies. We develop a contrastive self-supervised learning approach for processing simplicial data.
  arXiv  Detail & Related papers  (2023-09-14T00:40:07Z)
• Spectral Enhanced Rectangle Transformer for Hyperspectral Image Denoising [64.11157141177208]
  We propose a spectral enhanced rectangle Transformer to model the spatial and spectral correlation in hyperspectral images. For the former, we exploit the rectangle self-attention horizontally and vertically to capture the non-local similarity in the spatial domain. For the latter, we design a spectral enhancement module that is capable of extracting global underlying low-rank property of spatial-spectral cubes to suppress noise.
  arXiv  Detail & Related papers  (2023-04-03T09:42:13Z)
• The Heavy-Tail Phenomenon in SGD [7.366405857677226]
  We show that depending on the structure of the Hessian of the loss at the minimum, the SGD iterates will converge to a emphheavy-tailed stationary distribution. We translate our results into insights about the behavior of SGD in deep learning.
  arXiv  Detail & Related papers  (2020-06-08T16:43:56Z)

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.