arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.06408cs.LG
收藏

利用张量补全实现数据科学流水线自动化

Automating Data Science Pipelines with Tensor Completion

UC Riverside(加州大学河滨分校);San Diego Mesa Community College(圣地亚哥梅萨社区学院);Cal Poly Pomona(加州州立理工大学波莫纳分校)

Shaan Pakala, Bryce Graw, Dawon Ahn, Tam Dinh, Mehnaz Tabassum Mahin, Vassilis Tsotras, Jia Chen, Evangelos E. Papalexakis

AI总结:

针对数据科学流水线中超参数优化等操作耗资源的问题,将其建模为张量补全问题,改进现有技术并提出集成方法,在多类场景验证有效性,同时发布数据集与代码供后续研究使用。

摘要:

超参数优化是众多数据科学流水线中的核心组成部分,为了探索组合搜索空间,通常需要进行耗时极长、消耗大量资源的计算。与该问题类似,数据科学流水线中的其他关键操作也具备完全相同的特性。典型例子包括:神经架构搜索(目标是为神经网络确定最优设计选择),以及查询基数估计(给定SQL查询的不同谓词值,目标是估计输出结果的规模)。\n本文将数据科学流水线的这些核心组件抽象出来,将其建模为张量补全问题的实例:搜索空间的每个变量对应张量的一个维度,目标是从极少的已观测条目样本出发,补全张量中所有缺失的条目——这些缺失条目对应变量值的所有组合。\n为此,我们首先对现有最先进的张量补全技术开展了全面的实验评估,同时引入了受领域特性启发的适配改进(例如离散化变量空间上的平滑性),以及一种能达到最先进性能的集成技术。我们在对应三类场景生成的多个数据集上,对现有方法和本文提出的方法进行了广泛评估,三类场景分别是:(a) 非神经网络模型的超参数优化、(b) 神经架构搜索、(c) 查询基数估计的各类变体,实验证明了张量补全作为数据科学流水线自动化工具的有效性。此外,我们公开发布了生成的数据集与代码,为该主题的后续研究提供基准。

英文摘要:

Hyperparameter optimization is an essential component in many data science pipelines and typically entails exhaustive time and resource-consuming computations in order to explore the combinatorial search space. Similar to this problem, other key operations in data science pipelines exhibit the exact same properties. Important examples are: neural architecture search, where the goal is to identify the best design choices for a neural network, and query cardinality estimation, where given different predicate values for a SQL query the goal is to estimate the size of the output. In this paper, we abstract away those essential components of data science pipelines and we model them as instances of tensor completion, where each variable of the search space corresponds to one mode of the tensor, and the goal is to identify all missing entries of the tensor, corresponding to all combinations of variable values, starting from a very small sample of observed entries. In order to do so, we first conduct a thorough experimental evaluation of existing state-of-the-art tensor completion techniques and introduce domain-inspired adaptations (such as smoothness across the discretized variable space) and an ensemble technique which is able to achieve state-of-the-art performance. We extensively evaluate existing and proposed methods in a number of datasets generated corresponding to (a) hyperparameter optimization for non-neural network models, (b) neural architecture search, and (c) variants of query cardinality estimation, demonstrating the effectiveness of tensor completion as a tool for automating data science pipelines. Furthermore, we release our generated datasets and code in order to provide benchmarks for future work on this topic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