{"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/exponentially-vanishing-sub-optimal-local","title":"Exponentially vanishing sub-optimal local minima in multilayer neural networks","arxiv_id":"1702.05777","date":"2017-02-19","proceeding":"ICLR 2018 1","authors":["Daniel Soudry","Elad Hoffer"],"abstract":"Background: Statistical mechanics results (Dauphin et al. (2014); Choromanska\net al. (2015)) suggest that local minima with high error are exponentially rare\nin high dimensions. However, to prove low error guarantees for Multilayer\nNeural Networks (MNNs), previous works so far required either a heavily\nmodified MNN model or training method, strong assumptions on the labels (e.g.,\n\"near\" linear separability), or an unrealistic hidden layer with\n$\\Omega\\left(N\\right)$ units.\n  Results: We examine a MNN with one hidden layer of piecewise linear units, a\nsingle output, and a quadratic loss. We prove that, with high probability in\nthe limit of $N\\rightarrow\\infty$ datapoints, the volume of differentiable\nregions of the empiric loss containing sub-optimal differentiable local minima\nis exponentially vanishing in comparison with the same volume of global minima,\ngiven standard normal input of dimension\n$d_{0}=\\tilde{\\Omega}\\left(\\sqrt{N}\\right)$, and a more realistic number of\n$d_{1}=\\tilde{\\Omega}\\left(N/d_{0}\\right)$ hidden units. We demonstrate our\nresults numerically: for example, $0\\%$ binary classification training error on\nCIFAR with only $N/d_{0}\\approx 16$ hidden neurons.","url_abs":"http://arxiv.org/abs/1702.05777v5","url_pdf":"http://arxiv.org/pdf/1702.05777v5.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":"exponentially-vanishing-sub-optimal-local","repo_url":"https://github.com/MNNsMinima/Paper","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"gone","observed_at":"2026-09-18","how":"tree_404+repo_404"}}],"tasks":[{"task_slug":"binary-classification","task_name":"Binary Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.05777","atlas_url":"https://app.syntology.ai/?focus=1702.05777","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":"1702.05777"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.05777\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.05777"},"call":"get_concepts_for_paper(arxiv_id=\"1702.05777\")"}],"by_repo":[{"repo":"MNNsMinima/Paper","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":"65d11e887b81093cc9fcdddeda26ee7ecb180ef98c88f4aec78db2f06216d358","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}