Refnd: Preventing Data Leakage in Relational Datasets
Not on the map. Why?
Abstract (arXiv)
Machine learning models trained on biochemical data are routinely evaluated using splits that fail to account for relational structure, causing information leakage and over-optimistic performance estimates. Existing splitting methods lack theoretical grounding and scale at best quadratically. We introduce the Relational Generative Process (RGP), a mathematical formalization explaining why relational structure arises in biochemical datasets, and Refnd, a splitting algorithm that leverages a proximity graph computed in loglinear time using Hierarchical Navigable Small World (HNSW). We validate on an antimicrobial peptide dataset, showing that Refnd splits yield lower but more realistic evaluation performance than traditional splits. Refnd is applicable to any dataset arising from an RGP such as protein sequences and structures, small molecules, and nucleotide sequences, and is openly available as a Rust accelerated Python package: pip install refnd.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 29 references that are in the map. First posted on arXiv 30 Jun 2026.
Builds on
6 of 29 references.
References · 6
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,051
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 385
- 2023Lo-Hi: Practical ML Drug Discovery Benchmarkcited by 10
- 2024SpanSeq: Similarity-based sequence data splitting method for improved development and assessment of deep learning projectscited by 5
Built on by
Not cited yet.