Learning with Algebraic Invariances, and the Invariant Kernel Trick

11/28/2014
by   Franz J Király, et al.
0

When solving data analysis problems it is important to integrate prior knowledge and/or structural invariances. This paper contributes by a novel framework for incorporating algebraic invariance structure into kernels. In particular, we show that algebraic properties such as sign symmetries in data, phase independence, scaling etc. can be included easily by essentially performing the kernel trick twice. We demonstrate the usefulness of our theory in simulations on selected applications such as sign-invariant spectral clustering and underdetermined ICA.

READ FULL TEXT

page 10

page 11

research
03/09/2023

Clones, polymorphisms and relations of arity omega

Polymorphisms of arity omega have recently been used in the proof of mod...
research
06/19/2015

Spectral Analysis of Symmetric and Anti-Symmetric Pairwise Kernels

We consider the problem of learning regression functions from pairwise d...
research
07/08/2022

Large Bayesian VARs with Factor Stochastic Volatility: Identification, Order Invariance and Structural Analysis

Vector autoregressions (VARs) with multivariate stochastic volatility ar...
research
04/27/2015

Sign Stable Random Projections for Large-Scale Learning

We study the use of "sign α-stable random projections" (where 0<α≤ 2) fo...
research
07/10/2020

Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries

The algebraic approach for provenance tracking, originating in the semir...
research
10/02/2019

Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings

We consider the problem of outputting succinct encodings of lists of gen...

Please sign up or login with your details

Forgot password? Click here to reset