{"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/is-deeper-better-only-when-shallow-is-good","title":"Is Deeper Better only when Shallow is Good?","arxiv_id":"1903.03488","date":"2019-03-08","proceeding":"NeurIPS 2019 12","authors":["Eran Malach","Shai Shalev-Shwartz"],"abstract":"Understanding the power of depth in feed-forward neural networks is an\nongoing challenge in the field of deep learning theory. While current works\naccount for the importance of depth for the expressive power of\nneural-networks, it remains an open question whether these benefits are\nexploited during a gradient-based optimization process. In this work we explore\nthe relation between expressivity properties of deep networks and the ability\nto train them efficiently using gradient-based algorithms. We give a depth\nseparation argument for distributions with fractal structure, showing that they\ncan be expressed efficiently by deep networks, but not with shallow ones. These\ndistributions have a natural coarse-to-fine structure, and we show that the\nbalance between the coarse and fine details has a crucial effect on whether the\noptimization process is likely to succeed. We prove that when the distribution\nis concentrated on the fine details, gradient-based algorithms are likely to\nfail. Using this result we prove that, at least in some distributions, the\nsuccess of learning deep networks depends on whether the distribution can be\nwell approximated by shallower networks, and we conjecture that this property\nholds in general.","url_abs":"http://arxiv.org/abs/1903.03488v1","url_pdf":"http://arxiv.org/pdf/1903.03488v1.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":"is-deeper-better-only-when-shallow-is-good","repo_url":"https://github.com/emalach/IsDeeperBetter","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"learning-theory","task_name":"Learning Theory"},{"task_slug":"open-question","task_name":"Open-Ended Question Answering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.03488","atlas_url":"https://app.syntology.ai/?focus=1903.03488","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":"1903.03488"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.03488\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.03488"},"call":"get_concepts_for_paper(arxiv_id=\"1903.03488\")"}],"by_repo":[{"repo":"emalach/IsDeeperBetter","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":"d5a92afaadddef08a17e983a225ef6f6e3d2da1fbe8a0a9d550ba5a95e000938","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}