Alex Olshevsky

Graph Resistance and Learning from Pairwise Comparisons

2019 · arXiv (Cornell University)

We consider the problem of learning the qualities of a collection of items by performing noisy comparisons among them. Following the standard paradigm, we assume there is a fixed "comparison graph" and every neighboring pair …