Local Rademacher Complexity for Multi-Label Learning

Publication Type:
Journal Article
Citation:
IEEE Transactions on Image Processing, 2016, 25 (3), pp. 1495 - 1507
Issue Date:
2016-03-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail1410.6990v1.pdfPublished Version1.23 MB
Adobe PDF
© 1992-2012 IEEE. We analyze the local Rademacher complexity of empirical risk minimization-based multi-label learning algorithms, and in doing so propose a new algorithm for multi-label learning. Rather than using the trace norm to regularize the multi-label predictor, we instead minimize the tail sum of the singular values of the predictor in multi-label learning. Benefiting from the use of the local Rademacher complexity, our algorithm, therefore, has a sharper generalization error bound. Compared with methods that minimize over all singular values, concentrating on the tail singular values results in better recovery of the low-rank structure of the multi-label predictor, which plays an important role in exploiting label correlations. We propose a new conditional singular value thresholding algorithm to solve the resulting objective function. Moreover, a variance control strategy is employed to reduce the variance of variables in optimization. Empirical studies on real-world data sets validate our theoretical results and demonstrate the effectiveness of the proposed algorithm for multi-label learning.
Please use this identifier to cite or link to this item: