Sparse Least Squares Low Rank Kernel Machines

01/29/2019
by   Manjing Fang, et al.
0

A general framework of least squares support vector machine with low rank kernels, referred to as LR-LSSVM, is introduced in this paper. The special structure of low rank kernels with a controlled model size brings sparsity as well as computational efficiency to the proposed model. Meanwhile, a two-step optimization algorithm with three different criteria is proposed and various experiments are carried out using the example of the so-call robust RBF kernel to validate the model. The experiment results show that the performance of the proposed algorithm is comparable or superior to several existing kernel machines.

READ FULL TEXT

page 1

page 2

page 3

page 4

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/07/2017

Sparse Algorithm for Robust LSSVM in Primal Space

As enjoying the closed form solution, least squares support vector machi...
research
04/30/2013

A least-squares method for sparse low rank approximation of multivariate functions

In this paper, we propose a low-rank approximation method based on discr...
research
06/01/2018

IGCV3: Interleaved Low-Rank Group Convolutions for Efficient Deep Neural Networks

In this paper, we are interested in building lightweight and efficient c...
research
03/14/2019

Low-rank Kernel Learning for Graph-based Clustering

Constructing the adjacency graph is fundamental to graph-based clusterin...
research
02/04/2022

Learning Representation from Neural Fisher Kernel with Low-rank Approximation

In this paper, we study the representation of neural networks from the v...
research
02/24/2017

Learning Rates for Kernel-Based Expectile Regression

Conditional expectiles are becoming an increasingly important tool in fi...

Please sign up or login with your details

Forgot password? Click here to reset