A Mathematical Theory of Ranking
- URL: http://arxiv.org/abs/2604.09733v1
- Date: Thu, 09 Apr 2026 17:00:49 GMT
- Title: A Mathematical Theory of Ranking
- Abstract summary: Ranking systems produce ordered lists from scalar scores, yet the ranking itself depends only on pairwise comparisons.<n>We develop a mathematical theory that takes this observation seriously, centering the analysis on pairwise margins rather than absolute scores.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Exact-Form Regret for Gradient Descent, Mirror Descent and Follow-the-Regularized-Leader [46.31158375592562]
Recent work shows that first-order methods control richer action-dependent deviations.<n>We ask for a geometric characterization of the deviations with respect to which online gradient descent, mirror descent, and follow-the-regularized-leader (FTRL) achieve no regret.
arXiv Detail & Related papers (2026-09-08T21:32:02Z) - Interior skin focusing and directional mirror transfer in a graded non-Hermitian Krawtchouk network [0.0]
We study a finite open Krawtchouk network with oppositely graded directed hoppings.<n>For a broad intermediate range of asymmetries, their local imaginary gauge field changes sign in the bulk.
arXiv Detail & Related papers (2026-08-19T10:56:53Z) - Understanding Differentiable Embeddings Through Differential and Integral Geometry [17.589227975584887]
Existing diagnostics provide only partial answers.<n>We show that they are all derived from a single geometric object induced by every differentiable embedding.<n>This framework provides two complementary geometric views of an embedding.
arXiv Detail & Related papers (2026-08-07T05:02:18Z) - Quotient Dynamics, Effective Curvature, and Implicit Bias in Positive Quadratic Networks [0.0]
Positive quadratic networks admit the lowrank representation f_U(x)=xtop UUtop x, where UinmathbbRdtimes r is identifiable only up to right multiplication.<n>We study how this quotient structure governs training dynamics, curvature, recovery, and bias.
arXiv Detail & Related papers (2026-07-28T12:04:46Z) - Quotient-Categorical Representations for Bellman-Compatible Average-Reward Distributional Reinforcement Learning [8.988097534171995]
We introduce a quotient-space formulation in which state-indexed bias laws are identified up to a common translation.<n>We show that synchronous exact updates are gain-independent at the quotient-law level.
arXiv Detail & Related papers (2026-05-11T22:17:09Z) - Localization Tensor Revisited: Geometric-Probabilistic Foundations and a Structure-Factor Criterion under Periodic Boundaries [2.5694382720775306]
We revisit the localization tensor (LT) from geometric and probabilistic perspectives.<n>We identify the diagonal part, Cpp, as a "localization function" C(p), whose small-momentum behavior determines the LT in the thermodynamic limit.<n>We show that the finite-momentum behavior of C(p), together with an inverse participation ratio (IPR)-based upper bound valid in localized phases, provides a sharp criterion that discriminates localization from dimerization.
arXiv Detail & Related papers (2026-02-16T14:29:57Z) - Deterministic Zeroth-Order Mirror Descent via Vector Fields with A Posteriori Certification [45.85698554568285]
We develop a deterministic zeroth-order mirror descent framework by replacing gradients with a general vector field.<n>Our analysis provides an evaluation template for last-rate inequality evaluations.<n>Together, these results expose a hidden geometric linking Bregman identities, deterministic certification, and robust conic geometry in zeroth-order mirror descent.
arXiv Detail & Related papers (2026-01-31T10:05:05Z) - Hidden-Field Coordination Reveals Payoff-Free Quantum Correlation Structure in Decentralized Coordination [0.0]
We study decentralized multi-agent coordination where agents must correlate actions against an unobserved field and cannot communicate.<n>We introduce the Hidden-Field Coordination model, which enforces identical information access and no-signaling constraints across strategies.
arXiv Detail & Related papers (2026-01-29T00:46:23Z) - ARGUS: Adaptive Rotation-Invariant Geometric Unsupervised System [0.0]
This paper introduces Argus, a framework that reconceptualizes drift detection as tracking local statistics over a fixed spatial partition of the data manifold.<n> Voronoi tessellations over canonical orthonormal frames yield drift metrics that are invariant to transformations.<n>A graph-theoretic characterization of drift propagation is developed that distinguishes coherent distributional shifts from isolated perturbations.
arXiv Detail & Related papers (2026-01-03T22:39:20Z) - Solving a Nonlinear Eigenvalue Equation in Quantum Information Theory: A Hybrid Approach to Entanglement Quantification [0.0]
We present a hybrid analytical and numerical framework for evaluating the geometric measure of entanglement.<n>We make the coupled nonlinear eigenstructure explicit by proving the equal multiplier stationarity.<n>The resulting hybrid solver reproduces the exact optimum for standard three qubit benchmarks.
arXiv Detail & Related papers (2025-11-14T13:36:47Z) - From Local Nonclassicality to Entanglement: A Convexity Law for Single-Excitation Dynamics [0.5541461456285174]
We prove a simple dynamical law for excitation-preserving interactions.<n>The sum of local Wigner negativities is upper-bounded by a fixed budget set by the initially excited state.<n>The predicted trajectory of the summed local negativity provides a practical hardware metric.
arXiv Detail & Related papers (2025-11-13T16:40:44Z) - Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization [48.25304391127552]
Estimating the tangent spaces of a data manifold is a fundamental problem in data analysis.<n>We propose a method, Laplacian Eigenvector Gradient Orthogonalization (LEGO), that utilizes the global structure of the data to guide local tangent space estimation.
arXiv Detail & Related papers (2025-10-02T17:59:45Z) - Value bounds and Convergence Analysis for Averages of LRP attributions [44.992386137813014]
We analyze numerical properties of Layer-wise relevance propagation (LRP)-type attribution methods by representing them as a product of modified gradient matrices.<n>In particular, our analysis reveals that the constants for LRP-beta remain independent of weight norms, a significant distinction from both gradient-based methods and LRP-epsilon.
arXiv Detail & Related papers (2025-09-10T19:50:00Z) - Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training.
We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
arXiv Detail & Related papers (2023-10-20T12:45:12Z) - Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
arXiv Detail & Related papers (2023-06-29T01:20:44Z) - Disentanglement of Correlated Factors via Hausdorff Factorized Support [53.23740352226391]
We propose a relaxed disentanglement criterion - the Hausdorff Factorized Support (HFS) criterion - that encourages a factorized support, rather than a factorial distribution.
We show that the use of HFS consistently facilitates disentanglement and recovery of ground-truth factors across a variety of correlation settings and benchmarks.
arXiv Detail & Related papers (2022-10-13T20:46:42Z) - Localisation in quasiperiodic chains: a theory based on convergence of
local propagators [68.8204255655161]
We present a theory of localisation in quasiperiodic chains with nearest-neighbour hoppings, based on the convergence of local propagators.
Analysing the convergence of these continued fractions, localisation or its absence can be determined, yielding in turn the critical points and mobility edges.
Results are exemplified by analysing the theory for three quasiperiodic models covering a range of behaviour.
arXiv Detail & Related papers (2021-02-18T16:19:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.