arXiv Machine Learning

Rank-Variance Scores for Importance Sampling and Data Pruning under Label Contamination

The paper introduces Rank‑Variance Scores (TRV) as a new metric for importance sampling and data pruning in the presence of label contamination. It shows that traditional loss‑based methods fail because corrupted examples often have high loss, and proves that a useful score must be non‑monotonic in loss. By ranking examples across multiple independently trained proxy models, TRV captures both between‑proxy disagreement and within‑proxy variance, enabling Disagreement‑Regularized Importance Sampling (DR‑IS) and TRV‑based pruning to outperform random selection on noisy CIFAR‑10/100 datasets.

arXiv Computation and Language
Sep 4

Contamination Inflates Scores but Rarely Reorders Large Language Model Leaderboards

The paper investigates how benchmark contamination—leakage of test items into training data—affects large language model (LLM) leaderboards. By comparing original test items with semantically equivalent paraphrases, the authors measure contamination as a violation of anchor-item invariance and find that it inflates absolute scores but rarely changes model rankings. Across 47 public models and 74 finetuned models on four benchmarks, the rank correlation between standard and paraphrase-controlled leaderboards is 0.997, with only a handful of cases showing differential contamination that could alter rankings.

By Xingyao Xiao (Stanford University), Yihong Cheng (City University of Macau)
arXiv Machine Learning
Oct 16

Hard Way, The Only Way: Provable Merits of Training on Hardest Examples

The paper presents a high‑dimensional theory of learning with data pruning via weighted empirical risk minimization. It analyzes pruning along a one‑dimensional subspace and derives limiting test‑error curves as input dimension and sample size grow with a fixed ratio. The authors show that, in the high‑sample regime, the optimal strategy is to keep only the 2N hardest examples, achieving a Bayes‑optimal error scaling of order N/P instead of the usual sqrt(N/P).

By Elvis Dohmatob
Hugging Face Trending Papers
Jul 27

A Model for Imbalanced Label Aggregation: A Focus on Minority-Class Detection

We study imbalanced crowdsourcing with a focus on class-dependent annotator accuracy, a setting that, to the best of our knowledge, remains relatively underexplored despite its importance in real-world inspection systems where the labels of greatest operational importance are also the rarest ones. In this setting, annotators may be reliable on both classes, unreliable on both classes, majority-class specialists, or minority-class specialists.

arXiv Machine Learning
Jul 28

A Model for Imbalanced Label Aggregation: A Focus on Minority-Class Detection

arXiv:2607. 24622v1 Announce Type: cross Abstract: We study imbalanced crowdsourcing with a focus on class-dependent annotator accuracy, a setting that, to the best of our knowledge, remains relatively underexplored despite its importance in real-world inspection systems where the labels of greatest operational importance are also the rarest ones.

By Gabriel Singer, Samuel Gruffaz, Olivier Vo Van, Nicolas Vayatis, Argyris Kalogeratos
arXiv AI
Sep 25

Baszta: Data-Centric Fine-Tuning of a Polish Multi-Label Safety Classifier

The paper presents Baszta, a Polish multi‑label content‑safety classifier trained by fine‑tuning the 124M‑parameter allegro/herbert‑base‑cased model on five categories (hate, vulgarity, sexual content, crime, self‑harm) using a Focal + R‑Drop objective. In out‑of‑distribution evaluation on the Gadzi Język benchmark, Baszta achieves a small but statistically significant improvement in micro‑F1 over the Bielik Guard system, though the macro‑F1 advantage disappears when both models are properly tuned. The study also explores calibration techniques, showing that per‑category temperature scaling can recover performance lost by Platt scaling or isotonic regression, and discusses the trade‑offs between robust calibration and adversarial recall.

By Adam G\'orski, Mateusz J\k{a}kalak, Rafa{\l} Jakubowski
arXiv Machine Learning
Oct 19

The Optimal Ranking Tradeoffs Between Two Ranking Scores in Two-Class Classification

The paper investigates how to combine two commonly used classification performance metrics into a single ranking that balances them optimally. It shows that all such metrics can be expressed as ranking scores parameterized by the relative importance of true/false positives and negatives, and derives an exact analytical solution for the optimal tradeoff between any pair of these scores when class priors are equal. The authors also explore experimentally how the solution behaves when performance follows certain distributions with fixed priors.

By S\'ebastien Pi\'erard, Adrien Deli\`ege, Marc Van Droogenbroeck