English
Related papers

Related papers: Sorting and Selection with Imprecise Comparisons

200 papers

We consider the problem of designing an adaptive sequence of questions that optimally classify a candidate's ability into one of several categories or discriminative grades. A candidate's ability is modeled as an unknown parameter, which,…

Machine Learning · Computer Science 2020-04-14 Achal Bassamboo , Vikas Deep , Sandeep Juneja , Assaf Zeevi

Decision-making methods very often use the technique of comparing alternatives in pairs. In this approach, experts are asked to compare different options, and then a quantitative ranking is created from the results obtained. It is commonly…

Artificial Intelligence · Computer Science 2025-04-21 M. Strada , K. Kułakowski

Prior research in psychology has found that people's decisions are often inconsistent. An individual's decisions vary across time, and decisions vary even more across people. Inconsistencies have been identified not only in subjective…

Human-Computer Interaction · Computer Science 2024-07-17 Nina Grgić-Hlača , Junaid Ali , Krishna P. Gummadi , Jennifer Wortman Vaughan

The two-sample problem, which consists in testing whether independent samples on $\mathbb{R}^d$ are drawn from the same (unknown) distribution, finds applications in many areas. Its study in high-dimension is the subject of much attention,…

Statistics Theory · Mathematics 2023-02-09 Stephan Clémençon , Myrto Limnios , Nicolas Vayatis

Rankings are central to decision-making in fields ranging from education to online platforms, yet classical deterministic methods such as the Borda count method or Copeland-type pairwise methods ignore uncertainty due to sampling noise or…

Methodology · Statistics 2026-05-20 Shunpu Zhang

This paper provides a theoretical analysis of a new learning problem for recommender systems where users provide feedback by comparing pairs of items instead of rating them individually. We assume that comparisons stem from latent user and…

Machine Learning · Computer Science 2025-08-20 Suryanarayana Sankagiri , Jalal Etesami , Matthias Grossglauser

In the online (time-series) search problem, a player is presented with a sequence of prices which are revealed in an online manner. In the standard definition of the problem, for each revealed price, the player must decide irrevocably…

Data Structures and Algorithms · Computer Science 2021-12-06 Spyros Angelopoulos , Shahin Kamali , Dehou Zhang

Matching for causal inference is a well-studied problem, but standard methods fail when the units to match are text documents: the high-dimensional and rich nature of the data renders exact matching infeasible, causes propensity scores to…

Methodology · Statistics 2019-03-15 Reagan Mozer , Luke Miratrix , Aaron Russell Kaufman , L. Jason Anastasopoulos

Propensity Score Matching (PSM) stands as a widely embraced method in comparative effectiveness research. PSM crafts matched datasets, mimicking some attributes of randomized designs, from observational data. In a valid PSM design where all…

Methodology · Statistics 2024-11-15 Fei Wan

The ``impossibility theorem'' -- which is considered foundational in algorithmic fairness literature -- asserts that there must be trade-offs between common notions of fairness and performance when fitting statistical models, except in two…

Machine Learning · Computer Science 2023-02-14 Andrew Bell , Lucius Bynum , Nazarii Drushchak , Tetiana Herasymova , Lucas Rosenblatt , Julia Stoyanovich

Consider the problem of finding a population or a probability distribution amongst many with the largest mean when these means are unknown but population samples can be simulated or otherwise generated. Typically, by selecting largest…

Probability · Mathematics 2018-09-11 Peter Glynn , Sandeep Juneja

Owing to the advancement of deep learning, artificial systems are now rival to humans in several pattern recognition tasks, such as visual recognition of object categories. However, this is only the case with the tasks for which correct…

Machine Learning · Computer Science 2019-06-03 Xing Liu , Takayuki Okatani

We consider the problem of ranking objects from noisy pairwise comparisons, for example, ranking tennis players from the outcomes of matches. We follow a standard approach to this problem and assume that each object has an unobserved…

Social and Information Networks · Computer Science 2025-12-18 Daniel Sánchez Catalina , George T. Cantwell

We propose and axiomatize a new model of incomplete preferences under uncertainty, which we call \textit{hope-and-prepare preferences}. An act is considered more desirable than an other act when, and only when, both an optimistic…

Theoretical Economics · Economics 2025-07-29 Pierre Bardier , Bach Dong-Xuan , Van-Quy Nguyen

Eliciting preferences from human judgements is inherently imprecise, yet most decision analysis methods force a single priority vector from pairwise comparisons, discarding the information embedded in inconsistencies. We instead leverage…

General Economics · Economics 2026-02-27 Salvatore Greco , Sajid Siraj , Michele Lundy

We consider $(\epsilon,\delta)$-PAC maximum-selection and ranking for general probabilistic models whose comparisons probabilities satisfy strong stochastic transitivity and stochastic triangle inequality. Modifying the popular knockout…

Machine Learning · Computer Science 2017-05-16 Moein Falahatgar , Alon Orlitsky , Venkatadheeraj Pichapati , Ananda Theertha Suresh

Data quality is an important consideration in many engineering applications and projects. Data collection procedures do not always involve careful utilization of the most precise instruments and strictest protocols. As a consequence, data…

Methodology · Statistics 2023-03-02 Krasymyr Tretiak , Scott Ferson

We report an inconsistency found in probability theory (also referred to as measure-theoretic probability). For probability measures induced by real-valued random variables, we deduce an "equality" such that one side of the "equality" is a…

General Mathematics · Mathematics 2017-03-01 Guang-Liang Li , Victor O. K. Li

We consider the problem of probably approximately correct (PAC) ranking $n$ items by adaptively eliciting subset-wise preference feedback. At each round, the learner chooses a subset of $k$ items and observes stochastic feedback indicating…

Machine Learning · Computer Science 2019-03-06 Aadirupa Saha , Aditya Gopalan

We consider the problem of constructing optimal designs for model discrimination between competing regression models. Various new properties of optimal designs with respect to the popular $T$-optimality criterion are derived, which in many…

Statistics Theory · Mathematics 2009-08-14 Holger Dette , Stefanie Titoff
‹ Prev 1 4 5 6 7 8 10 Next ›