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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

• rag
• diffusion