atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Orthogonality-Promoting Distance Metric Learning: Convex Relaxation and Theoretical Analysis

ICML 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use convex CSFN regularization in MDML instead of nonconvex SFN regularization in PDMLOrthogonality-promoting distance metric learning · MIMICAUC (A-All): 0.662 -> 0.668Helped
Use convex CVND regularization in MDML instead of nonconvex VND regularization in PDMLOrthogonality-promoting distance metric learning · MIMICAUC (A-All): 0.667 -> 0.672Helped
Use convex CLDD regularization in MDML instead of nonconvex LDD regularization in PDMLOrthogonality-promoting distance metric learning · MIMICAUC (A-All): 0.664 -> 0.669Helped
Use convex CSFN regularization in MDML instead of nonconvex SFN regularization in PDMLOrthogonality-promoting distance metric learning · ReutersAUC (A-All): 0.973 -> 0.978Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy