arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.09373cs.SEcs.AIcs.PL
收藏

基于搜索的机器学习程序代码生成

Search Based Code Generation for Machine Learning Programs

Information Technology University of the Punjab(旁遮普信息技术大学);LUMS School of Science and Engineering(拉合尔管理科学大学科学与工程学院)

Muhammad Zubair Malik, Muhammad Nawaz, Nimrah Mustafa, Junaid Haroon Siddiqui

摘要:

机器学习(ML)已经改变了生活的每个领域,因为它提供了强大的工具来构建复杂的系统,从经验和数据中学习和改进。我们的关键见解是,为了解决机器学习问题,数据科学家并不是每次都发明一种新算法,而是评估一系列具有不同配置的现有模型,并选择最佳模型。这个任务很费力,容易出错,并且消耗了大量的项目预算和时间。在本文中,我们提出了一个新的框架,灵感来自草图和部分评估编程,以最大限度地减少开发ML解决方案时的人为干预。我们将机器学习算法模板化,以将配置选择暴露为待搜索的漏洞。我们在不同的算法之间共享代码和计算,并且根据从初始算法评估中获得的信息仅部分地评估算法的配置空间。我们还采用层次和启发式的修剪,以减少搜索空间。我们的初步研究结果表明,我们的方法可以生成高度准确的ML模型。对数据科学家的采访表明,他们认为我们的框架可以消除常见错误的来源,并显着减少开发时间。

英文摘要:

Machine Learning (ML) has revamped every domain of life as it provides powerful tools to build complex systems that learn and improve from experience and data. Our key insight is that to solve a machine learning problem, data scientists do not invent a new algorithm each time, but evaluate a range of existing models with different configurations and select the best one. This task is laborious, error-prone, and drains a large chunk of project budget and time. In this paper we present a novel framework inspired by programming by Sketching and Partial Evaluation to minimize human intervention in developing ML solutions. We templatize machine learning algorithms to expose configuration choices as holes to be searched. We share code and computation between different algorithms, and only partially evaluate configuration space of algorithms based on information gained from initial algorithm evaluations. We also employ hierarchical and heuristic based pruning to reduce the search space. Our initial findings indicate that our approach can generate highly accurate ML models. Interviews with data scientists show that they feel our framework can eliminate sources of common errors and significantly reduce development time.

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

↑