{"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/an-analytical-formula-of-population-gradient","title":"An Analytical Formula of Population Gradient for two-layered ReLU network and its Applications in Convergence and Critical Point Analysis","arxiv_id":"1703.00560","date":"2017-03-02","proceeding":"ICML 2017 8","authors":["Yuandong Tian"],"abstract":"In this paper, we explore theoretical properties of training a two-layered\nReLU network $g(\\mathbf{x}; \\mathbf{w}) = \\sum_{j=1}^K\n\\sigma(\\mathbf{w}_j^T\\mathbf{x})$ with centered $d$-dimensional spherical\nGaussian input $\\mathbf{x}$ ($\\sigma$=ReLU). We train our network with gradient\ndescent on $\\mathbf{w}$ to mimic the output of a teacher network with the same\narchitecture and fixed parameters $\\mathbf{w}^*$. We show that its population\ngradient has an analytical formula, leading to interesting theoretical analysis\nof critical points and convergence behaviors. First, we prove that critical\npoints outside the hyperplane spanned by the teacher parameters\n(\"out-of-plane\") are not isolated and form manifolds, and characterize in-plane\ncritical-point-free regions for two ReLU case. On the other hand, convergence\nto $\\mathbf{w}^*$ for one ReLU node is guaranteed with at least\n$(1-\\epsilon)/2$ probability, if weights are initialized randomly with standard\ndeviation upper-bounded by $O(\\epsilon/\\sqrt{d})$, consistent with empirical\npractice. For network with many ReLU nodes, we prove that an infinitesimal\nperturbation of weight initialization results in convergence towards\n$\\mathbf{w}^*$ (or its permutation), a phenomenon known as spontaneous\nsymmetric-breaking (SSB) in physics. We assume no independence of ReLU\nactivations. Simulation verifies our findings.","url_abs":"http://arxiv.org/abs/1703.00560v2","url_pdf":"http://arxiv.org/pdf/1703.00560v2.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":"an-analytical-formula-of-population-gradient","repo_url":"https://github.com/yuandong-tian/ICML17_ReLU","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"an-analytical-formula-of-population-gradient","repo_url":"https://github.com/MindSpore-scientific/code-14/tree/main/Two-Layer-ReLU-Network-Analytically","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[],"methods":[{"method_slug":"relu","method_name":"ReLU"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.00560","atlas_url":"https://app.syntology.ai/?focus=1703.00560","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":"1703.00560"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.00560\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.00560"},"call":"get_concepts_for_paper(arxiv_id=\"1703.00560\")"}],"by_repo":[{"repo":"yuandong-tian/ICML17_ReLU","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-scientific/code-14","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2306.01116"],"harvested_for_calls":[{"arxiv_id":"2306.01116","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.01116"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.01116\")"}]}],"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":"c6d237547d1540ffcb072ba9f2be6f7ca51e2ec9ddaac5d16c51f785dfa6a7f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}