Landmark Ordinal Embedding

10/27/2019
by   Nikhil Ghosh, et al.
19

In this paper, we aim to learn a low-dimensional Euclidean representation from a set of constraints of the form "item j is closer to item i than item k". Existing approaches for this "ordinal embedding" problem require expensive optimization procedures, which cannot scale to handle increasingly larger datasets. To address this issue, we propose a landmark-based strategy, which we call Landmark Ordinal Embedding (LOE). Our approach trades off statistical efficiency for computational efficiency by exploiting the low-dimensionality of the latent embedding. We derive bounds establishing the statistical consistency of LOE under the popular Bradley-Terry-Luce noise model. Through a rigorous analysis of the computational complexity, we show that LOE is significantly more efficient than conventional ordinal embedding approaches as the number of items grows. We validate these characterizations empirically on both synthetic and real datasets. We also present a practical approach that achieves the "best of both worlds", by using LOE to warm-start existing methods that are more statistically efficient but computationally expensive.

READ FULL TEXT
research
06/22/2016

Finite Sample Prediction and Recovery Bounds for Ordinal Embedding

The goal of ordinal embedding is to represent items as points in a low-d...
research
05/21/2021

Elliptical Ordinal Embedding

Ordinal embedding aims at finding a low dimensional representation of ob...
research
12/05/2018

Less but Better: Generalization Enhancement of Ordinal Embedding via Distributional Margin

In the absence of prior knowledge, ordinal embedding methods obtain new ...
research
05/19/2018

Revealing the Basis: Ordinal Embedding Through Geometry

Ordinal Embedding places n objects into R^d based on comparisons such as...
research
12/03/2019

Large scale representation learning from triplet comparisons

In this paper, we discuss the fundamental problem of representation lear...
research
08/21/2019

Estimation of perceptual scales using ordinal embedding

In this paper, we address the problem of measuring and analysing sensati...
research
04/03/2015

Point Localization and Density Estimation from Ordinal kNN graphs using Synchronization

We consider the problem of embedding unweighted, directed k-nearest neig...

Please sign up or login with your details

Forgot password? Click here to reset