SOTAVerified

Passive-Aggressive online learning with nonlinear embeddings

2018-01-31Pattern Recognition 2018Code Available0· sign in to hype

Javier Jorge, Roberto Paredes

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Nowadays, there is an increasing demand for machine learning techniques which can deal with problems where the instances are produced as a stream or in real time. In these scenarios, online learning is able to learn a model from data that comes continuously. The adaptability, efficiency and scalability of online learning techniques have been gaining interest last years with the increasing amount of data generated every day. In this paper, we propose a novel binary classification approach based on nonlinear mapping functions under an online learning framework. The non-convex optimization problem that arises is split into three different convex problems that are solved by means of Passive-Aggressive Online Learning. We evaluate both the adaptability and generalization of our model through several experiments comparing with the state of the art techniques. We improve significantly the results in several datasets widely used previously by the online learning community.

Tasks

Reproductions