Easy over hard: a case study on deep learning
By Wei Fu, Tim Menzies. 2017
209 citations recorded by the source corpus.
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.
Subfields: Artificial Intelligence, Information Systems, Software, Scaling & Learning Theory
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Miltiadis Allamanis
- Charles Sutton
- Earl T. Barr
- Premkumar T. Devanbu
- Yang Liu
- Ahmed E. Hassan
- Ken-ichi Matsumoto
- Mark Harman
In Information Systems
- Charles Sutton
- Miltiadis Allamanis
- Earl T. Barr
- Premkumar T. Devanbu
- Chakkrit Kla Tantithamthavorn
- Ken-ichi Matsumoto
- Ahmed E. Hassan
- Shane McIntosh
In Software
- Charles Sutton
- Miltiadis Allamanis
- Earl T. Barr
- Premkumar T. Devanbu
- Chakkrit Kla Tantithamthavorn
- Ken-ichi Matsumoto
- Ahmed E. Hassan
- Shane McIntosh
In Scaling & Learning Theory
Citations in the corpus
- A Survey of Machine Learning for Big Code and Naturalness (2017, background): “, when the problem is deterministic), and, in other cases, simple models can outperform advanced, off-the-self deep-learning methods, designed for non-code domains [65, 84].”
- The Impact of Automated Parameter Optimization on Defect Prediction Models (2018, background): “[33] tune the parameter settings of deep learning for software engineering.”
- Machine Learning Testing: Survey, Landscapes and Horizons (2019, result): “Fu and Menzies [235] compared deep learning and classic learning on the task of linking Stack Overflow questions, and found that classic learning algorithms (such as refined SVM) could achieve similar (and sometimes better) results at a lower cost.”