IDMap Framework: Feature-Aligned Diffusion Maps

• IDMap is a geometric data analysis method that iteratively refines embeddings by deforming the data manifold with locally adaptive anisotropic kernels.
• It employs local linear regression to estimate Jacobians and tangent spaces, aligning the Riemannian metric with directions where the feature map varies most.
• Empirical results show that IDMap robustly outperforms isotropic diffusion maps, effectively collapsing irrelevant dimensions in noisy, high-dimensional data.

The Iterated Diffusion Map (IDMap) framework is a geometric data analysis method designed to identify, extract, and emphasize features of interest in high-dimensional data lying on manifolds. By iteratively deforming the intrinsic geometry of the data through adaptive, anisotropic kernels guided by the feature map’s local Jacobian, IDMap produces low-dimensional embeddings that reflect target features while removing irrelevant directions. This approach generalizes classical diffusion maps by leveraging local covariance structures that align manifold geometry to the feature map, and provides rigorous tools for tangent space estimation, intrinsic dimension selection, and robust manifold learning, especially in settings involving product manifolds or degenerate mappings.

1. Anisotropic Local Kernel Construction

Let $\mathcal{M} \subset \mathbb{R}^m$ be a $d$-dimensional manifold and $$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$ a feature map. The central innovation of IDMap is the use of local kernels:

$$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$

with data-dependent, anisotropic covariance $C(x) \in \mathbb{R}^{m \times m}$. The local geometry is modulated in the directions along which $\mathcal{H}$ varies most strongly. The covariance is chosen to satisfy:

$$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$

where $\mathcal{I}(x)$ projects onto the tangent space $T_x \mathcal{M}$, and $D\mathcal{H}(x)$ is the Jacobian of $d$0. For computational stability, a convex combination is used:

$d$1

These kernels induce, in the continuum limit, a Riemannian metric on $d$2:

$d$3

such that diffusion distances and resulting embeddings become increasingly sensitive to the feature directions of $d$4.

2. Estimation of Local Jacobian and Tangent Spaces

Given sample data $d$5 and observed features $d$6, IDMap estimates $d$7 at each $d$8 using local linear regression. For each $d$9, its $$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$0 nearest neighbors $$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$1 are selected, and weighted centered differences are constructed:

$$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$2

$$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$3

These are assembled into matrices $$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$4 and $$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$5. The regression

$$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$6

yields a first-order estimate of the projected Jacobian with $$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$7 error under regularity conditions. The SVD of $$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$8 at each point provides information about the local tangent space and rates of change associated with $$\mathcal{H}: \mathcal{M} \to \mathcal{N} \subset \mathbb{R}^n$$9.

3. Dimension Selection and Bandwidth Scaling Laws

Analysis of the SVD of $$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$0 over a neighborhood provides both intrinsic local dimension and optimal bandwidth selection. For $$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$1 tangent directions, singular values scale as $$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$2, while the remaining scale as $$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$3. This scaling is quantified by exponents:

$$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$4

Aggregated scaling exponents give determinant-based dimension estimates, e.g.,

$$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$5

Bandwidth $$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$6 is selected locally by maximizing $$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$7 (density-based) or minimizing a consistency criterion:

$$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$8

This provides a principled approach to local geometry adaptation and regularization.

4. Iterated Diffusion Map Algorithm and Geometric Flow Interpretation

The core IDMap procedure iteratively reshapes data geometry to emphasize the designated feature:

1. At each iteration $$K_\epsilon(x, y) = \exp\left(-\tfrac{1}{2} (x-y)^\top C(x)^{-1} (x-y) / \epsilon\right)$$9:
   • For each data point, estimate $C(x) \in \mathbb{R}^{m \times m}$0.
   • Construct an adaptive kernel using updated $C(x) \in \mathbb{R}^{m \times m}$1.
   • Build the sparse kernel matrix, normalize to a graph Laplacian.
   • Compute the top $C(x) \in \mathbb{R}^{m \times m}$2 diffusion map coordinates.
   • Rescale embeddings:

$C(x) \in \mathbb{R}^{m \times m}$3

1. Repeat for $C(x) \in \mathbb{R}^{m \times m}$4 iterations.

