Improved unsupervised probing for ranking tasks using Contrast-Consistent Ranking.
problem Improving self-consistency in language model rankings.
method Adapting Contrast-Consistent Search (CCS) to Contrast-Consistent Ranking (CCR) for ranking tasks.
result CCR probing outperforms prompting techniques across different models and datasets.
Proposes a new method for rank-consistent ordinal regression without weight-sharing constraints.
problem Ordinal response variables in real-world prediction problems are often ignored by conventional classification losses.
method CORN framework using conditional training sets and the chain rule for conditional probability distributions.
result Improves performance substantially compared to the CORAL reference approach without weight-sharing restrictions.
Paper proves equivalence between time consistency and nested formula in financial rankings.
problem Ranking consistency of stochastic processes over time.
method Minimalist definition of Time Consistency and proof of equivalence with Nested Formula.
result Two assessments are consistent if one is factored into the other.
Optimal rank-breaking estimator improves accuracy and complexity in rank aggregation.
problem Inconsistent estimates from naive rank-breaking approaches.
method Optimal rank-breaking estimator that treats pairwise comparisons unequally based on data topology.
result Achieves consistency and best error bound, characterizing accuracy-complexity tradeoff.
A central problem in ranking is to design a ranking measure for evaluation of ranking functions. In this paper we study, from a theoretical perspective, the widely used Normalized Discounted Cumulative Gain (NDCG)-type ranking measures. Although there are extensive empirical studies of NDCG, little is known about its t…
Proposes CORAL framework for consistent ordinal regression in neural networks.
problem Inconsistencies in ordinal regression with neural networks.
method Transforms ordinal targets into binary classification subtasks and applies CORAL framework for rank-monotonicity and consistent confidence scores.
result Reduction of prediction error in age prediction tasks.
This paper improves multi-label ranking by reweighting univariate losses, enhancing consistency and performance.
problem Improving multi-label ranking performance while maintaining consistency.
method Systematic study of consistency and generalization error bounds for learning algorithms, proposing a reweighted univariate loss.
result Inconsistent pairwise losses can lead to better performance than consistent univariate losses in practice.
Study on core consistency preservation in compressed tensors.
problem Ensuring low-rank structure is maintained during tensor compression.
method Theoretical analysis and experimental validation of compression schemes.
result Identified sufficient conditions for preserving core consistency.
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.
A framework for ranking with abstention, offering theoretical guarantees and practical effectiveness.
problem Making predictions with limited cost when uncertain.
method Introduces a novel ranking framework with abstention, analyzing theoretical consistency bounds.
result Extensive theoretical analysis including H-consistency bounds for linear and neural network models. Proposes a model for identifying edges in low-rank dynamical networks.
problem Inability of conventional methods to handle low-rank dynamical networks.
method Low rank dynamical network model with causal Wiener filtering.
result Consistent method for estimating all network edges.
We consider the predictive problem of supervised ranking, where the task is to rank sets of candidate items returned in response to queries. Although there exist statistical procedures that come with guarantees of consistency in this setting, these procedures require that individuals provide a complete ranking of all i…
Proposes a deep learning method for robust ordinal regression under label noise.
problem Label noise in real-world data constrains ordinal regression algorithms.
method Develops a deep learning approach that is robust to label noise and rank consistent.
result Demonstrates robustness to label noise and rank consistency on real data.
We find a rank effect in commodity prices that yields higher returns.
problem Understanding the pricing dynamics of commodities over time.
method Nonparametric econometric methods to demonstrate the rank effect as a consequence of stationary relative asset price distribution.
result A portfolio of lower-ranked, lower-priced commodities yields 23% higher annual returns than a portfolio of higher-ranked, higher-priced commodities.
New methods extend kernel estimators for partial rankings, improving performance in machine learning tasks.
problem Incomplete rankings data in real-world applications.
method Antithetic and Monte Carlo kernel estimators for partial rankings, variance reduction scheme.
result Improved antithetic kernel estimator with lower variance and better performance.
Low-rank forecasting improves consistency in time series predictions.
problem Forecasting multiple values of a time series using past values.
method Breaks forecasting into estimating a latent state and future values, using convex optimization.
result Forecast consistency is achieved, meaning estimates of the same value at different times are consistent.
Improves PARAFAC tensor decomposition rank estimation for better interpretability and accuracy.
problem Estimating the optimal number of latent factors in PARAFAC tensor decomposition.
method Automatically determines the rank using Core Consistency Diagnostic (CORCONDIA) and explores the trade-off between interpretability and predictive accuracy.
result Striking a good balance between interpretability and accuracy benefits rank estimation.
A new method matches point sets of low-rank networks via their Laplace transforms.
problem Matching nodes in unseeded, low-rank networks without known correspondences.
method Transform-based unsupervised point registration via minimizing discrepancy between Laplace transforms.
result First consistency guarantee and explicit error rate for general low-rank models.
WMRB improves ranking accuracy and efficiency in scalable batch training.
problem Improving ranking accuracy and efficiency in large-scale recommendation systems.
method WMRB uses a new rank estimator and an efficient batch training algorithm.
result WMRB consistently outperforms WARP and other baselines in three item recommendation tasks.
Paper introduces a novel framework for recognizing dynamic ranking structures in preference-based data.
problem Complex and noisy preference-based data often hide underlying homogeneous structures.
method Developed an approach to identify dynamic ranking groups using temporal penalties and spectral estimation. Introduced an objective function for detecting structural changes.
result Consistent recognition of ranking groups and structural changes in preference-based data.
New method estimates position bias without manual interventions for better search engine rankings.
problem Presentation bias confounds relevance signals in search engines.
method Proposes a method for consistent propensity estimation without manual relevance judgments.
result Initial studies confirm scalability, accuracy, and robustness of the approach.
The paper tackles multi-label ranking with uncertain probabilities.
problem Making skeptical inferences for multi-label ranking with sets of probabilities.
method Assumes a convex set of probabilities (credal set) over labels and seeks set-valued predictions.
result Developed methods for making skeptical inferences in multi-label ranking with uncertain probabilities.
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.
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 …
New method improves consistency in preference learning for neural networks.
problem Inconsistent surrogate losses in preference learning for neural networks.
method Formulated a margin-shifted ranking framework and introduced Structure-Aware H-consistency. result Proved superior consistency guarantees for capacity-bounded models using heavy-tailed surrogates.
We address the collective matrix completion problem of jointly recovering a collection of matrices with shared structure from partial (and potentially noisy) observations. To ensure well--posedness of the problem, we impose a joint low rank structure, wherein each component matrix is low rank and the latent space of th…
We consider the problem of rank loss minimization in the setting of multilabel classification, which is usually tackled by means of convex surrogate losses defined on pairs of labels. Very recently, this approach was put into question by a negative result showing that commonly used pairwise surrogate losses, such as ex…
A new method for filling in missing traffic data improves accuracy over existing techniques.
problem Incomplete spatiotemporal traffic data.
method Low-rank autoregressive tensor completion (LATC) framework.
result LATC framework better captures spatiotemporal consistency and local consistency.
A new model for data with zeros or missing values.
problem Data with excess zeros or missing values.
method Composite loss framework for low-rank modeling, combining generalized low-rank and hurdle methods.
result Demonstrated on a manufacturing data set and applied to missing value imputation.
Introduces new performance criteria for investment under distorted probabilities.
problem Reconciling time-consistent performance with probability distortions.
method Two definitions of forward rank-dependent criteria, equivalence established; characterization of viable probability distortion processes.
result Characterization of optimal wealth process and new distorted measure.
We propose a method to infer stochastic low-rank RNNs from neural data.
problem Fitting low-rank RNNs to noisy, stochastic neural data.
method Variational sequential Monte Carlo methods for stochastic low-rank RNNs.
result Lower dimensional latent dynamics compared to state-of-the-art methods.
Algorithm predicts item rankings from pairwise preferences with fewer samples than known methods.
problem Optimal recovery of true rankings from randomly chosen pairwise preferences.
method Embedding graph structure into orthonormal representations, using SVM for ranking prediction.
result Statistical consistency on Kendall's tau and Spearman's footrule with sample complexity of $O(n^2 χ(ar{G}))^{ rac{2}{3}}$ pairs.
Enhanced H-consistency bounds derived under relaxed conditions.
problem Quantifying the relationship between zero-one estimation error and surrogate loss estimation error.
method Relaxing the condition on the surrogate loss conditional regret and presenting a general framework for establishing enhanced H-consistency bounds. result Derivation of more favorable H-consistency bounds in various scenarios. Ranking recommendation algorithms across datasets using Bradley-Terry model
problem Comparing recommendation algorithms across different datasets
method Introduce a novel data-driven ranking methodology based on Bradley-Terry model
result The obtained ranking depends on key dataset statistics
This paper protects rankings from differential privacy breaches.
problem Leakage of personal information in rankings.
method Develops ε-ranking differential privacy and a multistage ranking algorithm.
result Establishes the connection between Mallows model and ε-ranking differential privacy.
Investigates portfolio selection for rank-dependent utilities in incomplete markets.
problem Portfolio selection for agents with rank-dependent utility in incomplete financial markets.
method Characterizes deterministic strict equilibrium strategies for constant-coefficient and time-invariant probability weighting functions. Addresses the issue of selecting an optimal strategy from multiple equilibrium strategies for time-variant probability weighting functions.
result Characterizes deterministic strict equilibrium strategies and identifies optimal strategies from multiple equilibrium strategies.
A new method for estimating random utility models using rank-breaking and composite marginal likelihood.
problem Estimating random utility models efficiently and accurately.
method Rank-breaking-then-composite-marginal-likelihood (RBCML) framework.
result RBCML achieves better statistical efficiency and computational efficiency than existing methods.
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.
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a similarity matrix from pairwise comparisons, using seriation methods to reorder t…
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 structured prediction method for ranking labels.
problem Solving label ranking problems as structured output regression.
method Two-step approach: regression in feature space followed by pre-image solving.
result Efficiency on real-world datasets for partial and complete rankings.
New batch learning framework improves scalability and accuracy of personalized ranking.
problem Inaccurate rank estimation in large-scale personalized ranking algorithms.
method Uses batch-based rank estimators and smooth rank-sensitive loss functions.
result Consistent accuracy improvements and time efficiency advantages over state-of-the-art methods.
Decomposes returns of bottom-ranked assets, finds excess returns.
problem Excess returns of bottom-ranked assets not explained by existing models.
method Decomposes returns into rank crossovers and relative price changes.
result Excess returns of bottom-ranked assets are driven by relative price changes, not rank.
SRRM improves recursive transport surrogates in the small-discrepancy regime.
problem Insufficient understanding of recursive partitioning methods' statistical behavior and resolution in the small-discrepancy regime.
method Introduced Selective Recursive Rank Matching (SRRM) to improve the resolution of Recursive Rank Matching (RRM).
result SRRM yields a higher-fidelity practical surrogate for the Wasserstein distance at moderate additional computational cost.
StealthRank subtly boosts LLM rankings without detectable anomalies.
problem Adversarial manipulation of LLM-driven ranking systems.
method Energy-based optimization with Langevin dynamics for stealthy prompt generation.
result StealthRank outperforms existing methods in covertly boosting rankings.
We develop a framework for consistent polyhedral surrogates in classification and prediction.
problem Designing consistent polyhedral surrogates for classification and prediction problems.
method Formalizing and studying embeddings of predictions as points in R^d, assigning original loss values, and convexifying to create surrogates.
result Established a strong connection between embeddings and polyhedral surrogates, providing constructions and proofs of consistency or inconsistency.
The paper proposes methods for predicting missing values in mixed data matrices.
problem Matrix completion for mixed data types (continuous, binary, ordinal).
method Generalized latent factor models for low-rank matrix estimation with entrywise consistency.
result Tight probabilistic error bounds for the proposed estimators.
Proposes a cross entropy loss for better ranking algorithms.
problem Improving the theoretical understanding and performance of ranking algorithms.
method Introduces a cross entropy-based loss function that is a convex bound on NDCG and consistent with NDCG.
result Empirically, the proposed method outperforms existing algorithms in quality and robustness.