# Signed Graph Metric Learning via Gershgorin Disc Alignment

15 Jun 2020Cheng YangGene CheungWei Hu

Given a convex and differentiable objective $Q(\M)$ for a real, symmetric matrix $\M$ in the positive definite (PD) cone---used to compute Mahalanobis distances---we propose a fast general metric learning framework that is entirely projection-free. We first assume that $\M$ resides in a space $\cS$ of generalized graph Laplacian matrices (graph metric matrices) corresponding to balanced signed graphs... (read more)

PDF Abstract

No code implementations yet. Submit your code now