LORE: Jointly Learning the Intrinsic Dimensionality and Relative Similarity Structure From Ordinal Data
Not on the map. Why?
Abstract (arXiv)
Learning the intrinsic dimensionality of subjective perceptual spaces such as taste, smell, or aesthetics from ordinal data is a challenging problem. We introduce LORE (Low Rank Ordinal Embedding), a scalable framework that jointly learns both the intrinsic dimensionality and an ordinal embedding from noisy triplet comparisons of the form, "Is A more similar to B than C?". Unlike existing methods that require the embedding dimension to be set apriori, LORE regularizes the solution using the nonconvex Schatten-p quasi norm, enabling automatic joint recovery of both the ordinal embedding and its dimensionality. We optimize this joint objective via an iteratively reweighted algorithm and establish convergence guarantees. Extensive experiments on synthetic datasets, simulated perceptual spaces, and real world crowdsourced ordinal judgements show that LORE learns compact, interpretable and highly accurate low dimensional embeddings that recover the latent geometry of subjective percepts. By simultaneously inferring both the intrinsic dimensionality and ordinal embeddings, LORE enables more interpretable and data efficient perceptual modeling in psychophysics and opens new directions for scalable discovery of low dimensional structure from ordinal data in machine learning.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 37 references that are in the map. First posted on arXiv 4 Feb 2026.
Builds on
10 of 37 references.
References · 10
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2023Large language models predict human sensory judgments across six modalitiescited by 47
- 2019A Similarity Measure for Material Appearancecited by 19
- 2014Generalized Nonconvex Nonsmooth Low-Rank Minimizationcited by 14
- 2014Cost-Effective HITs for Relative Similarity Comparisonscited by 13
- 2016Finite Sample Prediction and Recovery Bounds for Ordinal Embeddingcited by 12
- 2019Insights into Ordinal Embedding Algorithms: A Systematic Evaluationcited by 10
- 2019Active Ordinal Querying for Tuplewise Similarity Learningcited by 7
- 2016Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysiscited by 5
Built on by
Not cited yet.