arXiv Machine Learning
A Finslerian Approach for Embedding Directed Data
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 13
Group Invariant Spectral Embedding
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 Machine Learning
Jul 8
EntroPath: Maximum Entropy Path Ensemble Embedding for Manifold Learning
arXiv:2607. 06497v1 Announce Type: new Abstract: We introduce EntroPath, a manifold learning method that recovers geodesic geometry from data graphs through ensembles of diffusion paths.
arXiv Machine Learning
Jun 17
Finsler Geometry, Graph Neural Networks, and You
arXiv:2606. 17185v1 Announce Type: new Abstract: Graph neural network architectures based on the graph Laplacian approximate the Laplace-Beltrami operator, thus limiting their application to isotropic operators.
arXiv Machine Learning
Jul 9
Fast determinantal sampling on general spaces and diffusion geometry
arXiv:2607. 06644v1 Announce Type: cross Abstract: Determinantal point processes have recently emerged as a kernel-based alternative to standard independent sampling for constructing efficient minibatches, coresets, and other compact representations of large-scale datasets.
arXiv Machine Learning
Jul 28
Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian
arXiv:2607. 23192v1 Announce Type: cross Abstract: We develop a data-driven approximation of the projected ambient connection Laplacian acting on differential forms over smooth Riemannian manifolds sampled by point clouds.
arXiv Machine Learning
Sep 4
Geometry-Aware Graph Construction via Adaptive Spectral Bandwidth Control
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.