Metraipolis › archive › dc_f162d073eedd

Geometry-Aware Graph Construction via Adaptive Spectral Bandwidth Control — arXiv:2609.03306

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03306
License (as archived)
CC0-1.0
Archived
2026-10-17T02:07:49.880Z
SHA-256 of the archived text
c62ba9998d0e6b118f84ed69d250cfcd841c40b39e2109f90767e55ba23179d9
Stable URL of this page
https://metraipolis.com/documento/dc_f162d073eedd

How to cite

Geometry-Aware Graph Construction via Adaptive Spectral Bandwidth Control — arXiv:2609.03306 — arXiv (en), https://arxiv.org/abs/2609.03306 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f162d073eedd (Metraipolis archive dc_f162d073eedd, sha256 c62ba9998d0e6b118f84ed69d250cfcd841c40b39e2109f90767e55ba23179d9)
BibTeX
@misc{dcf162d073eedd,
  title = {Geometry-Aware Graph Construction via Adaptive Spectral Bandwidth Control — arXiv:2609.03306},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03306},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f162d073eedd; sha256 c62ba9998d0e6b118f84ed69d250cfcd841c40b39e2109f90767e55ba23179d9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03306. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Kernelized graph methods - spectral clustering, diffusion maps, and sparse kernel -regression graphs - that use Gaussian kernels depend on the choice of Gaussian bandwidth sigma, which governs the spectral character of the local kernel operator. When sigma is too small, the kernel overestimates local complexity and treats each sample as an independent direction; when sigma is too large, the kernel collapses multiple directions together, the condition number diverges, and all geometric discrimination is lost. We propose a choice of scale to make the spectral complexity of the kernel consistent with the intrinsic complexity of the underlying manifold. We propose a per-node bandwidth criterion that operationalizes this principle by jointly matching the kernel's effective rank to the local intrinsic dimension estimated via minimum spanning tree, anchoring the search in the manifold-consistent log-log scaling regime. We evaluate SSL embeddings from six encoders on CIFAR-100, showing that adaptive bandwidth consistently improves leave-one-out (LOO) classification and label propagation (LP) accuracy over fixed-bandwidth methods and competing adaptive methods.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-04 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.03306 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T01:47:25.536Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).