Spectral graph clustering with inhomogeneous latent geometry
arXiv:2608. 11321v1 Announce Type: cross Abstract: We study spectral clustering in the presence of a confounding latent geometry.
arXiv:2606. 16990v1 Announce Type: new 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.
arXiv:2608. 11321v1 Announce Type: cross Abstract: We study spectral clustering in the presence of a confounding latent geometry.
arXiv:2607. 03692v1 Announce Type: new Abstract: Spectral methods are widely used to construct representations from the geometry of data, but they often rely on a fixed kernel, graph Laplacian, or manually selected feature scaling.
arXiv:2607. 08987v1 Announce Type: new Abstract: Spectral embedding methods are widely used for dimensionality reduction and clustering of high-dimensional datasets with intrinsic low-dimensional structures.
arXiv:2606. 09806v1 Announce Type: cross Abstract: We introduce Topological Neural Operators (TNOs), a principled framework for operator learning on cell complexes that lifts neural operators (NOs) from functions on points and/or edges to topological domains.
arXiv:2505. 04346v2 Announce Type: replace Abstract: Clustering aims at partitioning data points into groups of similar objects without knowing about the class labels.
arXiv:2605. 13834v2 Announce Type: replace-cross Abstract: In this paper, we study solution operators of physical field equations on geometric meshes from a function-space perspective.
arXiv:2606. 17531v1 Announce Type: new Abstract: We investigate the learning of interpretable bases in non-negative matrix factorisation (NMF) by regularising the topology of the learned basis functions.
arXiv:2510. 02308v2 Announce Type: replace Abstract: Estimating the tangent spaces of a data manifold is a fundamental problem in geometric data analysis.
arXiv:2601. 17090v2 Announce Type: replace-cross Abstract: Partial differential equations (PDEs) govern complex systems, yet neural operators often struggle to efficiently capture the long-range, nonlocal interactions inherent in their solution maps.
arXiv:2607. 13847v1 Announce Type: cross Abstract: Many datasets encountered across a wide range of domains possess rich geometric and topological structure that is difficult to capture using conventional vector-based representations.
arXiv:2507. 07156v2 Announce Type: replace-cross Abstract: Supervised machine learning pipelines trained on features derived from persistent homology have been experimentally observed to ignore much of the information contained in a persistence diagram.
arXiv:2503. 03156v4 Announce Type: replace-cross Abstract: We propose DiRe, a force-directed dimensionality reduction framework designed to preserve global structure and homological features while remaining practical on modern hardware.