Contextual Plackett-Luce Models

• Contextual Plackett-Luce (CPL) models are a family of ranking models that build orderings stage-wise using context-dependent utility functions derived from features, history, or group identity.
• CPL approaches range from feature-based regressions to deep neural architectures, effectively integrating raw inputs, historical interactions, and pairwise dependencies.
• Empirical studies report that CPL models outperform traditional methods in diverse applications, from monocular depth estimation to personalized recommendation and online preselection.

to=arxiv_search.search 大发快三豹子on գործիչ 彩神争霸大发快三 北京赛车计划 code {"query":"\"Contextual Plackett-Luce\" arXiv", "max_results": 10, "sort_by":"submittedDate"}Japgollyassistant to=arxiv_search.search_RGCTX code {"query":"\"Contextual Plackett-Luce\" arXiv", "max_results": 10, "sort_by":"submittedDate"} դժassistant to=arxiv_search.search code {"query":"Contextual Plackett-Luce", "max_results": 10, "sort_by":"submittedDate"} to=arxiv_search.search 天天中彩票怎么买assistant to=arxiv_search.search code {"query":"Contextual Plackett-Luce", "max_results": 10, "sort_by":"relevance"} to=arxiv_search code {"query":"Contextual Plackett-Luce", "max_results": 10, "sort_by":"relevance"} Contextual Plackett-Luce (CPL) denotes a family of context-dependent generalizations of the Plackett-Luce model in which the probability of a ranking, ordered subset, or categorical choice is generated stage-wise, while the utilities driving each stage depend on covariates, query context, user history, image features, group identity, or previously selected elements. The label has been used for several non-identical constructions: feature-based regression models for choices and conditional ranks, contextual bandits for online preselection, listwise models for monocular depth estimation, neural modules for recommendation and retrieval-augmented personalization, and structured sequence-selection models with unary and pairwise interactions (Archambeau et al., 2012, Gray-Davies et al., 2015, Mesaoudi-Paul et al., 2020, Lienen et al., 2020, Jin et al., 2023, Hermes et al., 2024, Du et al., 17 Jan 2026, Mizrachi et al., 9 May 2026).

1. Formal structure of CPL models

The common core of CPL is a Plackett-Luce factorization in which an ordering is built one position at a time. In monocular depth estimation, a permutation $\pi$ of $n$ pixels or points is assigned probability

$$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$

with positive utilities obtained from a neural score map via $u_j=\exp(w_j)$ (Lienen et al., 2020). In online preselection, the contextual utility of arm $i$ at round $t$ is

$v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$

and both full-ranking and winner-choice marginals inherit the same stage-wise form on the selected subset (Mesaoudi-Paul et al., 2020). In heterogeneous rank data, worth is feature-driven and group-specific, replacing item-specific utilities by $\exp\{x_j^\top\beta_g\}$ for group $g$ (Hermes et al., 2024). In structured sequence selection, the logit of candidate $j$ after a selected prefix $n$0 becomes

$n$1

so the next-step selection is still Plackett-Luce, but with history-dependent logits (Mizrachi et al., 9 May 2026).

These formulations differ in what counts as “context,” but they preserve the same probabilistic mechanism: at each step, one selects among the remaining items according to normalized positive scores. This makes CPL a broad modeling template rather than a single standardized architecture. A plausible implication is that the term is best understood as a family of context-conditioned PL models whose distinctions lie in the parameterization of utilities, the nature of feedback, and the target object being ranked or selected.

2. Context parameterization and representational choices

CPL models range from classical feature-based parameterizations to deep neural architectures. In the depth-estimation formulation, the image has $n$2 indexed pixels, a deep network $n$3 produces a real score $n$4 for each location, and positivity is enforced by exponentiation, $n$5 (Lienen et al., 2020). The same work also exploits a random-utility interpretation: if latent depths satisfy $n$6 with independent Gumbel noise, then the induced ranking follows a PL law with $n$7, so maximizing the PL likelihood recovers $n$8 up to an additive constant.

