Phase-Consistent Magnetic Spectral Learning for Multi-View Clustering proposes a new unsupervised method that uses a complex-valued magnetic affinity to capture both magnitude and phase information across multiple data views. By deriving a confidence-directed cross-view flow from anchor assignments and combining it with a nonnegative magnitude backbone, the approach constructs a Hermitian magnetic Laplacian that yields a stable shared spectral signal for representation learning and clustering. Experiments on ten public benchmarks show the method outperforms or matches leading MVC baselines on most dataset-metric combinations.
By Mingdong Lu, Zhikui Chen, Meng Liu, Shubin Ma, Zhengyang Tang
arXiv:2609.13518v1 Announce Type: new
Abstract: We present GeoTTER, a novel framework that redefines optimal transport in the realm of zero-shot classification. Conventional methods often suffer from...
By Wei-Yang Alex Lee, Rudrasis Chakraborty, Vishnu Lokhande
arXiv:2607. 24338v1 Announce Type: new Abstract: Unsupervised graph representation learning aims to derive meaningful node embeddings by capturing both structural and attribute information without relying on labeled data.
By Zengyi Wo, Shiyu Zhang, Qiyao Peng, Tianpeng Li, Xuan Guo
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.
By Yeari Vigder, Paulina Hoyos, David Thong, Joakim and\'en, Joe Kileel, Amit Moscovich
The paper introduces a geometry‑aware graph construction method that adaptively selects Gaussian kernel bandwidths per node to align the kernel’s spectral complexity with the intrinsic dimensionality of the underlying manifold. By matching the kernel’s effective rank to a local intrinsic dimension estimate derived from a minimum spanning tree, the method operates within a manifold‑consistent log‑log scaling regime. Experiments on CIFAR‑100 demonstrate that this adaptive bandwidth approach consistently improves leave‑one‑out classification and label propagation accuracy compared to fixed‑bandwidth and other adaptive techniques.
By Ecem Bozkurt, Antonio Ortega
arXiv:2608.29362v1 Announce Type: cross
Abstract: Sparse computations are fundamental to scientific computing, graph analytics, and machine learning, yet their performance is highly sensitive to the...
By Ruifeng Zhang, Xipeng Shen
Modern sensing, communication, and learning systems generate heterogeneous network signals, with local data differing in dimension, modality, and geometric structure. Processing such data requires a mathematical framework capable of simultaneously modeling heterogeneous local signal spaces and the transformations relating them.
arXiv:2601. 10199v2 Announce Type: replace Abstract: Multivariate data often exhibit complex dependencies that violate the assumption of isotropic residual noise.
By Antonio Briola, Marwin Schmidt, Fabio Caccioli, Carlos Ros Perez, James Singleton, Christian Michler, Tomaso Aste
arXiv:2607. 23149v1 Announce Type: new Abstract: Random Vector Functional Link (RVFL) networks provide an efficient randomized learning framework for classification.
By Yogesh Kumar, Mudasir Ganaie
arXiv:2602. 23006v2 Announce Type: replace-cross Abstract: Simulating a Gaussian process requires sampling from a high-dimensional Gaussian distribution, which scales cubically with the number of sample locations.
By Arsalan Jawaid, Abdullah Karatas, J\"org Seewig
arXiv:2510. 02308v2 Announce Type: replace Abstract: Estimating the tangent spaces of a data manifold is a fundamental problem in geometric data analysis.
By Dhruv Kohli, Sawyer J. Robertson, Gal Mishne, Alexander Cloninger
arXiv:2608. 01318v1 Announce Type: cross Abstract: Modern sensing, communication, and learning systems generate heterogeneous network signals, with local data differing in dimension, modality, and geometric structure.
By Gabriele D'Acunto, Leonardo Di Nino, Paolo Di Lorenzo, Sergio Barbarossa