Soft Tournament Equilibrium: Differentiable Set-Valued Inference for Non-Transitive Pairwise Comparisons
Not on the map. Why?
Abstract (arXiv)
Soft Tournament Equilibrium (STE) is a differentiable layer for Top-Cycle (TC) and Uncovered-Set (UC) inference from reciprocal pair probabilities. Normalized log-sum-exp reachability and covering give smooth scores with approximation, perturbation, and margin-recovery bounds. We distinguish structural supervision, posterior uncertainty, and the final set decision through controlled synthetic studies and reconstruction of recorded ordinal profiles. Matched-epoch training improves F1 under a common structural readout, but a separate equal-budget soft-UC comparison does not demonstrate an advantage. A prospective equal-budget hard-UC study improves selective F1 at 24 alternatives from 0.6327/0.6292 for ordinary/relational native heads to 0.6676, while exact recovery remains only 1.16%. On 36 human profiles held out by source, a separate exploratory comparison favors Jeffreys posterior inference over learned independent-edge and mixture distributions in native expected-F1 decoding (0.8742 versus 0.8704/0.8366). Only three references are non-singleton selective cores. Completion certificates and full-depth TC diagnostics clarify additional identification, smoothing, and computational limits. The evidence supports conditional synthetic overlap gains, while preserving the soft-set null and the absence of a demonstrated learning advantage over strong count-based human-profile controls.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 88 references that are in the map. First posted on arXiv 6 Apr 2026.
Builds on
23 of 88 references.
References · 23
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2023Generative Agents: Interactive Simulacra of Human Behaviorcited by 3,500
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2023AgentBench: Evaluating LLMs as Agentscited by 1,211
- 2024Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preferencecited by 1,151
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
- 2024Large Language Model based Multi-Agents: A Survey of Progress and Challengescited by 752
- 2017Representation Learning on Graphs: Methods and Applicationscited by 456
- 2020Fast Differentiable Sorting and Rankingcited by 196
- 2025Evaluation and Benchmarking of LLM Agents: A Surveycited by 145
11 more
- 2020Learning with Differentiable Perturbed Optimizerscited by 81
- 2024Mobile-Bench: An Evaluation Benchmark for LLM-based Mobile Agentscited by 56
- 2025Investigating Non-Transitivity in LLM-as-a-Judgecited by 33
- 2013On the Bayes-optimality of F-measure maximizerscited by 15
- 2024Towards Acyclic Preference Evaluation of Language Models via Multiple Evaluatorscited by 13
- 2025ELSPR: Evaluator LLM Training Data Self-Purification on Non-Transitive Preferences via Tournament Graph Reconstructioncited by 5
- 2022Collecting, Classifying, Analyzing, and Using Real-World Electionscited by 3
- 2024Soft Condorcet Optimization for Ranking of General Agentscited by 3
- 2025Explaining Tournament Solutions with Minimal Supportscited by 2
- 2020On the Structure of Stable Tournament Solutionscited by 1
- 2021Characterizing the Top Cycle via Strategyproofnesscited by 1
Built on by
Not cited yet.