arXiv research

Alternative dynamic paired comparison model using Gaussian Processes.

Rank aggregation based on pairwise comparisons over a set of items has a wide range of applications. Although considerable research has been devoted to the development of rank aggregation algorithms, one basic question is how to efficiently collect a large amount of high-quality pairwise comparisons for the ranking pur…

Study compares two knot pairings and their equivalence.

Estimates user preferences from noisy paired comparisons.

The question of aggregating pair-wise comparisons to obtain a global ranking over a collection of objects has been of interest for a very long time: be it ranking of online gamers (e.g. MSR's TrueSkill system) and chess players, aggregating social opinions, or deciding which product to sell based on transactions. In mo…

The paper extends the Manhattan curve concept to complex dynamics and studies its relation to multiplier spectra.

Binary feedback outperforms ordinal comparisons in ranking recovery.

In ranking problems, the goal is to learn a ranking function from labeled pairs of input points. In this paper, we consider the related comparison problem, where the label indicates which element of the pair is better, or if there is no significant difference. We cast the learning problem as a margin maximization, and …

Derives integral formula for Hodge and Teichmüller norms.

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}$. The problem of estimating $\mathbf{x}$ from this type of observation arises in a variety …

New method connects veering triangulations to dynamic pairs.

This paper investigates the effects of the "uptick rule" (a short selling regulation formally known as rule 10a-1) by means of a simple stock market model, based on the ARED (adaptive rational equilibrium dynamics) modeling framework, where heterogeneous and adaptive beliefs on the future prices of a risky asset were f…

CW-EDMD improves prediction accuracy by learning local Koopman models for different state-space regions.

Dynamic models improve CoVaR forecasts for financial system risks.

Active sampling algorithm improves accuracy of inferred scores from pairwise comparisons.

The present research work proposes a new fast fixed-point averaging algorithm on the compact Stiefel manifold based on a mixed retraction/lifting pair. Numerical comparisons between fixed-point algorithms based on the proposed non-associated retraction/lifting map pair and two associated retraction/lifting pairs confir…

This paper optimizes the number of comparisons needed to find the best k items from pairwise comparisons.

Method learns to map dynamics of different systems.

We analyze training dynamics in Gaussian mixture models using a comparison theorem.

Data in the form of pairwise comparisons arises in many domains, including preference elicitation, sporting competitions, and peer grading among others. We consider parametric ordinal models for such pairwise comparison data involving a latent vector $w^* \in \mathbb{R}^d$ that represents the "qualities" of the $d$ ite…

Active learning improves ordering of items with contextual attributes.

Given a matched pair of Lie groups, we show that the tangent bundle of the matched pair group is isomorphic to the matched pair of the tangent groups. We thus obtain the Euler-Lagrange equations on the trivialized matched pair of tangent groups, as well as the Euler-Poincaré equations on the matched pair of Lie algebra…

Rank regression from pairwise comparisons requires many comparisons to accurately learn model parameters.

Paper studies apparent horizon dynamics and introduces a null comparison principle.

In this paper we prove another pairing theorem for bordered Floer homology. Unlike the original pairing theorem, this one is stated in terms of homomorphisms, not tensor products. The present formulation is closer in spirit to the usual TQFT framework, and allows a more direct comparison with Fukaya-categorical constru…

AUASE embeds dynamic networks with stability guarantees for node comparison.

A parameter-free statistical model is used to study multiplicity signatures for coherent production of charged-pairs of parabosons of order p=2 in comparison with those arising in the case of ordinary bosons, p=1. Two non-negative real parameters arise because "ab" and "ba" are fundamentally distinct pair operators of …

In this paper, we study a popular method for inference of the Bradley-Terry model parameters, namely the MM algorithm, for maximum likelihood estimation and maximum a posteriori probability estimation. This class of models includes the Bradley-Terry model of paired comparisons, the Rao-Kupper model of paired comparison…

This paper learns user preferences from comparisons using Mahalanobis metrics.

The report studies ranking from pairwise comparisons in graphs, achieving optimal error bounds and proposing efficient algorithms.

ROVAE uses noisy pairwise comparisons to disentangle factors in VAEs.

Flexible model predicts sports outcomes over time.

We treat the vakonomic dynamics with general constraints within a new geometric framework which will be appropriate to study optimal control problems. We compare our formulation with Vershik-Gershkovich one in the case of linear constraints. We show how nonholonomic mechanics also admits a new geometrical description w…

Study shows variance gamma model outperforms Black-Scholes for USD-INR currency options.

The authors propose a parametric model called the arena model for prediction in paired competitions, i.e. paired comparisons with eliminations and bifurcations. The arena model has a number of appealing advantages. First, it predicts the results of competitions without rating many individuals. Second, it takes full adv…

Analysis of Vlasov plasma dynamics using matched pair Lie-Poisson formulation.

We explore the top-$K$ rank aggregation problem. Suppose a collection of items is compared in pairs repeatedly, and we aim to recover a consistent ordering that focuses on the top-$K$ ranked items based on partially revealed preference information. We investigate the Bradley-Terry-Luce model in which one ranks items ac…

A new method learns state and proposal dynamics in state-space models using neural networks.

Pairwise comparison data arises in many domains, including tournament rankings, web search, and preference elicitation. Given noisy comparisons of a fixed subset of pairs of items, we study the problem of estimating the underlying comparison probabilities under the assumption of strong stochastic transitivity (SST). We…

Algorithm learns item qualities from noisy comparisons, scaling with graph resistance.

A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes identification of the top-k items as the most prominent special case. The score of a given item is defi…

GBS uses machine learning to design products based on consumer preferences.

Motivated by generating personalized recommendations using ordinal (or preference) data, we study the question of learning a mixture of MultiNomial Logit (MNL) model, a parameterized class of distributions over permutations, from partial ordinal or preference data (e.g. pair-wise comparisons). Despite its long standing…

This paper is concerned with the problem of top-$K$ ranking from pairwise comparisons. Given a collection of $n$ items and a few pairwise comparisons across them, one wishes to identify the set of $K$ items that receive the highest ranks. To tackle this problem, we adopt the logistic parametric model --- the Bradley-Te…

This paper tackles bandit optimization with a new pairwise comparison oracle for unknown strongly concave functions.

Study optimal pairs trading with transaction costs using stochastic control.

Analyzes feature learning in neural networks using a self-consistent dynamical field theory.

Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. Rank-breaking is a common practice to reduce the computational complexity of learning the global ranking. The individual preferences are broken into pairwise comparisons and applied t…