{"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/wide-minima-density-hypothesis-and-the","title":"Wide-minima Density Hypothesis and the Explore-Exploit Learning Rate Schedule","arxiv_id":"2003.03977","date":"2020-03-09","proceeding":null,"authors":["Nikhil Iyer","V Thejas","Nipun Kwatra","Ramachandran Ramjee","Muthian Sivathanu"],"abstract":"Several papers argue that wide minima generalize better than narrow minima. In this paper, through detailed experiments that not only corroborate the generalization properties of wide minima, we also provide empirical evidence for a new hypothesis that the density of wide minima is likely lower than the density of narrow minima. Further, motivated by this hypothesis, we design a novel explore-exploit learning rate schedule. On a variety of image and natural language datasets, compared to their original hand-tuned learning rate baselines, we show that our explore-exploit schedule can result in either up to 0.84% higher absolute accuracy using the original training budget or up to 57% reduced training time while achieving the original reported accuracy. For example, we achieve state-of-the-art (SOTA) accuracy for IWSLT'14 (DE-EN) dataset by just modifying the learning rate schedule of a high performing model.","url_abs":"https://arxiv.org/abs/2003.03977v5","url_pdf":"https://arxiv.org/pdf/2003.03977v5.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":"wide-minima-density-hypothesis-and-the","repo_url":"https://github.com/nikhil-iyer-97/wide-minima-density-hypothesis","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"wide-minima-density-hypothesis-and-the","repo_url":"https://github.com/HA-Transformer/HA-Transformer","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"wide-minima-density-hypothesis-and-the","repo_url":"https://github.com/MindCode-4/code-13/tree/main/wide-minima-density-hypothesis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"wide-minima-density-hypothesis-and-the","repo_url":"https://github.com/MindCode-4/code-9/tree/main/wide-minima-density-hypothesis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"wide-minima-density-hypothesis-and-the","repo_url":"https://github.com/pwc-1/Paper-9/tree/main/4/wide-minima-density-hypothesis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"de-en","task_name":"de-en"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/machine-translation-on-iwslt2014-german","task":"Machine Translation","dataset":"IWSLT2014 German-English","model":"Cutoff+Knee","rank_in_archive_order":8,"of":34,"metrics":{"BLEU score":"37.78"},"uses_additional_data":false},{"leaderboard":"/sota/machine-translation-on-wmt2014-german-english","task":"Machine Translation","dataset":"WMT2014 German-English","model":"MAT+Knee","rank_in_archive_order":6,"of":16,"metrics":{"BLEU score":"31.9"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2003.03977","atlas_url":"https://app.syntology.ai/?focus=2003.03977","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2003.03977"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2003.03977\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2003.03977"},"call":"get_concepts_for_paper(arxiv_id=\"2003.03977\")"}],"by_repo":[{"repo":"nikhil-iyer-97/wide-minima-density-hypothesis","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"HA-Transformer/HA-Transformer","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.10270"],"harvested_for_calls":[{"arxiv_id":"2006.10270","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.10270"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.10270\")"}]},{"repo":"MindCode-4/code-13","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2212.08663"],"harvested_for_calls":[{"arxiv_id":"2212.08663","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.08663"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.08663\")"}]},{"repo":"MindCode-4/code-9","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.09609"],"harvested_for_calls":[{"arxiv_id":"2210.09609","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.09609"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.09609\")"}]},{"repo":"pwc-1/Paper-9","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.13719"],"harvested_for_calls":[{"arxiv_id":"1909.13719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.13719"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.13719\")"}]}],"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":"dee83b099dba3584689a7a70db0a91431f7388127c650ab9171a1fc7dd2d2ce4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}