Irredundant k-Fold Cross-Validation

Jesus S. Aguilar-Ruiz
7/26/2025
cs.LGcs.AIstat.ME

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

In traditional k-fold cross-validation, each instance is used ($k-1$) times for training and once for testing, leading to redundancy that lets many instances disproportionately influence the learning phase. We introduce Irredundant $k$-fold cross-validation, a novel method that guarantees each instance is used exactly once for training and once for testing across the entire validation procedure. This approach ensures a more balanced utilization of the dataset, mitigates overfitting due to instance repetition, and enables sharper distinctions in comparative model analysis. The method preserves stratification and remains model-agnostic, i.e., compatible with any classifier. Experimental results demonstrate that it delivers consistent performance estimates across diverse datasets -- comparable to $k$-fold cross-validation -- while providing less optimistic variance estimates because training partitions are non-overlapping, and significantly reducing the overall computational cost.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{aguilarruiz2025irredundant,
  title  = {Irredundant k-Fold Cross-Validation},
  author = {Jesus S. Aguilar-Ruiz},
  year   = {2025},
  eprint = {2507.20048},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.20048v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.20048.svg)](https://codeofpaper.com/paper/2507.20048)

Discussion