In retrieval-augmented LLM personalization, context consists of a set of history records $n$9 and a current query $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$0. The PURPLE framework defines a user profile as an ordered $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$1-permutation of records and uses a scoring pipeline with a frozen Contriever encoder, token-level cross-attention from record tokens to query tokens, pooling to obtain record embeddings, a Transformer encoder without positional bias to model inter-record dependencies, and a final MLP that outputs a positive score for each record (Du et al., 17 Jan 2026). In STARank, user history is encoded by a permutation-sensitive LSTM reader, candidate items are encoded by a permutation-invariant attention mechanism, and learned position embeddings are injected when computing rank-dependent logits (Jin et al., 2023). In structured sequence selection, unary scores $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$2 and pairwise interactions $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$3 are produced in parallel from candidate embeddings, with $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$4 implemented approximately as a scaled dot product between projected “key” and “value” vectors (Mizrachi et al., 9 May 2026).

Other CPL variants are explicitly statistical rather than neural. Collaborative ranking factorizes user-item scores as $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$5 and optionally introduces a latent-community mixture over Plackett-Luce components (Tran et al., 2014). Joint learning from heterogeneous rank data uses object covariates $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$6 and group-specific coefficients $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$7 (Hermes et al., 2024). Plackett-Luce regression for polychotomous data defines class scores $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$8 with nonnegative class-feature weights (Archambeau et al., 2012). Bayesian nonparametric conditional-rank regression uses a positive regression function $$P(\pi \mid \mathbf u)=\prod_{i=1}^{n}\frac{u_{\pi(i)}}{\sum_{j=i}^{n}u_{\pi(j)}},$$9, often log-linear, to tune the stochastic ordering of conditional distributions (Gray-Davies et al., 2015). Together these examples show that “context” may denote raw input features, joint context-arm embeddings, historical interactions, group membership, or a selected prefix.

3. Estimation, inference, and optimization regimes

Maximum-likelihood and listwise training are central in several CPL formulations. For depth estimation, training minimizes the negative log-likelihood of sampled partial rankings,

$u_j=\exp(w_j)$0

with a simple sampling strategy that draws many subsets, sorts them by pseudo-depth, scores their informativeness, penalizes adjacent pairs whose ratio of depths is $u_j=\exp(w_j)$1, and keeps the top $u_j=\exp(w_j)$2 subsets for the minibatch (Lienen et al., 2020). STARank also uses an exact list-wise objective derived from the internal consistency of Plackett-Luce models, yielding a position-by-position surrogate with $u_j=\exp(w_j)$3 cost per list (Jin et al., 2023). The structured sequence-selection CPL of 2026 supports both an ordered next-step view and an unordered set view, where the loss averages the log-probabilities of all valid continuations from a sampled partial prefix (Mizrachi et al., 9 May 2026).

Bandit, reinforcement-learning, and online procedures appear in other CPL lines. PURPLE maximizes the expected reward

$u_j=\exp(w_j)$4

where the reward is the frozen LLM’s log-likelihood of the reference response. Training uses REINFORCE with $u_j=\exp(w_j)$5-normalized rewards across sampled profiles, and inference returns the top-$u_j=\exp(w_j)$6 records by score (Du et al., 17 Jan 2026). In the CPPL contextual bandit algorithm, the learner updates an estimate of $u_j=\exp(w_j)$7 by SGD on the negative log-likelihood, constructs UCB-style confidence radii for $u_j=\exp(w_j)$8, and selects the subset maximizing $u_j=\exp(w_j)$9 (Mesaoudi-Paul et al., 2020).

