Accelerate Vector Diffusion Maps by Landmarks

Abstract: We propose a landmark-constrained algorithm, LA-VDM (Landmark Accelerated Vector Diffusion Maps), to accelerate the Vector Diffusion Maps (VDM) framework built upon the Graph Connection Laplacian (GCL), which captures pairwise connection relationships within complex datasets. LA-VDM introduces a novel two-stage normalization that effectively address nonuniform sampling densities in both the data and the landmark sets. Under a manifold model with the frame bundle structure, we show that we can accurately recover the parallel transport with landmark-constrained diffusion from a point cloud, and hence asymptotically LA-VDM converges to the connection Laplacian. The performance and accuracy of LA-VDM are demonstrated through experiments on simulated datasets and an application to nonlocal image denoising.

• The paper introduces Landmark Accelerated Vector Diffusion Maps (LA-VDM), reducing computational complexity to O(nm²) while preserving vector-bundle geometry and connection-Laplacian convergence.
• The method controls curvature-induced double-transport error at O(ε³ᐟ²) and uses β/α normalization to correct landmark and data-density effects, recovering density-independent operators under suitable sampling.
• Experiments show accurate eigenpair recovery with 500 landmarks for 5,000 points and practical scaling to one million points, while robustness to noisy or estimated connections remains open.

Motivation and background

The Graph Connection Laplacian (GCL) and Vector Diffusion Maps (VDM), introduced by Singer and Wu, extend the diffusion maps framework by encoding pairwise connection information—group-valued relationships such as rotations—alongside scalar affinity. Under a manifold model, the GCL converges asymptotically to the connection Laplacian of an underlying vector bundle, and VDM yields spectral embeddings based on the associated heat kernel. These frameworks have found applications ranging from cryo-EM class averaging and ptychographic phase retrieval to jigsaw puzzle solving, ECG-derived respiration enhancement, and image-based photoplethysmography.

A persistent obstacle is computational cost: the eigendecomposition required by VDM scales as $O(n^{2.81})$ (or $O(n^{2+\epsilon})$ with sparse graphs), which is prohibitive for large point clouds. Existing mitigations—$k$-nearest-neighbor sparsification and Nyström extension—are either noise-sensitive or fail to preserve geometric information. The landmark diffusion approach (ROSELAND) resolves this for ordinary diffusion maps by constraining diffusion to pass through a small landmark set: with $m = n^\beta$ landmarks, $\beta \in (0, 1/2)$, the complexity drops to $O(n^{1+2\beta})$. Extending this idea to the connection-Laplacian setting, however, is nontrivial for two reasons. First, landmark-constrained diffusion forces parallel transport along two-stage piecewise geodesic paths, and parallel transport is path-dependent in the presence of curvature, so it is not obvious that the connection can be approximated accurately. Second, ROSELAND's accuracy depends on the landmark sampling density, for which the only available correction requires estimating the data density on the manifold.

The LA-VDM algorithm

The proposed algorithm, Landmark Accelerated Vector Diffusion Maps (LA-VDM), generalizes ROSELAND to the principal-bundle setting. Given a point cloud $\tilde{\mathcal{X}}$ of size $n$ and a landmark set $\tilde{\mathcal{Z}}$ of size $m \ll n$, the method builds a bipartite landmark connection graph carrying scalar affinities $O(n^{2+\epsilon})$0 and connection functions $O(n^{2+\epsilon})$1, assembled into a block matrix $O(n^{2+\epsilon})$2. The key algorithmic novelty is a two-stage normalization:

• Landmark ($O(n^{2+\epsilon})$3-)normalization: the matrix $O(n^{2+\epsilon})$4, computed from the landmark affinity structure, corrects for nonuniform sampling density of the landmark set via $O(n^{2+\epsilon})$5, where $O(n^{2+\epsilon})$6.
• Dataset ($O(n^{2+\epsilon})$7-)normalization: a subsequent $O(n^{2+\epsilon})$8-normalization $O(n^{2+\epsilon})$9 corrects for nonuniform sampling of the point cloud itself, mirroring classical diffusion maps.

The embedding is then obtained from the SVD of the normalized block matrix $k$0, whose left singular vectors are eigenvectors of the induced Markov transition matrix $k$1, where $k$2 aggregates affinity and connection through the landmark set. The total complexity is $k$3; for $k$4 this improves on the $k$5 cost of vanilla VDM. When the bundle is trivial and normalization is omitted, LA-VDM reduces exactly to ROSELAND, so the two-stage normalization also constitutes an improvement to ROSELAND itself.

Theoretical guarantees

The central theoretical concern is the "double" parallel transport: transporting a vector from $k$6 to $k$7 via an intermediate landmark $k$8 may differ from geodesic transport due to curvature. The paper resolves this with a lemma, based on the double exponential map expansion of Gavrilov, showing that for $k$9 mutually within $m = n^\beta$0-neighborhoods,

$m = n^\beta$1

so the landmark detour contributes only a higher-order error. Consequently, the effective transport operator $m = n^\beta$2 admits an asymptotically Gaussian, though generally anisotropic, effective landmark kernel (Proposition 4.6); for the trivial line bundle this reduces to the effective kernel of ROSELAND.

