This paper addresses the problem of rank aggregation, which aims to find a consensus ranking among multiple ranking inputs. Traditional rank aggregation methods are deterministic, and can be categorized into explicit and implicit methods depending on whether rank information is explicitly or implicitly utilized. Surpri…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,181 papers · 148 categories
Trend · papers per month
44 results for “rank-aggregation”
The paper addresses privacy in rank aggregation using randomized responses.
problem Preserving privacy while aggregating pairwise rankings.
method Adaptive debiasing method for randomized response rankings.
result Established minimax rates for estimation errors and optimal privacy guarantees.
This paper compares rank aggregation methods for partial label ranking.
problem Handling partial label ranking with ties.
method Scoring-based and non-parametric probabilistic-based rank aggregation methods.
result Scoring-based variants consistently outperform the state-of-the-art method.
A method for learning rankings in non-stationary data streams.
problem Learning preferences in a population that changes over time.
method Generalized Borda algorithm for non-stationary ranking streams.
result Bounds on the minimum number of samples required to output the ground truth.
We introduce a new family of minmax rank aggregation problems under two distance measures, the Kendall τ and the Spearman footrule. As the problems are NP-hard, we proceed to describe a number of constant-approximation algorithms for solving them. We conclude with illustrative applications of the aggregation methods on…
We analyze incomplete ranking data, modeling coarsening and studying rank aggregation methods.
problem Statistical inference for incomplete ranking data, especially under rank-dependent coarsening.
method Modeling rank-dependent coarsening, studying Plackett-Luce distribution, and analyzing rank aggregation methods.
result The ability to recover a target ranking from incomplete observations, despite coarsening bias, is theoretically addressed.
Improved rank aggregation via spectral method reduces sample complexity.
problem Ranking items from pairwise comparisons with corrupted data.
method Spectral ranking algorithms based on unnormalized and normalized data matrices.
result Sharper -norm perturbation bound and error bound on maximum displacement for each item.
Proposes HTM for aggregating ranked data considering user accuracy.
problem Aggregating ranked data from heterogeneous users with varying accuracy levels.
method Heterogeneous Thurstone Model (HTM) with alternating gradient descent algorithm.
result Algorithm converges linearly and outperforms existing methods.
The paper tackles targeted attacks on rank aggregation methods, proving the fixed point of adversarial game.
problem The security issue of rank aggregation methods, especially the vulnerability to targeted attacks.
method Formulated as a game-theoretic framework, the attack behavior is a fixed point of the composition of the adversary and the victim.
result The victims will produce the target ranking list once the adversary has complete information.
We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are known. We impute missing ranks by the average value and generalise Spearman's ρto extreme ranks. Our main …
Learning the true ordering between objects by aggregating a set of expert opinion rank order lists is an important and ubiquitous problem in many applications ranging from social choice theory to natural language processing and search aggregation. We study the problem of unsupervised rank aggregation where no ground tr…
We extend the recently introduced theory of Lovasz-Bregman (LB) divergences (Iyer & Bilmes 2012) in several ways. We show that they represent a distortion between a "score" and an "ordering", thus providing a new view of rank aggregation and order based clustering with interesting connections to web ranking. We show ho…
We extend the recently introduced theory of Lovasz-Bregman (LB) divergences (Iyer & Bilmes, 2012) in several ways. We show that they represent a distortion between a 'score' and an 'ordering', thus providing a new view of rank aggregation and order based clustering with interesting connections to web ranking. We show h…
CoarsenRank improves robustness in rank aggregation despite model misspecification.
problem Rank aggregation under model misspecification in real-world scenarios.
method CoarsenRank designs a neighborhood of ideal preferences to handle agnostic noise-corrupted data.
result CoarsenRank achieves robustness against model misspecification within a defined neighborhood.
A novel MQCAL method selects high-value samples via weighted rank aggregation.
problem Lack of scalable and general integration criteria for MQCAL methods.
method Proposes a novel MQCAL method using weighted rank aggregation.
result Achieves superior results compared to state-of-the-art MQCALs.
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…
Improved ranking method for scarce data with feature info.
problem Ranking items with limited comparisons and feature data.
method Modified RankCentrality using diffusion methods for feature info.
result Meaningful rankings even with scarce comparisons.
In recent years rank aggregation has received significant attention from the machine learning community. The goal of such a problem is to combine the (partially revealed) preferences over objects of a large population into a single, relatively consistent ordering of those objects. However, in many cases, we might not w…
Paper uses HodgeRank and information maximization for efficient crowdsourced ranking.
problem Crowdsourced ranking quality improvement with limited budget.
method Information maximization applied to HodgeRank for active sampling.
result Boosts sampling efficiency compared to traditional methods.
A new method aggregates generative classifiers to resist adversarial attacks.
problem Adversarial attacks on deep neural networks.
method Rank-aggregating ensemble of generative classifiers trained on intermediate layer responses.
result The ensemble of generative classifiers shows robustness to adversarial attacks.
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…
Hierarchical Partial-Order Models for Ranking
problem Rank aggregation combining ordered lists
method Hierarchical partial-order models
result Bayesian inference for latent poset hierarchy
Proposes a new ranking method based on analogical reasoning.
problem Object ranking using feature vectors.
method Analogical reasoning applied to instance-based learning and rank aggregation.
result Competitive results across various domains.
Paper proposes a method to recover rankings from limited comparisons using low-rank matrix completion.
problem Rank aggregation from pairwise comparisons with limited and noisy data.
method Low-rank matrix completion, alternating minimization algorithm, maximum likelihood estimation.
result Improved algorithm performance over state-of-the-art methods.
Decentralized ranking consensus via gossip for robust and scalable systems.
problem Achieving reliable and resilient consensus on collective rankings in a decentralized setting.
method Random gossip communication for decentralized computation of global rankings.
result Robust and scalable consensus on collective rankings achieved through decentralized, local interactions.
AtC combines human judgments and model scores for better human-centered assessments.
problem Lack of verifiable ground truth in human-centered assessments.
method Two-stage framework: aggregate judgments, then calibrate model scores.
result AtC outperforms human-only or model-only assessments across datasets.
This paper explores the preference-based top- rank aggregation problem. Suppose that a collection of items is repeatedly compared in pairs, and one wishes to recover a consistent ordering that emphasizes the top- ranked items, based on partially revealed preferences. We focus on the Bradley-Terry-Luce (BTL) model…
We revisit the problem of inferring the overall ranking among entities in the framework of Bradley-Terry-Luce (BTL) model, based on available empirical data on pairwise preferences. By a simple transformation, we can cast the problem as that of solving a noisy linear system, for which a ready algorithm is available in …
We consider the classic problem of establishing a statistical ranking of a set of n items given a set of inconsistent and incomplete pairwise comparisons between such items. Instantiations of this problem occur in numerous applications in data analysis (e.g., ranking teams in sports data), computer vision, and machine …
Polynomial-time algorithms improve on isotonic matrix estimation with unknown permutations.
problem Estimating a bivariate isotonic matrix with unknown permutations from noisy observations.
method Design and analysis of polynomial-time algorithms.
result Minimax optimal, computationally efficient estimation achievable in certain settings.
Label ranking aims to learn a mapping from instances to rankings over a finite number of predefined labels. Random forest is a powerful and one of the most successful general-purpose machine learning algorithms of modern times. In this paper, we present a powerful random forest label ranking method which uses random de…
Faster rates achieved for estimating permutation-based matrices.
problem Estimating a bivariate isotonic matrix with unknown permutations.
method Polynomial-time algorithm for noisy observations of a subset of entries.
result Efficient estimation at rate .
The problem of searching for experts in a given academic field is hugely important in both industry and academia. We study exactly this issue with respect to a database of authors and their publications. The idea is to use Latent Semantic Indexing (LSI) and Latent Dirichlet Allocation (LDA) to perform topic modelling i…
New algorithm learns permutations mixtures with optimal sample complexity.
problem Learning mixtures of permutations in high-dimensional settings.
method Combining groups of pairwise comparisons and combinatorial method of moments.
result Optimal sample complexity proportional to log(n) for high-dimensional data.
Paper establishes statistical inference for pairwise comparison models.
problem Statistical inference for pairwise comparison models when the number of subjects diverges.
method Identifies Fisher information matrix as a weighted graph Laplacian for asymptotic normality.
result Near-optimal asymptotic normality result for maximum likelihood estimator.
Given a set of objects, an online ranking system outputs at each time step a full ranking of the set, observes a feedback of some form and suffers a loss. We study the setting in which the (adversarial) feedback is an element in , and the loss is the position (0th, 1st, 2nd...) of the item in the outputted r…
The paper proposes methods to identify and sample from mixtures of Mallows models for top-k rankings.
problem Identifying and sampling from mixtures of Mallows models for top-k rankings in a heterogeneous population.
method Efficient sampling algorithms and identifiability proofs for both components of the mixture.
result The identifiability and learnability of the Mallows components' parameters in the mixture.
New algorithm identifies top-k items with minimal comparisons.
problem Active learning of top-k rankings from noisy comparisons.
method Designs an instance-optimal algorithm without item score info.
result Achieves nearly instance optimal performance with matching lower bound.
We explore the top- 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- ranked items based on partially revealed preference information. We investigate the Bradley-Terry-Luce model in which one ranks items ac…
Paper develops methods for non-quadratic loss low-rank matrix recovery.
problem Recovery of low-rank matrices with non-quadratic losses.
method Projected gradient method with a regularity projection oracle.
result Projected gradient method converges globally and linearly.
Paper proposes a new method to predict partial rankings from crowdsourced data.
problem Ambiguity in pairwise comparisons leads to incomplete rankings, requiring a better method.
method Margin-based Maximum Likelihood Estimate (MLE) framework for probabilistic partial order learning.
result The proposed MLE method improves accuracy over traditional algorithms.
New methods optimize experiment selection for sequential data, improving model accuracy.
problem Optimizing experiment selection for sequential data in multidimensional cases.
method Adopting greedy experiment selection methods for maximum likelihood estimation.
result Proposed methods produce consistent and asymptotically normal estimators.
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…
This paper tackles ranking preferences through local consensus, improving prediction accuracy.
problem Predicting individual preferences over a set of items based on observed characteristics.
method Proposes ranking median regression, introducing local consensus/median for efficient learning.
result Developed efficient methods for ranking median regression, achieving fast learning rates.