A novel multivariate performance optimization method based on sparse coding and hyper-predictor learning

Jiachen Yang

doi:10.1016/j.neunet.2015.07.011

Return

A novel multivariate performance optimization method based on sparse coding and hyper-predictor learning

2015-11-01

DOI：10.1016/j.neunet.2015.07.011

Original

Save

View PDF

Abstract

En 中文

In this paper, we investigate the problem of optimization of multivariate performance measures, and propose a novel algorithm for it. Different from traditional machine learning methods which optimize simple loss functions to learn prediction function, the problem studied in this paper is how to learn effective hyper-predictor for a tuple of data points, so that a complex loss function corresponding to a multivariate performance measure can be minimized. We propose to present the tuple of data points to a tuple of sparse codes via a dictionary, and then apply a linear function to compare a sparse code against a given candidate class label. To learn the dictionary, sparse codes, and parameter of the linear function, we propose a joint optimization problem. In this problem, the both the reconstruction error and sparsity of sparse code, and the upper bound of the complex loss function are minimized. Moreover, the upper bound of the loss function is approximated by the sparse codes and the linear function parameter. To optimize this problem, we develop an iterative algorithm based on descent gradient methods to learn the sparse codes and hyper-predictor parameter alternately. Experiment results on some benchmark data sets show the advantage of the proposed methods over other state-of-the-art algorithms. (C) 2015 Elsevier Ltd. All rights reserved.

Keywords:

Pattern classification

Loss function

Multivariate performance measures

Sparse coding

Joint learning

Alternate optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.