Framework learns sentence order from paragraphs using attention and transformer networks.
problem Learning to order sentences from a paragraph.
method Bidirectional sentence encoder and self-attention transformer network for ranking.
result Framework outperforms state-of-the-art methods on sentence ordering and discrimination tasks.
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…
New statistical models for predicting ranked preferences from partial orders.
problem Statistical models overlook information in list length.
method Composite and augmented ranking models for joint modeling of partial orders and list lengths.
result Augmented ranking models best predict both length and preferences.
Solves the Wiegold problem by showing free products of left-orderable groups have normal rank > 1.
problem Wiegold problem about groups of normal rank > 1
method Topological argument and intricate construction of left-orders
result Free products of nontrivial left-orderable groups have normal rank > 1
Hierarchical Partial-Order Models for Ranking
problem Rank aggregation combining ordered lists
method Hierarchical partial-order models
result Bayesian inference for latent poset hierarchy
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…
Improves CRRR for better mobility analysis with DCTM.
problem Unclear interpretation of RRRX parameters.
method Uses DCTM for conditional ranks, cross-fitting, and asymptotic theory.
result Clearer interpretation and improved accuracy in mobility analysis.
In this present paper, we study geometric structures of rank two prolongations of implicit second-order partial differential equations (PDEs) for two independent and one dependent variables and characterize the type of these PDEs by the topology of fibers of the rank two prolongations. Moreover, by using properties of …
Rank regression from pairwise comparisons requires many comparisons to accurately learn model parameters.
problem Learning model parameters for rank regression from noisy pairwise comparisons.
method Uniform random pairwise comparisons to estimate model parameters with a given accuracy.
result Learning model parameters requires a number of comparisons proportional to dNlog3N/ε2. Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to n⌊p/2⌋ for a p-th order tensor in Rnp. Previously no efficient algorithm can decompose 3rd order ten…
In this paper, we introduce the notion of motif closure and describe higher-order ranking and link prediction methods based on the notion of closing higher-order network motifs. The methods are fast and efficient for real-time ranking and link prediction-based applications such as web search, online advertising, and re…
The paper uses belief propagation to analyze rankings and partial orders from partial information.
problem Analyzing rankings and partial orders from incomplete data.
method Continuous spin system and belief propagation algorithm.
result Computes marginal distribution and approximates number of linear extensions.
Given an incomplete ratings data over a set of users and items, the preference completion problem aims to estimate a personalized total preference order over a subset of the items. In practical settings, a ranked list of top-k items from the estimated preference order is recommended to the end user in the decreasing …
Framework benchmarks optimizers on multiple criteria.
problem Benchmarking optimizers across diverse test functions.
method Union-free generic depth function for partial orders/rankings.
result Identifies central and outlying rankings of optimizers.
CAIRO separates ranking from scaling to improve robustness.
problem Conflating ranking and scaling in regression leads to model vulnerability.
method Two-stage approach: first learns a scoring function, then recovers scale.
result CAIRO recovers true regression function with auto-calibration guarantees.
This method infers models from data with physical insights, minimizing model order.
problem Learning models from data while preserving physical insights.
method Structure preservation and rank minimization via Sylvester equations.
result Models of low order are obtained with fewer degrees of freedom.
Paper tackles non-identifiability of mixture models in partial order datasets.
problem Non-identifiability of mixture models in datasets with partial orders.
method Proved non-identifiability conditions and proposed GMM algorithms.
result GMM algorithms for learning mixtures of two Plackett-Luce models are consistent.
New approach to handle ranking function variation in zero-shot NAS.
problem Variation in ranking function outputs due to randomness.
method Viewing ranking function output as a random variable and constructing a stochastic ordering.
result Stochastic ordering boosts performance in neural architecture search.
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.
Study ranking in generalized linear bandits with position and item dependencies.
problem Complex reward function due to position and item dependencies in recommendation systems.
method Model position and item dependencies, design UCB and Thompson Sampling algorithms.
result Generalizes existing studies in position dependencies and graph theory.
Extends RRR to capture nonlinear interactions in multi-response regression.
problem Complex relationships in real-world data cannot be adequately modeled by linear interactions.
method Introduces Higher Order Reduced Rank Regression (HORRR) using tensor representations and Tucker decomposition.
result HORRR can capture nonlinear interactions in multi-response regression.
Develops methods to estimate high rank tensors from noisy data.
problem Estimating high rank tensors from noisy observations.
method Generative latent variable tensor model, polynomial-time spectral algorithm.
result Achieves computationally optimal rate for signal tensor estimation.
A first-order model for a stock market assigns to each stock a return parameter and a variance parameter that depend only on the rank of the stock. A second-order model assigns these parameters based on both the rank and the name of the stock. First- and second-order models exhibit stability properties that make them a…
Proposes a method to enhance multi-view learning by maximizing higher order correlations.
problem Losing intrinsic interconnections among multiple views in pairwise correlation maximization.
method Formulates multi-view data as a low rank approximation problem using higher order correlation tensor and solves it with the generating polynomial method.
result Consistently outperforms prior methods on real multi-view data.
A preference order or ranking aggregated from pairwise comparison data is commonly understood as a strict total order. However, in real-world scenarios, some items are intrinsically ambiguous in comparisons, which may very well be an inherent uncertainty of the data. In this case, the conventional total order ranking c…
Extends Mallows model to handle item indifference in rankings.
problem Real data often contains item indifference, challenging strict preference assumptions.
method Proposes Clustered Mallows Model (CMM) to accommodate item indifference.
result CMM provides a flexible representation of rank collections with ordered clusters.
We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of observed affinity values. Our approach exploits the observation that while preferences …
Whereas most dimensionality reduction techniques (e.g. PCA, ICA, NMF) for multivariate data essentially rely on linear algebra to a certain extent, summarizing ranking data, viewed as realizations of a random permutation Σ on a set of items indexed by i∈{1,…,n}, is a great statistical challenge, due to…
It is the main goal of this article to address the bipartite ranking issue from the perspective of functional data analysis (FDA). Given a training set of independent realizations of a (possibly sampled) second-order random function with a (locally) smooth autocorrelation structure and to which a binary label is random…
This paper evaluates various loss functions for Transformer models in stock ranking.
problem Evaluating loss functions for Transformer models in stock ranking.
method Systematic evaluation of advanced loss functions (pointwise, pairwise, listwise) on S&P 500 data.
result Different loss functions impact a model's ability to discern profitable relative orderings among assets.
Selecting the right drugs for the right patients is a primary goal of precision medicine. In this manuscript, we consider the problem of cancer drug selection in a learning-to-rank framework. We have formulated the cancer drug selection problem as to accurately predicting 1). the ranking positions of sensitive drugs an…
Max-rank improves multiple testing in conformal prediction.
problem Simultaneous testing of multiple hypotheses in scientific inquiries.
method Introduces max-rank, a novel correction for positive dependencies in simultaneous testing.
result Max-rank efficiently controls family-wise error rate and improves predictive uncertainty estimates.
TGCCA analyzes higher-order tensors using orthogonal rank-R CP decomposition.
problem Handling higher-order structures in multi-block data analysis.
method Tensor Generalized Canonical Correlation Analysis (TGCCA) with orthogonal rank-R CP decomposition.
result TGCCA outperforms state-of-the-art methods on simulated and real data.
Extends MSC for triclustering tensors, using DBSCAN to find clusters.
problem Finding clusters in multi-slice triclustering of tensors with unknown cluster sizes.
method Extends Multi-Slice Clustering (MSC) with DBSCAN to find clusters in tensors.
result Can find clusters in tensors that are sums of multiple rank-one tensors.
Study tackles ranking fraud in online platforms by learning robust rankings.
problem Fraudulent fake users manipulate product rankings.
method Developed algorithms for robust ranking in two informational environments.
result Our algorithms converge to optimal rankings, robust to fake users.
Sample-Rank simplifies MO recommendations by sampling and ranking, improving revenue with stable conversion rates.
problem Multi-objective recommendations in online food ordering systems.
method Multi-goal sampling followed by ranking, reducing MO problem to LTR model.
result Significant lift in revenue (2.64%) with stable conversion rates, no drop in last-mile traversal.
FUJI scores similarity of ranked lists more robustly.
problem Improving similarity assessment of ranked lists.
method Integrates a membership function into Jaccard index for better rank consideration.
result More stable and accurate similarity estimates.
The problem of frequent pattern mining has been studied quite extensively for various types of data, including sets, sequences, and graphs. Somewhat surprisingly, another important type of data, namely rank data, has received very little attention in data mining so far. In this paper, we therefore addresses the problem…
Rank-R FNN handles high-dimensional data efficiently.
problem Handling irregularities in high-dimensional data.
method Imposes Canonical/Polyadic decomposition on parameters.
result Achieves state-of-the-art performance on higher-order tensor data.
Paper introduces differentiable sorting and ranking with O(nlogn) time complexity.
problem Non-differentiability of sorting and ranking operations in machine learning.
method Differentiable proxies constructed as projections onto the permutahedron and reduction to isotonic optimization.
result First differentiable sorting and ranking operators with O(nlogn) time and O(n) space complexity. Lognormal distribution used for predicting team rankings in an orienteering relay race.
problem Predicting final team rankings in an orienteering relay race.
method Used lognormal distribution and Fenton-Wilkinson approximations for order statistics.
result Accurate predictions of team rankings using order statistics.
New method finds efficient low-rank neural networks during training.
problem High memory and computational demands of neural networks.
method Restricts weight matrices to a low-rank manifold and updates low-rank factors.
result Significantly reduced time and memory resources required for training and evaluation.
Proves conditions for Fourier transforms in rank 1 symmetric spaces.
problem Understanding Fourier transform bounds in symmetric spaces.
method Proves sufficient and necessary conditions using Lipschitz and Fourier type integral conditions.
result Establishes bounds for Fourier transforms in rank 1 symmetric spaces with specific moduli of continuity.
A framework for quantifying uncertainty in feature importance values.
problem Stable interpretation of feature importance values in machine learning models.
method A novel method based on pairwise comparisons of feature importance values to produce confidence intervals for feature ranks.
result The method produces simultaneous confidence intervals for feature ranks, enabling selection of top-k important features.
We investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. In the Tucker decomposition framework, we show that the Riemannian optimization algorithm with initial value obtained from a spectral method can reconstruct a tensor of size $n\times n \times\c…
In this paper we propose a tensor-based nonlinear model for high-order data classification. The advantages of the proposed scheme are that (i) it significantly reduces the number of weight parameters, and hence of required training samples, and (ii) it retains the spatial structure of the input samples. The proposed mo…
Boosting for label ranking outperforms existing methods.
problem Improving label ranking predictions using boosting techniques.
method Proposed a boosting algorithm tailored for label ranking tasks.
result Significantly outperforms existing label ranking algorithms.