LORE: Jointly Learning the Intrinsic Dimensionality and Relative Similarity Structure From Ordinal Data
Vivek Anand, Alec Helbling, Mark A. Davenport, Gordon J. Berman, Sankaraleengam Alagapan, Christopher John Rozell

TL;DR
LORE is a scalable framework that jointly learns the intrinsic dimensionality and ordinal embedding of subjective perceptual spaces from noisy triplet comparisons, improving interpretability and data efficiency.
Contribution
LORE introduces a novel joint learning approach using Schatten-$p$ quasi norm regularization to automatically recover both the embedding and its dimensionality.
Findings
Learns compact, interpretable low-dimensional embeddings
Achieves high accuracy in recovering latent perceptual geometry
Demonstrates effectiveness on synthetic and real-world data
Abstract
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- 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…
Peer Reviews
Decision·ICLR 2026 Poster
1. The explanation of the background and significance of the problem is very clear, and the problem to be solved is very meaningful. 2. LORE is effective in reliably overlooking the intrinsic dimensionality and demonstrates the interpretability of low dimensional representations in semantics, which is helpful for solving problems in psychology, neuroscience, and social science. 3. The theoretical explanation is very rigorous.
1. More new methods should be compared, and more datasets should be compared, especially considering that SOE and t-STE are both methods from 2014. This may lead to doubts about the performance of LORE. 2. On the accuracy metric, which may be the most important metric, LOPE is not always optimal or even suboptimal. 3. A low rank does not necessarily mean an improvement in method performance, so more explanation is need. 4. For the metric of computational efficiency(time), low dimensional embeddi
1 Tackles a long-standing limitation of ordinal embedding, i.e., choosing the dimensionality, by jointly inferring rank and coordinates, rather than grid-searching over dimensions. 2 Uses Schatten-p regularization (p∈(0,1)) to promote low rank, with a softplus-smoothed triplet loss and an iteratively reweighted algorithm; provides a convergence-to-stationary-point guarantee and implementation details. 3 Experiments indicate that LORE achieves comparable triplet accuracy while discovering sub
1 The theory ensures convergence to a stationary point, but not global minima or exact rank identification; this is acknowledged as a limitation. 2 The paper argues that LORE uncovers the intrinsic dimensionality without under- or over-estimating it. As stated, this reads as a subjective claim. Please provide stronger evidence to demonstrate that the method does not “mask” latent structure or inflate rank. 3 This paper claims that Künstle et al. (2022) require specifying plausible dimensionali
1. The paper addresses the critical and underexplored problem of jointly discovering the intrinsic dimensionality and relative structure in perceptual spaces, which is a key limitation of prior Ordinal Embedding (OE) methods. The introduction of the low-rank constraint via the non-convex Schatten quasi-norm is highly novel within the OE literature. 2. Unlike many empirical approaches, LORE provides a convergence theorem (Theorem 1, page 5) for its optimization objective and the proposed iterati
1. While the paper provides a convergence theorem, the optimization objective $\min \Psi(Z)$ remains highly non-convex. The analysis primarily focuses on convergence to a stationary point, which may not always be the globally optimal solution. A more in-depth discussion on the practical robustness to initialization and the likelihood of escaping poor local minima would be beneficial. 2. The LORE objective function includes several regularization parameters ($\lambda, \tau, \mu$). Although Figur
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAesthetic Perception and Analysis · Visual Attention and Saliency Detection · Olfactory and Sensory Function Studies
