{"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/the-neural-hype-and-comparisons-against-weak","title":"The Neural Hype and Comparisons Against Weak Baselines","arxiv_id":null,"date":"2018-12-01","proceeding":"ACM SIGIR Forum, Volume 52 Issue 2 2018 12","authors":["Jimmy Lin"],"abstract":"Recently, the machine learning community paused in a moment of self-reflection. In a widely discussed paper at ICLR 2018, Sculley et al. wrote: \"We observe that the rate of empirical advancement may not have been matched by consistent increase in the level of empirical rigor across the field as a whole.\" Their primary complaint is the development of a \"research and publication culture that emphasizes wins\" (emphasis in original), which typically means \"demonstrating that a new method beats previous methods on a given task or benchmark\". An apt description might be \"leaderboard chasing\"-and for many vision and NLP tasks, this isn't a metaphor. There are literally centralized leaderboards1 that track incremental progress, down to the fifth decimal point, some persisting over years, accumulating dozens of entries.\r\n\r\nSculley et al. remind us that \"the goal of science is not wins, but knowledge\". The structure of the scientific enterprise today (pressure to publish, pace of progress, etc.) means that \"winning\" and \"doing good science\" are often not fully aligned. To wit, they cite a number of papers showing that recent advances in neural networks could very well be attributed to mundane issues like better hyperparameter optimization. Many results can't be reproduced, and some observed improvements might just be noise.","url_abs":"https://dl.acm.org/citation.cfm?id=3308781","url_pdf":"http://sigir.org/wp-content/uploads/2019/01/p040.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":"the-neural-hype-and-comparisons-against-weak","repo_url":"https://github.com/castorini/Anserini","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"ad-hoc-information-retrieval","task_name":"Ad-Hoc Information Retrieval"},{"task_slug":"culture","task_name":"Cultural Vocal Bursts Intensity Prediction"},{"task_slug":"hyperparameter-optimization","task_name":"Hyperparameter Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/ad-hoc-information-retrieval-on-trec-robust04","task":"Ad-Hoc Information Retrieval","dataset":"TREC Robust04","model":"Anserini BM25+RM3","rank_in_archive_order":18,"of":21,"metrics":{"MAP":"0.302","P@20":"0.4012"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"castorini/Anserini","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2404.18812"],"harvested_for_calls":[{"arxiv_id":"2404.18812","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2404.18812"},"call":"get_harvested_code_for_paper(arxiv_id=\"2404.18812\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"47d282737a8c2ede1bb4c56f19d0e386f59b8cd81e60ee2a73e321656d90ecc8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}