← Back to all news
arXiv Machine Learning By Manisha Kandel

Adaptive Margin Ordinal Loss: Penalizing Center-Class Hedging in Ordinal Classification

Read the original on arXiv Machine Learning →

The paper introduces the Adaptive Margin Ordinal Loss (AMOL), a new loss function designed to reduce the tendency of neural networks to predict center classes in ordinal classification tasks—a problem called center‑class hedging. AMOL applies a multiplicative weight to per‑class loss terms that is large only when a candidate class is near the center while the true label is far from it, thereby discouraging hedging. The authors also propose the Center‑Hedging Rate (CHR) metric to quantify this failure mode and demonstrate that AMOL achieves state‑of‑the‑art Quadratic Weighted Kappa scores on four benchmarks, with an asymmetric variant eliminating hedging on the Abalone dataset.

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.

Related stories

arXiv Machine Learning
Sep 22

Rethinking Class Imbalance for Single-Cell Foundation Models: A Systematic Benchmark Across Architectures and Long-Tail Loss Functions

The paper benchmarks six long‑tail loss functions—cross‑entropy, weighted CE, class‑balanced loss, focal loss, LDAM, and logit‑adjusted softmax—across three single‑cell foundation model architectures (scGPT, scBERT, Geneformer) and three datasets (Multiple Sclerosis, Zheng68K, human Pancreas). It shows that overall accuracy masks systematic failures on rare, disease‑relevant cell types, with a consistent gap between overall accuracy, Macro‑F1, and rare‑class recall under plain cross‑entropy. The study identifies two distinct regimes of rare‑class failure, predicts reweighting efficacy by absolute training‑set size, and finds class‑balanced loss and LDAM to be the most reliable across all settings.

By Zeyu Dong, Jiahui Zhong
ragbenchmarks
More like this →
arXiv AI
Jun 18

Generalized Kullback-Leibler Divergence Loss

arXiv:2503. 08038v2 Announce Type: replace-cross Abstract: In this paper, we delve deeper into the Kullback-Leibler (KL) Divergence loss and mathematically prove that it is equivalent to the Decoupled Kullback-Leibler (DKL) Divergence loss that consists of (1) a weighted Mean Square Error (wMSE) loss and (2) a Cross-Entropy loss incorporating soft labels.

By Jiequan Cui, Beier Zhu, Qingshan Xu, Zhuotao Tian, Xiaojuan Qi, Bei Yu, Hanwang Zhang, Richang Hong
efficiencymultimodalbenchmarkssafety
More like this →
arXiv AI
Jun 30

Pessimism's Paradox: Conservative Offline Training Amplifies Reward Hacking During Online Adaptation in Reasoning Models

arXiv:2606. 30627v1 Announce Type: cross Abstract: Conservative offline training is widely advocated as a safe foundation for subsequent online adaptation: if a policy stays close to well-supported behaviour, the argument goes, it is less likely to exploit imperfections in a learned reward model.

By Subramanyam Sahoo, Aman Chadha, Vinija Jain, Divya Chaudhary
reinforcement-learningsafety
More like this →