{"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/deep-learning-without-poor-local-minima","title":"Deep Learning without Poor Local Minima","arxiv_id":"1605.07110","date":"2016-05-23","proceeding":"NeurIPS 2016 12","authors":["Kenji Kawaguchi"],"abstract":"In this paper, we prove a conjecture published in 1989 and also partially\naddress an open problem announced at the Conference on Learning Theory (COLT)\n2015. With no unrealistic assumption, we first prove the following statements\nfor the squared loss function of deep linear neural networks with any depth and\nany widths: 1) the function is non-convex and non-concave, 2) every local\nminimum is a global minimum, 3) every critical point that is not a global\nminimum is a saddle point, and 4) there exist \"bad\" saddle points (where the\nHessian has no negative eigenvalue) for the deeper networks (with more than\nthree layers), whereas there is no bad saddle point for the shallow networks\n(with three layers). Moreover, for deep nonlinear neural networks, we prove the\nsame four statements via a reduction to a deep linear model under the\nindependence assumption adopted from recent work. As a result, we present an\ninstance, for which we can answer the following question: how difficult is it\nto directly train a deep model in theory? It is more difficult than the\nclassical machine learning models (because of the non-convexity), but not too\ndifficult (because of the nonexistence of poor local minima). Furthermore, the\nmathematically proven existence of bad saddle points for deeper models would\nsuggest a possible open problem. We note that even though we have advanced the\ntheoretical foundations of deep learning and non-convex optimization, there is\nstill a gap between theory and practice.","url_abs":"http://arxiv.org/abs/1605.07110v3","url_pdf":"http://arxiv.org/pdf/1605.07110v3.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":"deep-learning-without-poor-local-minima","repo_url":"https://github.com/yijiazh/DFER_Summer2019","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"learning-theory","task_name":"Learning Theory"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1605.07110","atlas_url":"https://app.syntology.ai/?focus=1605.07110","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":"1605.07110"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1605.07110\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1605.07110"},"call":"get_concepts_for_paper(arxiv_id=\"1605.07110\")"}],"by_repo":[{"repo":"yijiazh/DFER_Summer2019","kind":"listed","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":"f663de9b6ca7e6a1ee1c7a3ee34ff7e622a8c7008fcaa6dcafe0d5735a7e6158","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}