Convex penalized estimation, EM, and Bayesian latent-variable inference define a third group of methods. The Sparse Fused Plackett-Luce model minimizes a penalized negative log-likelihood with an $i$0 sparsity penalty and an $i$1 fusion penalty across groups, and is optimized by an MM/Newton scheme with surrogate penalty matrices and descent-controlled updates (Hermes et al., 2024). Collaborative ranking with latent communities is learned by EM, alternating between responsibility updates for communities and gradient-based updates of community score tables (Tran et al., 2014). Plackett-Luce regression introduces auxiliary variables $i$2, giving rise to a closed-form MAP-EM update, a Gibbs sampler using discrete, exponential, and Gamma draws, and a fully factorized variational approximation (Archambeau et al., 2012). Bayesian nonparametric conditional-rank regression uses a composite marginal likelihood that factorizes into separate components for $i$3, $i$4, and $i$5, permitting independent inference with standard Bayesian nonparametric density estimation and Cox-type partial-likelihood software (Gray-Davies et al., 2015).

4. Major application regimes

The main usages of the CPL label can be organized by the object being ranked and by the source of contextual information.

Setting	CPL object	Context source
Monocular depth estimation (Lienen et al., 2020)	Partial rankings of pixels or points	Image features and pseudo-depth subsets
Retrieval-augmented personalization (Du et al., 17 Jan 2026)	Ordered user profile of records	User history records and current query
Learning-to-rank and recommendation (Jin et al., 2023)	Permutations of candidate items	User browsing history and candidate-item set
Online preselection bandits (Mesaoudi-Paul et al., 2020)	Subset or ranking of arms	Context-arm feature vectors
Heterogeneous rank data (Hermes et al., 2024)	Group-specific rankings over objects	Object covariates and known ranker groups
Collaborative ranking (Tran et al., 2014)	User-specific item permutations	User identity, item factors, latent communities
Conditional-rank and polychotomous regression (Archambeau et al., 2012, Gray-Davies et al., 2015)	Class choice or response ranks	Subject covariates or regression covariates
Structured sequence selection (Mizrachi et al., 9 May 2026)	Ordered subset plus EOS	Candidate embeddings and selected prefix

Despite the diversity of these tasks, the modeling role of CPL is similar. It supplies a normalized distribution over stage-wise selections, so it can act as a ranking model, a subset-selection model, a discrete-choice model, a profile-construction model, or a structured decoder. The most domain-specific differences arise in the semantics of the “items” and in the way context enters the utility function. In some settings, context is entirely exogenous, as with arm features or object covariates. In others, context is endogenous to the sequence itself: previously selected elements update future logits, or a user profile is built as an ordered set whose later elements depend on earlier ones.

5. Reported empirical behavior

The empirical literature reports several recurrent advantages for CPL-style formulations. In monocular depth estimation, zero-shot evaluation was carried out on four held-out datasets—Ibims, Sintel, DIODE, and TUM—never seen during training on HR-WSI. Ordinal error and nDCG were used as the primary ordinal metrics, and CPL outperformed both pairwise and regression baselines. With an EfficientNet-based backbone, it achieved the lowest average ordinal rank across datasets and top-3 nDCG performance; after affine calibration, it also rivaled or beat state-of-the-art regressors on metric RMSE and $i$6 depth accuracy despite using no metric supervision during training (Lienen et al., 2020).

In retrieval-augmented personalization, PURPLE was evaluated on nine tasks on LaMP and three on LongLaMP, against BM25, Contriever, IC-RALM, REPLUG, RankGPT, and ICR. Reported metrics were Accuracy/F1 for classification, MAE/RMSE for regression, and ROUGE-1/ROUGE-L/METEOR for generation. Across all tasks and LLM scales—Phi-4-Mini, Llama-3-8B, and Llama-3-70B—PURPLE outperformed every baseline. The reported gains include $i$7–$i$8 points in accuracy/F1 on classification, RMSE reduced from $i$9 to $t$0 on regression, and ROUGE-1 gains of $t$1–$t$2 with METEOR gains of $t$3–$t$4 on generation. Human evaluation on Tweet paraphrasing gave PURPLE a $t$5 to $t$6 win over ICR in preserving persona and semantics (Du et al., 17 Jan 2026).

