paper-with-me

홈 › Papers

The GaussianSketch for Almost Relative Error Kernel Distance

2018-11-09 · Jeff M. Phillips, Wai Ming Tai

We introduce two versions of a new sketch for approximately embedding the Gaussian kernel into Euclidean inner product space. These work by truncating infinite expansions of the Gaussian kernel, and carefully invoking the RecursiveTensorSketch [Ahle et al. SODA 2020]. After providing concentration and approximation properties of these sketches, we use them to approximate the kernel distance between points sets. These sketches yield almost $(1+\varepsilon)$-relative error, but with a small additive $\alpha$ term. In the first variants the dependence on $1/\alpha$ is poly-logarithmic, but has higher degree of polynomial dependence on the original dimension $d$. In the second variant, the dependence on $1/\alpha$ is still poly-logarithmic, but the dependence on $d$ is linear.

📄 PDF Abstract BibTeX arXiv:1811.04136

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On The Relative Error of Random Fourier Features for Preserving Kernel Distance

2022-10-01 · Kuan Cheng, Shaofeng H. -C. Jiang, Luojian Wei, Zhide Wei

The method of random Fourier features (RFF), proposed in a seminal paper by Rahimi and Recht (NIPS'07), is a powerful technique to find approximate low-dimensional representations of points in (high-dimensional) kernel s…

Dimensionality Reduction

Relative Error Embeddings for the Gaussian Kernel Distance

2016-02-17 · Di Chen, Jeff M. Phillips

A reproducing kernel can define an embedding of a data point into an infinite dimensional reproducing kernel Hilbert space (RKHS). The norm in this space describes a distance, which we call the kernel distance. The rando…

Semi-supervised Kernel Metric Learning Using Relative Comparisons

2016-12-01 · Ehsan Amid, Aristides Gionis, Antti Ukkonen

We consider the problem of metric learning subject to a set of constraints on relative-distance comparisons between the data items. Such constraints are meant to reflect side-information that is not expressed directly in…

ClusteringMetric Learning

Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method

2008-12-01 · NeurIPS 2008 12 · Dongryeol Lee, Alexander G. Gray

We propose a new fast Gaussian summation algorithm for high-dimensional datasets with high accuracy. First, we extend the original fast multipole-type methods to use approximation schemes with both hard and probabilistic…

Dimensionality ReductionVocal Bursts Intensity Prediction

KERPLE: Kernelized Relative Positional Embedding for Length Extrapolation

2022-05-20 · Ta-Chung Chi, Ting-Han Fan, Peter J. Ramadge, Alexander I. Rudnicky

Relative positional embeddings (RPE) have received considerable attention since RPEs effectively model the relative distance among tokens and enable length extrapolation. We propose KERPLE, a framework that generalizes r…

DiversityLanguage ModelingLanguage ModellingPosition