arXiv Machine Learning By Jia Chen, Zhiyong Yang, Shilong Bao, Qianqian Xu, Qingming Huang

Pairwise AUC Optimization Needs Corrective Power: A Unified View

Read the original on arXiv Machine Learning →

The paper investigates why direct pairwise AUC surrogate training, though aligned with the ranking metric, can fail to provide corrective updates during stochastic training. It introduces the concept of Corrective Power, showing that in certain regions severe ranking errors persist without generating strong gradient signals, a phenomenon linked to degeneracies in the U‑statistics of pairwise gradients. The authors explain empirical observations—such as the effectiveness of squared‑hinge loss, the benefit of cross‑entropy warm‑up, and the advantage of parameter‑efficient fine‑tuning—through this theoretical lens, and validate their claims with experiments on eight computer‑vision and eight NLP tasks using various models.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 9

Keeping Score: Adaptive, Tuning-Free Loss Weighting for Score-Augmented Neural Ratio Estimation

The paper introduces an adaptive, tuning‑free method for weighting the score‑matching term in the loss function of neural ratio estimators, eliminating the need for manual hyper‑parameter tuning. By adjusting the score loss weights during training based on loss gradients, the approach adds minimal overhead to standard classifier training. Experiments on network dynamics and spatial process models show that this technique improves surrogate quality and can match the inference performance of a 10× larger training set while keeping training time under 1.1× higher.

By Alexander Shen, Mikael Kuusela
arXiv AI
Jul 21

First-Order Predictable but Pairwise Fragile: Local Task Adaptation in Trained Transformers

arXiv:2607. 16821v1 Announce Type: cross Abstract: Task arithmetic, sequential fine-tuning, activation steering, and first-order random search all operate through relatively small perturbations around an already trained checkpoint, and they rely on different local approximations: individual perturbations should be first-order predictable, task updates should compose with controlled interference, useful tangent structure should be stable and possible to estimate, and weight edits should have counterparts in representation space.

By Irina Piontkovskaia, Sergey Nikolenko