EBEcem Bozkurt

Featured research · IEEE MLSP 2026

Geometry-Aware Graph Construction via Adaptive Spectral Bandwidth Control

Ecem Bozkurt · Antonio Ortega

A local bandwidth-selection criterion for Gaussian-kernel graphs that matches spectral complexity to the intrinsic complexity of the data manifold.

Visual summary

The bandwidth has a useful middle.

Three spectral bandwidth regimes: too small, informative middle regime, and too large.

The key idea: very small bandwidths make the local kernel nearly identity-like, while very large bandwidths collapse it toward rank one. The target is the intermediate regime where the effective rank is consistent with local manifold complexity.

The problem

One global σ does not fit every neighborhood.

Gaussian-kernel graph methods depend strongly on bandwidth. At one extreme, the graph fragments because the kernel resolves spurious directions. At the other, distinct directions become indistinguishable. The challenge is to select the useful scale locally.

The idea

Match what the kernel sees to what the manifold contains.

For each node, the method compares the kernel's effective rank with an MST-based local intrinsic-dimension estimate, while restricting the search to the manifold-consistent log-log scaling regime.

Method

Three ingredients, one criterion.

Effective rank

Measures how many meaningful spectral directions the local kernel operator resolves. The target is not raw rank, but a continuous effective complexity.

Local intrinsic dimension

An MST-based estimate captures manifold complexity in the high-dimensional regime where pairwise distance ratios can become unreliable.

Log-log consistency

The search favors bandwidths inside the scaling region where kernel mass follows the expected manifold law.

Evidence

What the experiments show.

Local alignment

Across CIFAR-100 embeddings from six self-supervised encoders, the selected bandwidth produces an effective-rank signal that aligns substantially better with dimMST than with the Levina–Bickel estimator. The paper reports Spearman correlations of 0.88–0.91 for dimMST versus 0.43–0.63 for LB across the evaluated encoders.

Downstream inference

The adaptive bandwidth improves leave-one-out classification and label propagation over fixed-bandwidth and competing adaptive baselines, for both dense and sparse graph constructions.

Supporting visual

Effective rank tracks local complexity.

LB
dimMST

The paper's second figure compares effective rank at the selected bandwidth against per-node intrinsic dimension for three encoders. The site graphic above is a visual placeholder for the published multi-panel result; the source figure and full details remain in the paper.

Resources

Read, reproduce, present.