Saved in:
Bibliographic Details
Main Author: Cheng, Yin
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.09733
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910120442593280
author Cheng, Yin
author_facet Cheng, Yin
contents Ranking systems produce ordered lists from scalar scores, yet the ranking itself depends only on pairwise comparisons. We develop a mathematical theory that takes this observation seriously, centering the analysis on pairwise margins rather than absolute scores. In the linear case, each pairwise margin decomposes exactly into factor-level contributions. We prove that the resulting L_1 local influence share is the unique budgeting rule consistent with pure factor refinement. Aggregating local shares yields a global influence structure: in log-absolute-weight coordinates, this structure is the gradient of a convex potential, its Jacobian is a competition-graph Laplacian, and Influence Exchange -- the reallocation of pairwise control across model states -- satisfies a finite energy identity with a zero-exchange rigidity law. For nonlinear scoring, the pairwise margin remains well-defined, but factor-level decomposition becomes path-dependent due to cross-factor interactions. We prove an interaction-curvature theorem: factorwise path attribution is path-independent if and only if the relevant mixed partial derivatives vanish, recovering full factorwise uniqueness exactly in the additive regime. The framework extends through local linearization and Pairwise Integrated Gradients. The geometric arc continues through permutation space, score-space hyperplane crossings, discrete exactness and triangle curl, Hodge-like diagnostics, and root-space/Weyl-chamber geometry -- organized as successive interpretive closures of the same pairwise-first analytical progression.
format Preprint
id arxiv_https___arxiv_org_abs_2604_09733
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A Mathematical Theory of Ranking
Cheng, Yin
Information Retrieval
Ranking systems produce ordered lists from scalar scores, yet the ranking itself depends only on pairwise comparisons. We develop a mathematical theory that takes this observation seriously, centering the analysis on pairwise margins rather than absolute scores. In the linear case, each pairwise margin decomposes exactly into factor-level contributions. We prove that the resulting L_1 local influence share is the unique budgeting rule consistent with pure factor refinement. Aggregating local shares yields a global influence structure: in log-absolute-weight coordinates, this structure is the gradient of a convex potential, its Jacobian is a competition-graph Laplacian, and Influence Exchange -- the reallocation of pairwise control across model states -- satisfies a finite energy identity with a zero-exchange rigidity law. For nonlinear scoring, the pairwise margin remains well-defined, but factor-level decomposition becomes path-dependent due to cross-factor interactions. We prove an interaction-curvature theorem: factorwise path attribution is path-independent if and only if the relevant mixed partial derivatives vanish, recovering full factorwise uniqueness exactly in the additive regime. The framework extends through local linearization and Pairwise Integrated Gradients. The geometric arc continues through permutation space, score-space hyperplane crossings, discrete exactness and triangle curl, Hodge-like diagnostics, and root-space/Weyl-chamber geometry -- organized as successive interpretive closures of the same pairwise-first analytical progression.
title A Mathematical Theory of Ranking
topic Information Retrieval
url https://arxiv.org/abs/2604.09733