{"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/a-capacity-scaling-law-for-artificial-neural","title":"A Capacity Scaling Law for Artificial Neural Networks","arxiv_id":"1708.06019","date":"2017-08-20","proceeding":null,"authors":["Gerald Friedland","Mario Krell"],"abstract":"We derive the calculation of two critical numbers predicting the behavior of\nperceptron networks. First, we derive the calculation of what we call the\nlossless memory (LM) dimension. The LM dimension is a generalization of the\nVapnik--Chervonenkis (VC) dimension that avoids structured data and therefore\nprovides an upper bound for perfectly fitting almost any training data. Second,\nwe derive what we call the MacKay (MK) dimension. This limit indicates a 50%\nchance of not being able to train a given function. Our derivations are\nperformed by embedding a neural network into Shannon's communication model\nwhich allows to interpret the two points as capacities measured in bits. We\npresent a proof and practical experiments that validate our upper bounds with\nrepeatable experiments using different network configurations, diverse\nimplementations, varying activation functions, and several learning algorithms.\nThe bottom line is that the two capacity points scale strictly linear with the\nnumber of weights. Among other practical applications, our result allows to\ncompare and benchmark different neural network implementations independent of a\nconcrete learning task. Our results provide insight into the capabilities and\nlimits of neural networks and generate valuable know how for experimental\ndesign decisions.","url_abs":"http://arxiv.org/abs/1708.06019v3","url_pdf":"http://arxiv.org/pdf/1708.06019v3.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":"a-capacity-scaling-law-for-artificial-neural","repo_url":"https://github.com/multimedia-berkeley/deep_thoughts","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"experimental-design","task_name":"Experimental Design"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"multimedia-berkeley/deep_thoughts","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":"ea53e2e09e33f04346480380ec56995126700acdfa7f77a15a0b91dae8a8452b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}