aiqbench analysis
This paper addresses a critical flaw in evaluating machine learning models on biochemical datasets by introducing Refnd, an algorithm designed to prevent data leakage caused by ignoring relational structures. By leveraging Hierarchical Navigable Small World (HNSW) graphs for loglinear-time computation, the method provides more realistic performance estimates compared to traditional splitting techniques that fail at scale. The tool is particularly relevant for researchers working with protein sequences, small molecules, and nucleotide data where structural relationships are inherent.
Refnd: Preventing Data Leakage in Relational Datasets
arXiv:2607.19376v1 Announce Type: cross Abstract: 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.
Abstract: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.
Quantitative Methods (q-bio.QM); Machine Learning (cs.LG)
arXiv:2607.19376 [q-bio.QM]
(or arXiv:2607.19376v1 [q-bio.QM] for this version)
https://doi.org/10.48550/arXiv.2607.19376 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 227 words
Related coverage

Research Note: Filtering Subversion-Relevant Information From Pretraining Data Is Feasible
LessWrong · Oct 5, 2026
A Leakage-Free Stacked Ensemble Method for Multiclass Classification
arXiv · Jul 28, 2026

Projection sampling preserves capabilities but diminishes gains from alignment fine-tuning
LessWrong · Oct 16, 2026

Responsible AI: Governance, Principles, and Practical Guide
Databricks · Jul 17, 2026