Geometric Mean Metric Learning

07/18/2016
by   Pourya Habib Zadeh, et al.
0

We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric appeal through the Riemannian geometry of positive definite matrices; (ii) ease of interpretability; and (iii) computational speed several orders of magnitude faster than the widely used LMNN and ITML methods. Furthermore, on standard benchmark datasets, our closed-form solution consistently attains higher classification accuracy.

READ FULL TEXT
research
01/10/2015

Riemannian Metric Learning for Symmetric Positive Definite Matrices

Over the past few years, symmetric positive definite (SPD) matrices have...
research
02/23/2022

Robust Geometric Metric Learning

This paper proposes new algorithms for the metric learning problem. We s...
research
04/23/2022

A Novel Splitting Criterion Inspired by Geometric Mean Metric Learning for Decision Tree

Decision tree (DT) attracts persistent research attention due to its imp...
research
09/29/2016

OPML: A One-Pass Closed-Form Solution for Online Metric Learning

To achieve a low computational cost when performing online metric learni...
research
07/01/2020

Ultrahyperbolic Representation Learning

In machine learning, data is usually represented in a (flat) Euclidean s...
research
06/10/2017

An Alternative to EM for Gaussian Mixture Models: Batch and Stochastic Riemannian Optimization

We consider maximum likelihood estimation for Gaussian Mixture Models (G...
research
07/27/2019

Triangulation: Why Optimize?

For decades, it has been widely accepted that the gold standard for two-...

Please sign up or login with your details

Forgot password? Click here to reset