{"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/analysing-neural-network-topologies-a-game","title":"Analysing Neural Network Topologies: a Game Theoretic Approach","arxiv_id":"1904.08166","date":"2019-04-17","proceeding":null,"authors":["Julian Stier","Gabriele Gianini","Michael Granitzer","Konstantin Ziegler"],"abstract":"Artificial Neural Networks have shown impressive success in very different\napplication cases. Choosing a proper network architecture is a critical\ndecision for a network's success, usually done in a manual manner. As a\nstraightforward strategy, large, mostly fully connected architectures are\nselected, thereby relying on a good optimization strategy to find proper\nweights while at the same time avoiding overfitting. However, large parts of\nthe final network are redundant. In the best case, large parts of the network\nbecome simply irrelevant for later inferencing. In the worst case, highly\nparameterized architectures hinder proper optimization and allow the easy\ncreation of adverserial examples fooling the network. A first step in removing\nirrelevant architectural parts lies in identifying those parts, which requires\nmeasuring the contribution of individual components such as neurons. In\nprevious work, heuristics based on using the weight distribution of a neuron as\ncontribution measure have shown some success, but do not provide a proper\ntheoretical understanding. Therefore, in our work we investigate game theoretic\nmeasures, namely the Shapley value (SV), in order to separate relevant from\nirrelevant parts of an artificial neural network. We begin by designing a\ncoalitional game for an artificial neural network, where neurons form\ncoalitions and the average contributions of neurons to coalitions yield to the\nShapley value. In order to measure how well the Shapley value measures the\ncontribution of individual neurons, we remove low-contributing neurons and\nmeasure its impact on the network performance. In our experiments we show that\nthe Shapley value outperforms other heuristics for measuring the contribution\nof neurons.","url_abs":"http://arxiv.org/abs/1904.08166v1","url_pdf":"http://arxiv.org/pdf/1904.08166v1.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":[],"tasks":[{"task_slug":"network-pruning","task_name":"Network Pruning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/network-pruning-on-mnist","task":"Network Pruning","dataset":"MNIST","model":"FFN-ShapleyPruned","rank_in_archive_order":1,"of":1,"metrics":{"Avg #Steps":"12.05"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.08166","atlas_url":"https://app.syntology.ai/?focus=1904.08166","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":"1904.08166"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.08166\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.08166"},"call":"get_concepts_for_paper(arxiv_id=\"1904.08166\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"54c81538c2a3213cfea037cbd0df34ee78a4205c83f011da0ff477491a4d8fa6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}