IKA: Independent Kernel Approximator

09/05/2018
by   Matteo Ronchetti, et al.
0

This paper describes a new method for low rank kernel approximation called IKA. The main advantage of IKA is that it produces a function ψ(x) defined as a linear combination of arbitrarily chosen functions. In contrast the approximation produced by Nyström method is a linear combination of kernel evaluations. The proposed method consistently outperformed Nyström method in a comparison on the STL-10 dataset. Numerical results are reproducible using the source code available at https://gitlab.com/matteo-ronchetti/IKA

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2022

Linear Time Kernel Matrix Approximation via Hyperspherical Harmonics

We propose a new technique for constructing low-rank approximations of m...
research
12/24/2022

Data-Driven Linear Complexity Low-Rank Approximation of General Kernel Matrices: A Geometric Approach

A general, rectangular kernel matrix may be defined as K_ij = κ(x_i,y_j)...
research
05/27/2022

ℤ_pℤ_p^2-linear codes: rank and kernel

A code C is called _p_p^2-linear if it is the Gray image of a _p_p^2-add...
research
01/05/2021

Kernel optimization for Low-Rank Multi-Fidelity Algorithms

One of the major challenges for low-rank multi-fidelity (MF) approaches ...
research
02/20/2023

Nystrom Method for Accurate and Scalable Implicit Differentiation

The essential difficulty of gradient-based bilevel optimization using im...
research
07/11/2012

On-line Prediction with Kernels and the Complexity Approximation Principle

The paper describes an application of Aggregating Algorithm to the probl...
research
10/11/2020

A kernel-independent sum-of-Gaussians method by de la Vallée-Poussin sums

Approximation of interacting kernels by sum of Gaussians (SOG) is freque...

Please sign up or login with your details

Forgot password? Click here to reset