The process induces a discrete approximation to a geometric flow:

$C(x) \in \mathbb{R}^{m \times m}$5

which collapses directions orthogonal to $C(x) \in \mathbb{R}^{m \times m}$6, isolating the submanifold that encodes the feature of interest.

Pseudocode Summary:

$\mathcal{I}(x)$0

5. Convergence Properties and Theoretical Guarantees

Suppose $C(x) \in \mathbb{R}^{m \times m}$7, a product manifold where $C(x) \in \mathbb{R}^{m \times m}$8. Locally, $C(x) \in \mathbb{R}^{m \times m}$9. The geometric flow satisfies:

$\mathcal{H}$0

As $\mathcal{H}$1, the irrelevant factor $\mathcal{H}$2 is collapsed, and IDMap produces an embedding isometric to $\mathcal{H}$3, the feature manifold. In settings where features are not exact quotients, IDMap empirically yields a lower-dimensional embedding where neighborhoods track the feature geometry. Theoretical results demonstrate convergence to the quotient manifold for product structures and near-isometric recoveries up to linear alignment of coordinates.

6. Empirical Results and Robustness

Empirical evaluation spans several canonical manifolds:

• Annulus ($\mathcal{H}$4): Target feature = radius $\mathcal{H}$5. After $\mathcal{H}$6 iterations (τ=0.65, M=250, k=500), the angular component is suppressed and the embedding recovers $\mathcal{H}$7. Nearest neighbor tests show convergence of feature neighborhoods.
• Torus ($\mathcal{H}$8): Target feature = either circle factor. The irrelevant circle is collapsed (τ=0.4 or 0.65), yielding 1D embeddings aligned to the chosen circle, again after 4 iterations.
• Sphere ($\mathcal{H}$9): Target feature = $$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$0-coordinate or more complex functions. IDMap (τ ≈ 0.6–0.7) contracts the sphere to a 1D embedding aligned with the feature.
• Performance metrics include neighborhood-recovery accuracy (fraction of true feature neighbors captured among $$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$1 nearest neighbors), embedding distortion, and SVD scree plots.
• Robustness: The method is tolerant to moderate ambient Gaussian noise and high curvature. Satisfactory operation depends on proper tuning of local bandwidth $$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$2 and pseudotime $$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$3.

In all cases, IDMap outperforms isotropic diffusion maps, which fail to suppress irrelevant factors, thus demonstrating the claim that local anisotropic adaptation aligned with the feature is essential for targeted manifold learning.

Table: Key Algorithmic Elements of IDMap

Component	Mathematical Expression / Procedure	Purpose
Anisotropic Kernel	$$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$4 as above	Induces feature-aligned metric
Jacobian Estimation	$$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$5 via weighted regression	Adapts local geometry
Iterative Update	$$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$6 rescaled diffusion coordinates	Geometric flow toward feature
Dimension Selection	SVD scaling laws, maximizing $$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$7 or minimizing $$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$8	Adapt bandwidth, select $$c(x)^{-1} = \mathcal{I}(x) C(x)^{-1} \mathcal{I}(x)^\top = D\mathcal{H}(x)^\top D\mathcal{H}(x)$$9

7. Context, Implications, and Related Frameworks

IDMap is situated in the lineage of spectral manifold learning methods, extending classical diffusion maps [Coifman & Lafon] by adaptively deforming geometry using supervised feature information. It unifies concepts from kernelized Laplacian approximation, data-driven Riemannian metrics, and geometric flows, and builds on precedents such as local kernels [LK], vector diffusion maps [Singer & Wu], and neighborhood regression.

Key implications:

• IDMap enables feature-focused embedding and manifold quotienting where only a subset of variables are relevant.
• The local scaling and bandwidth adaptation procedures provide robust practical tools for high-curvature, noisy, or high-codimension datasets.
• A plausible implication is that this methodology can be extended to unsupervised feature selection by iteratively aligning kernels to data-driven discriminants.

Potential limitations include sensitivity to proper kernel bandwidth and the elevation of noise if feature signals are weak compared to irrelevant coordinates. Further study of convergence rates, global alignment, and scaling in massive data regimes remains an open direction.