Towards Efficient Data Wrangling with LLMs using Code Generation
Open Access
- 9 June 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 62-66
Abstract
While LLM-based data wrangling approaches that process each row of data have shown promising benchmark results, computational costs still limit their suitability for real-world use cases on large datasets. We revisit code generation using LLMs for various data wrangling tasks, which show promising results particularly for data transformation tasks (up to 37.2 points improvement on F1 score) at much lower computational costs. We furthermore identify shortcomings of code generation methods especially for semantically challenging tasks, and consequently propose an approach that combines program generation with a routing mechanism using LLMs.Keywords
This publication has 9 references indexed in Scilit:
- Data Extraction via Semantic Regular Expression SynthesisProceedings of the ACM on Programming Languages, 2023
- FlashFill++: Scaling Programming by Example by Cutting to the ChaseProceedings of the ACM on Programming Languages, 2023
- Can Foundation Models Wrangle Your Data?Proceedings of the VLDB Endowment, 2022
- Jigsaw2022
- Semantic programming by example with pre-trained modelsProceedings of the ACM on Programming Languages, 2021
- Confident Learning: Estimating Uncertainty in Dataset LabelsJournal of Artificial Intelligence Research, 2021
- TrinityProceedings of the VLDB Endowment, 2019
- HoloDetect2019
- Transform-data-by-example (TDE)Proceedings of the VLDB Endowment, 2018