Kernelized Diffusion maps

2023-02-13 · Loucas Pillaud-Vivien, Francis Bach

Spectral clustering and diffusion maps are celebrated dimensionality reduction algorithms built on eigen-elements related to the diffusive structure of the data. The core of these procedures is the approximation of a Laplacian through a graph kernel approach, however this local average construction is known to be cursed by the high-dimension d. In this article, we build a different estimator of the Laplacian, via a reproducing kernel Hilbert space method, which adapts naturally to the regularity of the problem. We provide non-asymptotic statistical rates proving that the kernel estimator we build can circumvent the curse of dimensionality. Finally we discuss techniques (Nystr\"om subsampling, Fourier features) that enable to reduce the computational cost of the estimator while not degrading its overall performance.

📄 PDF Abstract BibTeX arXiv:2302.06757

Code (1)

viviencabannes/laplacian pytorch

Tasks

ClusteringDimensionality Reduction

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Adaptive Kernel Selection for Kernelized Diffusion Maps

2026-04-20 · Othmane Aboussaad, Adam Miraoui, Boumediene Hamzi, Houman Owhadi arxiv

Selecting an appropriate kernel is a central challenge in kernel-based spectral methods. In \emph{Kernelized Diffusion Maps} (KDM), the kernel determines the accuracy of the RKHS estimator of a diffusion-type operator an…

Kernelized Few-Shot Object Detection With Efficient Integral Aggregation

2022-01-01 · CVPR 2022 1 · Shan Zhang, Lei Wang, Naila Murray, Piotr Koniusz

We design a Kernelized Few-shot Object Detector by leveraging kernelized matrices computed over multiple proposal regions, which yield expressive non-linear representations whose model complexity is learned on the fl…

Few-Shot Object Detection Object object-detection Object Detection+1

Generative Modeling via Kernelized Stochastic Interpolants

2026-02-23 · Florentin Coeurdoux, Etienne Lempereur, Nathanaël Cuvelle-Magar, Stéphane Mallat 외 arxiv

We develop a kernel method for generative modeling within the stochastic interpolant framework, replacing neural network training with linear systems. The drift of the generative SDE is $\hat b_t(x) = \nablaφ(x)^\topη_t$…

Image Generation

On Learning the Transformer Kernel

2021-10-15 · Sankalan Pal Chowdhury, Adamos Solomou, Avinava Dubey, Mrinmaya Sachan

In this work we introduce KERNELIZED TRANSFORMER, a generic, scalable, data driven framework for learning the kernel function in Transformers. Our framework approximates the Transformer kernel as a dot product between sp…

Computational Efficiency

The Kernelized Taylor Diagram

2022-05-18 · Kristoffer Wickstrøm, J. Emmanuel Johnson, Sigurd Løkse, Gustau Camps-Valls 외

This paper presents the kernelized Taylor diagram, a graphical framework for visualizing similarities between data populations. The kernelized Taylor diagram builds on the widely used Taylor diagram, which is used to vis…

Data Visualization