3.8 Proceedings Paper

Easy over Hard: A Case Study on Deep Learning

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.1145/3106237.3106256

关键词

Search based software engineering; software analytics; parameter tuning; data analytics for software engineering; deep learning; SVM; differential evolution

资金

  1. NSF [1302169]
  2. Division of Computing and Communication Foundations
  3. Direct For Computer & Info Scie & Enginr [1302169] Funding Source: National Science Foundation

向作者/读者索取更多资源

While deep learning is an exciting new technique, the benefits of this method need to be assessed with respect to its computational cost. This is particularly important for deep learning since these learners need hours (to weeks) to train the model. Such long training time limits the ability of (a) a researcher to test the stability of their conclusion via repeated runs with different random seeds; and (b) other researchers to repeat, improve, or even refute that original work. For example, recently, deep learning was used to find which questions in the Stack Overflow programmer discussion forum can be linked together. That deep learning system took 14 hours to execute. We show here that applying a very simple optimizer called DE to fine tune SVM, it can achieve similar (and sometimes better) results. The DE approach terminated in 10 minutes; i.e. 84 times faster hours than deep learning method. We offer these results as a cautionary tale to the software analytics community and suggest that not every new innovation should be applied without critical analysis. If researchers deploy some new and expensive process, that work should be baselined against some simpler and faster alternatives.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据