We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1607.05002")
get_code_for_paper("1607.05002")
have("1607.05002")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1607.05002.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1607.05002)
Connect an agent — have() is free.