Fast Polynomial Kernel Classification for Massive Data

11/24/2019
by   Jinshan Zeng, et al.
0

In the era of big data, it is highly desired to develop efficient machine learning algorithms to tackle massive data challenges such as storage bottleneck, algorithmic scalability, and interpretability. In this paper, we develop a novel efficient classification algorithm, called fast polynomial kernel classification (FPC), to conquer the scalability and storage challenges. Our main tools are a suitable selected feature mapping based on polynomial kernels and an alternating direction method of multipliers (ADMM) algorithm for a related non-smooth convex optimization problem. Fast learning rates as well as feasibility verifications including the convergence of ADMM and the selection of center points are established to justify theoretical behaviors of FPC. Our theoretical assertions are verified by a series of simulations and real data applications. The numerical results demonstrate that FPC significantly reduces the computational burden and storage memory of the existing learning schemes such as support vector machines and boosting, without sacrificing their generalization abilities much.

READ FULL TEXT
research
04/24/2016

Stochastic Variance-Reduced ADMM

The alternating direction method of multipliers (ADMM) is a powerful opt...
research
04/01/2020

Fully-Corrective Gradient Boosting with Squared Hinge: Fast Learning Rates and Early Stopping

Boosting is a well-known method for improving the accuracy of weak learn...
research
06/22/2020

An Efficient Smoothing Proximal Gradient Algorithm for Convex Clustering

Cluster analysis organizes data into sensible groupings and is one of fu...
research
02/13/2022

Quasistatic cohesive fracture with an alternating direction method of multipliers

A method for quasistatic cohesive fracture is introduced that uses an al...
research
09/02/2021

Adaptive Uncertainty-Weighted ADMM for Distributed Optimization

We present AUQ-ADMM, an adaptive uncertainty-weighted consensus ADMM met...
research
09/16/2020

Kernel-based L_2-Boosting with Structure Constraints

Developing efficient kernel methods for regression is very popular in th...

Please sign up or login with your details

Forgot password? Click here to reset