Bias analysis. Under a compact manifold model with a principal $m = n^\beta$3-bundle, smooth densities $m = n^\beta$4 and $m = n^\beta$5 bounded away from zero, and an exponentially decaying kernel, the landmark diffusion operator satisfies

$m = n^\beta$6

with $m = n^\beta$7 and $m = n^\beta$8. Three corollaries guide hyperparameter selection. With landmarks sampled from the data ($m = n^\beta$9), choosing $\beta \in (0, 1/2)$0 renders the landmark distribution inconsequential, recovering the vanilla VDM operator up to a factor of two in the leading diffusion coefficient—expected, since landmark diffusion is effectively a two-step process. Choosing $\beta \in (0, 1/2)$1 makes the asymptotic operator entirely independent of $\beta \in (0, 1/2)$2, though generally different from the vanilla VDM operator. Finally, with $\beta \in (0, 1/2)$3, $\beta \in (0, 1/2)$4, and $\beta \in (0, 1/2)$5, the asymptotic operator is independent of both $\beta \in (0, 1/2)$6 and $\beta \in (0, 1/2)$7 and equals the intrinsic connection Laplacian—resolving the landmark-density issue that ROSELAND leaves unsolved.

Variance analysis. With $\beta \in (0, 1/2)$8 and $\beta \in (0, 1/2)$9 satisfying $O(n^{1+2\beta})$0, the discrete operator satisfies, with probability at least $O(n^{1+2\beta})$1,

$O(n^{1+2\beta})$2

establishing pointwise convergence of LA-VDM to the connection Laplacian at the same high-probability rate as the vanilla framework. The analysis does assume accurate access to the parallel transport between nearby points (e.g., via local PCA and rotational alignment for the tangent bundle); the authors note this assumption can be removed in many practical settings, but the theory does not cover noisy or estimated connections.

Numerical validation

The experiments support each theoretical claim. On a fully asymmetric distorted sphere diffeomorphic to $O(n^{1+2\beta})$3, the median $O(n^{1+2\beta})$4 error of the landmark-approximated parallel transport decreases monotonically with the landmark count, from $O(n^{1+2\beta})$5 at $O(n^{1+2\beta})$6 to $O(n^{1+2\beta})$7 at $O(n^{1+2\beta})$8. On a Klein bottle with $O(n^{1+2\beta})$9, eigenvalue difference ratios and eigenvector cosine similarities between LA-VDM and VDM improve consistently as $\tilde{\mathcal{X}}$0 grows from 128 to 2048 (e.g., the first eigenvector relative $\tilde{\mathcal{X}}$1 error drops from $\tilde{\mathcal{X}}$2 to $\tilde{\mathcal{X}}$3), with Wilcoxon signed-rank tests (Bonferroni-corrected at $\tilde{\mathcal{X}}$4) confirming statistical significance. On a nonuniformly sampled distorted sphere with $\tilde{\mathcal{X}}$5, $\tilde{\mathcal{X}}$6-LA-VDM best approximates vanilla VDM, matching Corollary 4.10; varying $\tilde{\mathcal{X}}$7 toward 1 with $\tilde{\mathcal{X}}$8 progressively removes the sampling-density dependence, matching Corollary 4.12. In an eigenpair recovery experiment with $\tilde{\mathcal{X}}$9 and only $n$0 landmarks, LA-VDM accurately recovers the top six eigenpairs of VDM.

Scalability. For $n$1 and $n$2 points on the Klein bottle and distorted sphere, LA-VDM with roughly $n$3 landmarks completes in 330.7 s and 782.9 s (Klein bottle) and 281.8 s and 710.6 s (distorted sphere). Vanilla VDM is infeasible at $n$4 even after sparsifying to about 0.17% nonzero entries, and requires roughly 50 minutes at $n$5—a substantial practical gap.

Limitations and open questions

Several assumptions bound the scope of the results. The theory presumes accurate connection information between nearby points; robustness to estimated or noisy connections is not analyzed. The landmark design guarantee (Corollary 4.10) requires $n$6, i.e., landmarks sampled from the data distribution, and the paper does not address adaptive or optimized landmark selection under unknown density. The variance bound constrains $n$7 relative to $n$8 and $n$9, and the bias expansion is local; the interaction between anisotropy of the effective kernel and the spectral embedding at moderate $\tilde{\mathcal{Z}}$0 is characterized only empirically. Whether the two-stage normalization extends to non-orthogonal structure groups or to landmark sets collected independently of the data with unknown $\tilde{\mathcal{Z}}$1 remains open.

Conclusion

LA-VDM extends landmark-constrained diffusion to the vector-bundle setting, achieving $\tilde{\mathcal{Z}}$2 complexity while provably recovering the connection Laplacian. The two central contributions are the demonstration that curvature-induced path dependence of double parallel transport is asymptotically negligible ($\tilde{\mathcal{Z}}$3), and a two-stage $\tilde{\mathcal{Z}}$4 normalization that removes dependence on both landmark and data sampling densities—an issue ROSELAND does not resolve. Simulations on nontrivial bundles and experiments at the million-point scale confirm both the accuracy guarantees and the practical feasibility gains over vanilla VDM.