English
Related papers

Related papers: Social Choice Random Utility Models of Intransitiv…

200 papers

Random Utility Models (RUMs) are a classical framework for modeling user preferences and play a key role in reward modeling for Reinforcement Learning from Human Feedback (RLHF). However, a crucial shortcoming of many of these techniques is…

Machine Learning · Computer Science 2026-05-28 Yeshwanth Cherapanamjeri , Constantinos Daskalakis , Gabriele Farina , Sobhan Mohammadpour

Learning shared representations is a primary area of multimodal representation learning. The current approaches to achieve a shared embedding space rely heavily on paired samples from each modality, which are significantly harder to obtain…

Computer Vision and Pattern Recognition · Computer Science 2025-10-14 Amitai Yacobi , Nir Ben-Ari , Ronen Talmon , Uri Shaham

Maximum likelihood estimation furnishes powerful insights into voting theory, and the design of voting rules. However the MLE can usually be badly corrupted by a single outlying sample. This means that a single voter or a group of colluding…

Data Structures and Algorithms · Computer Science 2022-07-19 Allen Liu , Ankur Moitra

We consider a simple model of imprecise comparisons: there exists some $\delta>0$ such that when a subject is given two elements to compare, if the values of those elements (as perceived by the subject) differ by at least $\delta$, then the…

Data Structures and Algorithms · Computer Science 2015-01-14 Miklos Ajtai , Vitaly Feldman , Avinatan Hassidim , Jelani Nelson

In several decision-making problems, alternatives should be ranked on the basis of paired comparisons between them. We present an axiomatic approach for the universal ranking problem with arbitrary preference intensities, incomplete and…

Computer Science and Game Theory · Computer Science 2019-04-10 László Csató

We propose an empirical likelihood ratio test for nonparametric model selection, where the competing models may be nested, nonnested, overlapping, misspecified, or correctly specified. It compares the squared prediction errors of models…

Methodology · Statistics 2022-01-21 Jiancheng Jiang , Jiang Xuejun , Wang Haofeng

Large language models are often ranked according to their level of alignment with human preferences -- a model is better than other models if its outputs are more frequently preferred by humans. One of the popular ways to elicit human…

Machine Learning · Computer Science 2024-12-05 Ivi Chatzi , Eleni Straitouri , Suhas Thejaswi , Manuel Gomez Rodriguez

Large Language Models (LLMs) have achieved remarkable success across diverse natural language tasks, yet the reward models employed for aligning LLMs often encounter challenges of reward hacking, where the approaches predominantly rely on…

Computation and Language · Computer Science 2026-03-06 Biao Liu , Ning Xu , Junming Yang , Hao Xu , Xin Geng

We study the Popular Matching problem in multiple models, where the preferences of the agents in the instance may change or may be unknown/uncertain. In particular, we study an Uncertainty model, where each agent has a possible set of…

Computer Science and Game Theory · Computer Science 2025-06-06 Gergely Csáji

Variable selection is a procedure to attain the truly important predictors from inputs. Complex nonlinear dependencies and strong coupling pose great challenges for variable selection in high-dimensional data. In addition, real-world…

Methodology · Statistics 2023-07-04 Keyao Wang , Huiwen Wang , Jichang Zhao , Lihong Wang

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

In this paper, we discuss the possible generalizations of the Social Influence with Recurrent Mobility (SIRM) model developed in Phys. Rev. Lett. 112, 158701 (2014). Although the SIRM model worked approximately satisfying when US election…

Physics and Society · Physics 2018-06-27 Jérôme Michaud , Attila Szilva

Recommender systems have become an essential component of many online platforms, providing personalized recommendations to users. A crucial aspect is embedding techniques that convert the high-dimensional discrete features, such as user and…

Information Retrieval · Computer Science 2025-10-23 Maolin Wang , Xinjian Zhao , Wanyu Wang , Sheng Zhang , Jiansheng Li , Bowen Yu , Binhao Wang , Shucheng Zhou , Dawei Yin , Qing Li , Ruocheng Guo , Xiangyu Zhao

We study a mathematical model of voting contest with $m$ voters and $n$ candidates, with each voter ranking the candidates in order of preference, without ties. A Condorcet winner is a candidate who gets more than $m/2$ votes in pairwise…

Combinatorics · Mathematics 2025-11-05 Boris Pittel

Dynamic discrete choice models are widely employed to answer substantive and policy questions in settings where individuals' current choices have future implications. However, estimation of these models is often computationally intensive…

Methodology · Statistics 2025-04-11 Ebrahim Barzegary , Hema Yoganarasimhan

For a broad class of models widely used in practice for choice and ranking data based on Luce's choice axiom, including the Bradley--Terry--Luce and Plackett--Luce models, we show that the associated maximum likelihood estimation problems…

Optimization and Control · Mathematics 2025-04-08 Zhaonan Qu , Alfred Galichon , Wenzhi Gao , Johan Ugander

A numerically efficient inverse method for parametric model uncertainty identification using maximum likelihood estimation is presented. The goal is to identify a probability model for a fixed number of model parameters based on a set of…

Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…

Computer Science and Game Theory · Computer Science 2025-12-02 Moses Charikar , Prasanna Ramakrishnan , Kangning Wang

We consider voting on multiple independent binary issues. In addition, a weighting vector for each voter defines how important they consider each issue. The most natural way to aggregate the votes into a single unified proposal is…

Computer Science and Game Theory · Computer Science 2025-02-21 Carmel Baharav , Andrei Constantinescu , Roger Wattenhofer

We propose a topic modeling approach to the prediction of preferences in pairwise comparisons. We develop a new generative model for pairwise comparisons that accounts for multiple shared latent rankings that are prevalent in a population…

Machine Learning · Computer Science 2015-01-27 Weicong Ding , Prakash Ishwar , Venkatesh Saligrama