Pith. sign in

REVIEW 1 cited by

SPlit: An Optimal Method for Data Splitting

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.10945 v2 pith:BJP7KZZI submitted 2020-12-20 stat.ML cs.LG

classification stat.MLcs.LG
keywords splitmethodoptimalsplittingdatasetpointstestingadapt
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this article we propose an optimal method referred to as SPlit for splitting a dataset into training and testing sets. SPlit is based on the method of Support Points (SP), which was initially developed for finding the optimal representative points of a continuous distribution. We adapt SP for subsampling from a dataset using a sequential nearest neighbor algorithm. We also extend SP to deal with categorical variables so that SPlit can be applied to both regression and classification problems. The implementation of SPlit on real datasets shows substantial improvement in the worst-case testing performance for several modeling methods compared to the commonly used random splitting procedure.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CaTE Data Curation for Trustworthy AI

    cs.LG 2025-08 accept novelty 4.0 of 10

    A synthesis of data curation practices for trustworthy AI, framed around an actionable definition of trustworthiness and a decision tree.

Pith tools