Supervised Categorical Metric Learning with Schatten p-Norms

by   Xuhui Fan, et al.

Metric learning has been successful in learning new metrics adapted to numerical datasets. However, its development on categorical data still needs further exploration. In this paper, we propose a method, called CPML for categorical projected metric learning, that tries to efficiently (i.e. less computational time and better prediction accuracy) address the problem of metric learning in categorical data. We make use of the Value Distance Metric to represent our data and propose new distances based on this representation. We then show how to efficiently learn new metrics. We also generalize several previous regularizers through the Schatten p-norm and provides a generalization bound for it that complements the standard generalization bound for metric learning. Experimental results show that our method provides


page 1

page 2

page 3

page 4


Sparse Compositional Metric Learning

We propose a new approach for metric learning by framing it as learning ...

Reduced-Rank Local Distance Metric Learning for k-NN Classification

We propose a new method for local distance metric learning based on samp...

Learning Local Metrics and Influential Regions for Classification

The performance of distance-based classifiers heavily depends on the und...

A Metric Learning Reality Check

Deep metric learning papers from the past four years have consistently c...

Field-wise Learning for Multi-field Categorical Data

We propose a new method for learning with multi-field categorical data. ...

Kernel Regression with Sparse Metric Learning

Kernel regression is a popular non-parametric fitting technique. It aims...

Nonlinear Metric Learning through Geodesic Polylinear Interpolation (ML-GPI)

In this paper, we propose a nonlinear distance metric learning scheme ba...

Please sign up or login with your details

Forgot password? Click here to reset