mlsanityData to 14 Oct 2026

Stochastic Order Learning: An Approach to Rank Estimation Using Noisy Data

arXiv 2607.08103 ↗First posted 9 Jul 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Rank estimation under label noise poses a fundamental challenge, as ordinal annotations often exhibit structured uncertainty rather than simple label corruption. In this paper, we reformulate rank estimation with noisy ordinal labels as a stochastic ordering problem, in which each instance is inherently associated with multiple plausible ranks instead of a single deterministic label. Based on this view, we propose stochastic order learning (SOL), a learning framework that captures ordinal label uncertainty and learns an embedding space through two complementary objectives: a discriminative loss that structures instance--centroid interactions and a stochastic order loss that enforces probabilistic ordering relations between instances. Extensive experiments across diverse datasets demonstrate that SOL enables reliable rank estimation under various types and levels of label noise. The source code is available at https://github.com/cwlee00/SOL.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 62 references that are in the map. First posted on arXiv 9 Jul 2026.

Builds on

26 of 62 references.

References · 26

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  2. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  3. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
  4. 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 997
  5. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 653
  6. 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 443
  7. 2020Normalized Loss Functions for Deep Learning with Noisy Labelscited by 257
  8. 2019Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Ratescited by 142
  9. 2019Learning From Noisy Labels By Regularized Estimation Of Annotator Confusioncited by 127
  10. 2016Photo Aesthetics Ranking Network with Attributes and Content Adaptationcited by 125
  11. 2022Selective-Supervised Contrastive Learning with Noisy Labelscited by 112
  12. 2016Deep Label Distribution Learning with Label Ambiguitycited by 104
14 more
  1. 2018Masking: A New Perspective of Noisy Supervisioncited by 93
  2. 2019Curriculum Loss: Robust Learning and Generalization against Label Corruptioncited by 88
  3. 2021Learning Probabilistic Ordinal Embeddings for Uncertainty-Aware Regressioncited by 58
  4. 2022C-Mixup: Improving Generalization in Regressioncited by 57
  5. 2023Improving Deep Regression with Ordinal Entropycited by 45
  6. 2022Moving Window Regression: A Novel Approach to Ordinal Regressioncited by 44
  7. 2019BridgeNet: A Continuity-Aware Probabilistic Network for Age Estimationcited by 39
  8. 2017Deep Regression Forests for Age Estimationcited by 35
  9. 2022Unimodal-Concentrated Loss: Fully Adaptive Label Distribution Learning for Ordinal Regressioncited by 23
  10. 2023ConR: Contrastive Regularizer for Deep Imbalanced Regressioncited by 19
  11. 2022Scalable Penalized Regression for Noise Detection in Learning with Noisy Labelscited by 15
  12. 2025CLOC: Contrastive Learning for Ordinal Classification with Multi-Margin N-pair Losscited by 11
  13. 2019Robust Deep Ordinal Regression Under Label Noisecited by 7
  14. 2025Sample Selection via Contrastive Fragmentation for Noisy Label Regressioncited by 4

Built on by

Not cited yet.