Active embedding search via noisy paired comparisons

1 code implementation • 10 May 2019 • Gregory H. Canal, Andrew K. Massimino, Mark A. Davenport, Christopher J. Rozell

Suppose that we wish to estimate a user's preference vector $w$ from paired comparisons of the form "does user $w$ prefer item $p$ or item $q$?," where both the user and items are embedded in a low-dimensional Euclidean space with distances that reflect user and item similarities.

Recommendation Systems

As you like it: Localization via paired comparisons

1 code implementation • 19 Feb 2018 • Andrew K. Massimino, Mark A. Davenport

Suppose that we wish to estimate a vector $\mathbf{x}$ from a set of binary paired comparisons of the form "$\mathbf{x}$ is closer to $\mathbf{p}$ than to $\mathbf{q}$" for various choices of vectors $\mathbf{p}$ and $\mathbf{q}$.

Constrained adaptive sensing

1 code implementation • 19 Jun 2015 • Mark A. Davenport, Andrew K. Massimino, Deanna Needell, Tina Woolf

Suppose that we wish to estimate a vector $\mathbf{x} \in \mathbb{C}^n$ from a small number of noisy linear measurements of the form $\mathbf{y} = \mathbf{A x} + \mathbf{z}$, where $\mathbf{z}$ represents measurement noise.

Information Theory Information Theory