Daniyar Chumbalov

2 accepted papers

2024

Fast Interactive Search under a Scale-Free Comparison Oracle

Daniyar Chumbalov, Lars Klein, Lucas Maystre, Matthias Grossglauser

UAI 2024poster

A comparison-based search algorithm lets a user find a target item $t$ in a database by answering queries of the form, “Which of items $i$ and $j$ is closer to $t$?” Instead of formulating an explicit query (such as one or several keywords), the user navigates towards the target via a sequence of su…

Cited by 0 Source ↗PDF ↗Scholar ↗

2020

Scalable and Efficient Comparison-based Search without Features

Daniyar Chumbalov, Lucas Maystre, Matthias Grossglauser

ICML 2020poster

We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i,j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generates noisy answers. First, we consider the non-b…

Cited by 7 Source ↗PDF ↗Scholar ↗