Algorithms for metric learning via contrastive embeddings

DOI10.4230/LIPICS.SOCG.2019.45MaRDI QIDQ5088977FDOQ5088977

Authors: Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos 

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1807.04881

Recommendations

• Metric Learning
• Metric learning: a survey
• Recent advances on supervised distance metric learning algorithms
• Distance metric learning by knowledge embedding
• Efficiently learning the metric with side-information

zbMATH Keywords

algorithmsembeddingsmetric learningcontrastive distortion

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Distance metric learning for large margin nearest neighbor classification
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Correlation clustering
• Unit disk graph recognition is NP-hard
• The geometry of graphs and some of its algorithmic applications
• Title not available (Why is that?)
• Expander flows, geometric embeddings and graph partitioning
• Quick approximation to matrices and applications
• Geometric approximation algorithms
• Regularity Lemmas and Combinatorial Algorithms
• Euclidean distortion and the sparsest cut
• Excluded minors, network decomposition, and multicommodity flow
• Approximation algorithms for embedding general metrics into trees
• Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
• Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
• Metric learning: a survey
• Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
• Title not available (Why is that?)
• Monotone maps, sphericity and bounded second eigenvalue
• Inapproximability for metric embeddings into $\mathbb{R}^{d}$
• Metric clustering via consistent labeling
• A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs

Cited In (6)

• Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
• Deep metric learning using triplet network
• Title not available (Why is that?)
• LogDet Divergence-Based Metric Learning With Triplet Constraints and Its Applications
• Metric Learning
• Metric Learning via Cross-Validation

This page was built for publication: Algorithms for metric learning via contrastive embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088977)