In recommendation-oriented ranking, STARank was compared against 9 state-of-the-art methods on 2 learning-to-rank benchmark datasets and 3 top-$t$7 real-world recommendation datasets, and was reported to be superior in conventional ranking metrics. Because those metrics do not account for contextual dependence among items, the work also introduced PBM and UBM simulation-based metrics, under which STARank consistently achieved better performance (Jin et al., 2023). In heterogeneous rank data, simulation studies reported lower RMSE on $t$8, higher $t$9 for zero-versus-nonzero feature recovery, and better rankings measured by RCR, especially when $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$0 is large, $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$1 is sparse, or moderate group heterogeneity exists; out-of-sample ranking of entirely new items was also more accurate (Hermes et al., 2024). In online preselection, CPPL achieved sublinear regret and the lowest cumulative regret on both synthetic data and an algorithm-selection scenario with 20 SAPS-SAT solver configurations (Mesaoudi-Paul et al., 2020). In structured sequence selection, CPL achieved min-ADE $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$2, min-HD $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$3, off-road rate $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$4, and runtime $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$5 ms on nuScenes BEV grids, compared with $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$6, $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$7, $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$8, and $v_i^*(X_t)=\exp(\theta^{*\top}x_{t,i}),$9 for an autoregressive pointer model; on CIFAR-100 representative subset selection, it obtained CluRec $\exp\{x_j^\top\beta_g\}$0, CluPrec $\exp\{x_j^\top\beta_g\}$1, CluF1 $\exp\{x_j^\top\beta_g\}$2, CardErr $\exp\{x_j^\top\beta_g\}$3, and runtime $\exp\{x_j^\top\beta_g\}$4 ms (Mizrachi et al., 9 May 2026).

6. Conceptual distinctions, misconceptions, and recurring themes

A common misconception is that Contextual Plackett-Luce refers to a single model class with a fixed parameterization. The literature shows otherwise. Some CPL constructions are essentially feature-based Plackett-Luce models in which context enters only through a log-linear worth function, as in contextual bandits, heterogeneous rank data, and conditional-rank regression (Gray-Davies et al., 2015, Mesaoudi-Paul et al., 2020, Hermes et al., 2024). Others are explicitly neural and context-fusing, such as the depth-estimation model, STARank, and PURPLE (Lienen et al., 2020, Jin et al., 2023, Du et al., 17 Jan 2026). Still others introduce structural departures from static item utilities, including position-dependent damping weights in collaborative ranking and history-dependent pairwise updates in structured sequence selection (Tran et al., 2014, Mizrachi et al., 9 May 2026).

Another recurrent source of confusion concerns supervision. CPL has been trained from full rankings, partial rankings, winner feedback, single observed choices, pseudo-rankings derived from depth maps, and dense rewards given by the likelihood of a reference response under a frozen LLM. It has also been used when only one sampled valid output is available for an inherently ambiguous structured task (Archambeau et al., 2012, Mesaoudi-Paul et al., 2020, Lienen et al., 2020, Du et al., 17 Jan 2026, Mizrachi et al., 9 May 2026). This suggests that the central attraction of CPL is not a single inference recipe, but the availability of a normalized sequential probability model that can interface with maximum-likelihood estimation, EM, MM/Newton optimization, SGD, UCB-style exploration, Gibbs sampling, variational inference, and policy-gradient training.

A final recurring theme is the tension between expressivity and efficiency. Fully autoregressive decoders capture dependence but are expensive; purely parallel or independently scored methods are efficient but can struggle when the target is ambiguous or when inter-item dependencies matter. Several CPL formulations address this tension by keeping the stage-wise PL normalization while constructing scores in a context-aware way. In some cases this yields principled maximum-likelihood estimation under a random-utility model; in others it yields direct optimization of downstream utility or lightweight sequential decoding after a parallel scoring pass (Lienen et al., 2020, Du et al., 17 Jan 2026, Mizrachi et al., 9 May 2026).