{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/easy-over-hard-a-case-study-on-deep-learning","title":"Easy over Hard: A Case Study on Deep Learning","arxiv_id":"1703.00133","date":"2017-03-01","proceeding":null,"authors":["Wei Fu","Tim Menzies"],"abstract":"While deep learning is an exciting new technique, the benefits of this method\nneed to be assessed with respect to its computational cost. This is\nparticularly important for deep learning since these learners need hours (to\nweeks) to train the model. Such long training time limits the ability of (a)~a\nresearcher to test the stability of their conclusion via repeated runs with\ndifferent random seeds; and (b)~other researchers to repeat, improve, or even\nrefute that original work.\n  For example, recently, deep learning was used to find which questions in the\nStack Overflow programmer discussion forum can be linked together. That deep\nlearning system took 14 hours to execute. We show here that applying a very\nsimple optimizer called DE to fine tune SVM, it can achieve similar (and\nsometimes better) results. The DE approach terminated in 10 minutes; i.e. 84\ntimes faster hours than deep learning method.\n  We offer these results as a cautionary tale to the software analytics\ncommunity and suggest that not every new innovation should be applied without\ncritical analysis. If researchers deploy some new and expensive process, that\nwork should be baselined against some simpler and faster alternatives.","url_abs":"http://arxiv.org/abs/1703.00133v2","url_pdf":"http://arxiv.org/pdf/1703.00133v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"easy-over-hard-a-case-study-on-deep-learning","repo_url":"https://github.com/WeiFoo/EasyOverHard","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[{"method_slug":"svm","method_name":"SVM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"WeiFoo/EasyOverHard","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d4dbb5e974b3105f4269a86a09233395f79eb42c9bc527579f1162f6d6f2ec00","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}