Generalization-Memorization Machines

by   Zhen Wang, et al.

Classifying the training data correctly without over-fitting is one of the goals in machine learning. In this paper, we propose a generalization-memorization mechanism, including a generalization-memorization decision and a memory modeling principle. Under this mechanism, error-based learning machines improve their memorization abilities of training data without over-fitting. Specifically, the generalization-memorization machines (GMM) are proposed by applying this mechanism. The optimization problems in GMM are quadratic programming problems and could be solved efficiently. It should be noted that the recently proposed generalization-memorization kernel and the corresponding support vector machines are the special cases of our GMM. Experimental results show the effectiveness of the proposed GMM both on memorization and generalization.


page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8


Near-Tight Margin-Based Generalization Bounds for Support Vector Machines

Support Vector Machines (SVMs) are among the most fundamental tools for ...

Least Squares Maximum and Weighted Generalization-Memorization Machines

In this paper, we propose a new way of remembering by introducing a memo...

Fast Multilevel Support Vector Machines

Solving different types of optimization models (including parameters fit...

Multi-view learning with privileged weighted twin support vector machine

Weighted twin support vector machines (WLTSVM) mines as much potential s...

Challenging Images For Minds and Machines

There is no denying the tremendous leap in the performance of machine le...

Generalization Analysis for Game-Theoretic Machine Learning

For Internet applications like sponsored search, cautions need to be tak...

Low-Rank Multitask Learning based on Tensorized SVMs and LSSVMs

Multitask learning (MTL) leverages task-relatedness to enhance performan...

Please sign up or login with your details

Forgot password? Click here to reset