Matryoshka: Uncovering Relevant Features in Data Lakes to Enhance Machine Learning Applications
BIFOLD & TU Berlin · UC San Diego · University of Edinburgh
Abstract
Data coverage and completeness are crucial prerequisites for machine learning (ML) applications. Data discovery allows retrieving relevant features from unstructured data lakes to augment the training data. However, existing methods either target only individual ML tasks, decouple table retrieval from feature selection, or neglect inter-feature relationships, resulting in redundant, high-dimensional data. In this paper, we introduce Matryoshka, a holistic system that discovers and selects relevant features from data lakes for downstream ML applications. Matryoshka replaces costly join materialization with compact Gram matrix sketches and performs feature selection via incrementally fitted linear proxy models with correlation-based pruning, yielding redundancy-free feature sets for regression and classification. Matryoshka improves downstream prediction quality by 19.3% on average while achieving the lowest geometric mean runtime and up to 120x faster execution on join-intensive workloads.
14 pages, 771 KB. The paper is typeset in two columns, so on a small screen it reads best in landscape or in your phone's PDF viewer after downloading.
Citation
@article{matryoshka2026,
title = {Matryoshka: Uncovering Relevant Features in Data Lakes
to Enhance Machine Learning Applications},
author = {Turchenko, Fedor and Zhang, Runjie and Chen, Binger and
Boehm, Matthias and Salimi, Babak and Shaikhha, Amir and
Abedjan, Ziawasch},
journal = {Proceedings of the VLDB Endowment},
volume = {19},
number = {11},
pages = {3704--3717},
year = {2026},
doi = {10.14778/3836663.3836719}
}