A total-variation robust Plackett-Luce loss whose adversarial ranking is the ascending-score order, with convex offline and weakly-convex online guarantees.
Proceedings of the 41st International Conference on Machine Learning , series =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Distributionally Robust Listwise Preference Optimization
A total-variation robust Plackett-Luce loss whose adversarial ranking is the ascending-score order, with convex offline and weakly-convex online guarantees.