Low-dimensional Data Embedding Via Robust Ranking

Abstract

We describe a new method called t-ETE for finding a low-dimensional embedding of a set of objects in Euclidean space. We formulate the embedding problem as a joint ranking problem over a set of triplets, where each triplet captures the relative similarities between three objects in the set. By exploiting recent advances in robust ranking, t-ETE produces high-quality embeddings even in the presence of a significant amount of noise and better preserves local scale than known methods, such as t-STE and t-SNE. In particular, our method produces significantly better results than t-SNE on signature datasets while also being faster to compute.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyamid2016low

Related papers

• Deep Randomized Ensembles For Metric Learning (2018)13.97
• Dimension-accuracy Tradeoffs In Contrastive Embeddings For Triplets, Terminals & Top-k Nearest Neighbors (2023)0.00
• From Topology To Retrieval: Decoding Embedding Spaces With Unified Signatures (2025)0.00
• Improved Embeddings With Easy Positive Triplet Mining (2019)15.06
• Fast Spectral Ranking For Similarity Search (2017)11.58
• Deep Metric Learning Using Similarities From Nonlinear Rank Approximations (2019)2.26
• Fast Training Of Triplet-based Deep Binary Embedding Networks (2016)14.62
• A New Similarity Space Tailored For Supervised Deep Metric Learning (2020)3.58