Positive semidefinite support vector regression metric learning
Most existing metric learning methods focus on learning a similarity or distance measure relying on similar and dissimilar relations between sample pairs. However, pairs of samples cannot be simply identified as similar or dissimilar in many real-world applications, e.g., multi-label learning, label distribution learning. To this end, relation alignment metric learning (RAML) framework is proposed to handle the metric learning problem in those scenarios. But RAML framework uses SVR solvers for optimization. It can't learn positive semidefinite distance metric which is necessary in metric learning. In this paper, we propose two methds to overcame the weakness. Further, We carry out several experiments on the single-label classification, multi-label classification, label distribution learning to demonstrate the new methods achieves favorable performance against RAML framework.
Code (0)
등록된 구현이 없습니다.
Tasks
General ClassificationMetric LearningMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONMulti-Label LearningregressionSimilar Papers 제목 키워드 기반
Regularization-free estimation in trace regression with symmetric positive semidefinite matrices
Over the past few years, trace regression models have received considerable attention in the context of matrix completion, quantum state tomography, and compressed sensing. Estimation of the underlying matrix from regula…
compressed sensingMatrix CompletionQuantum State TomographyregressionPositive Semidefinite Metric Learning with Boosting
The learning of appropriate distance metrics is a critical problem in classification. In this work, we propose a boosting-based technique, termed BoostMetric, for learning a Mahalanobis distance metric. One of the primar…
General ClassificationMetric LearningSign-Aware Multistate Jaccard Kernels and Geometry for Real and Complex-Valued Signals
We introduce a sign-aware, multistate Jaccard/Tanimoto framework that extends overlap-based distances from nonnegative vectors and measures to arbitrary real- and complex-valued signals while retaining bounded metric and…
Feature EngineeringSupport Vector Machine Classification with Indefinite Kernels
In this paper, we propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our method simultaneously finds the support …
ClassificationGeneral ClassificationRobust classificationIterated Support Vector Machines for Distance Metric Learning
Distance metric learning aims to learn from the given training data a valid distance metric, with which the similarity between data samples can be more effectively evaluated for classification. Metric learning is often f…
ClassificationFace VerificationGeneral ClassificationHandwritten Digit Recognition+3