# Finite Sample Prediction and Recovery Bounds for Ordinal Embedding

Lalit JainKevin JamiesonRobert Nowak

The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like "item $i$ is closer to item $j$ than item $k$". Ordinal constraints like this often come from human judgments... (read more)

PDF Abstract

No code implementations yet. Submit your code now