On the rankability of visual embeddings

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Sonthalia, Ankit, Uselis, Arnas, Oh, Seong Joon
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916826271711232
author Sonthalia, Ankit
Uselis, Arnas
Oh, Seong Joon
author_facet Sonthalia, Ankit
Uselis, Arnas
Oh, Seong Joon
contents We study whether visual embedding models capture continuous, ordinal attributes along linear directions, which we term _rank axes_. We define a model as _rankable_ for an attribute if projecting embeddings onto such an axis preserves the attribute's order. Across 7 popular encoders and 9 datasets with attributes like age, crowd count, head pose, aesthetics, and recency, we find that many embeddings are inherently rankable. Surprisingly, a small number of samples, or even just two extreme examples, often suffice to recover meaningful rank axes, without full-scale supervision. These findings open up new use cases for image ranking in vector databases and motivate further study into the structure and learning of rankable embeddings. Our code is available at https://github.com/aktsonthalia/rankable-vision-embeddings.
format Preprint
id arxiv_https___arxiv_org_abs_2507_03683
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On the rankability of visual embeddings
Sonthalia, Ankit
Uselis, Arnas
Oh, Seong Joon
Computer Vision and Pattern Recognition
We study whether visual embedding models capture continuous, ordinal attributes along linear directions, which we term _rank axes_. We define a model as _rankable_ for an attribute if projecting embeddings onto such an axis preserves the attribute's order. Across 7 popular encoders and 9 datasets with attributes like age, crowd count, head pose, aesthetics, and recency, we find that many embeddings are inherently rankable. Surprisingly, a small number of samples, or even just two extreme examples, often suffice to recover meaningful rank axes, without full-scale supervision. These findings open up new use cases for image ranking in vector databases and motivate further study into the structure and learning of rankable embeddings. Our code is available at https://github.com/aktsonthalia/rankable-vision-embeddings.
title On the rankability of visual embeddings
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2507.03683