{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/arda-automatic-relational-data-augmentation","title":"ARDA: Automatic Relational Data Augmentation for Machine Learning","arxiv_id":"2003.09758","date":"2020-03-21","proceeding":null,"authors":["Nadiia Chepurko","Ryan Marcus","Emanuel Zgraggen","Raul Castro Fernandez","Tim Kraska","David Karger"],"abstract":"Automatic machine learning (\\AML) is a family of techniques to automate the process of training predictive models, aiming to both improve performance and make machine learning more accessible. While many recent works have focused on aspects of the machine learning pipeline like model selection, hyperparameter tuning, and feature selection, relatively few works have focused on automatic data augmentation. Automatic data augmentation involves finding new features relevant to the user's predictive task with minimal ``human-in-the-loop'' involvement. We present \\system, an end-to-end system that takes as input a dataset and a data repository, and outputs an augmented data set such that training a predictive model on this augmented dataset results in improved performance. Our system has two distinct components: (1) a framework to search and join data with the input data, based on various attributes of the input, and (2) an efficient feature selection algorithm that prunes out noisy or irrelevant features from the resulting join. We perform an extensive empirical evaluation of different system components and benchmark our feature selection algorithm on real-world datasets.","url_abs":"https://arxiv.org/abs/2003.09758v1","url_pdf":"https://arxiv.org/pdf/2003.09758v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"arda-automatic-relational-data-augmentation","repo_url":"https://github.com/luh-dbs/mate","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"model-selection","task_name":"Model Selection"},{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[{"method_slug":"feature-selection","method_name":"Feature Selection"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2003.09758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09758"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/luh-dbs/mate","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"listed":{"samples":4,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"ced874eaf0156c73","entry":"XASH","repo":"luh-dbs/mate","repo_kind":"listed","path":"src/index_generation.py","file_url":"https://github.com/luh-dbs/mate/blob/HEAD/src/index_generation.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ced874eaf0156c73"}},{"code_sha256_prefix":"23d3bc434070d1d7","entry":"get_cleaned_text","repo":"luh-dbs/mate","repo_kind":"listed","path":"src/base.py","file_url":"https://github.com/luh-dbs/mate/blob/HEAD/src/base.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"23d3bc434070d1d7"}},{"code_sha256_prefix":"c040f8231e5068e5","entry":"get_dataset","repo":"luh-dbs/mate","repo_kind":"listed","path":"src/base.py","file_url":"https://github.com/luh-dbs/mate/blob/HEAD/src/base.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c040f8231e5068e5"}},{"code_sha256_prefix":"80bf46e687a6b3ae","entry":"get_dataset_with_path","repo":"luh-dbs/mate","repo_kind":"listed","path":"src/base.py","file_url":"https://github.com/luh-dbs/mate/blob/HEAD/src/base.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"80bf46e687a6b3ae"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}