{"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/rigging-the-lottery-making-all-tickets-1","title":"Rigging the Lottery: Making All Tickets Winners","arxiv_id":"1911.11134","date":"2019-11-25","proceeding":"ICML 2020 1","authors":["Utku Evci","Trevor Gale","Jacob Menick","Pablo Samuel Castro","Erich Elsen"],"abstract":"Many applications require sparse neural networks due to space or inference time restrictions. There is a large body of work on training dense networks to yield sparse networks for inference, but this limits the size of the largest trainable sparse model to that of the largest trainable dense model. In this paper we introduce a method to train sparse neural networks with a fixed parameter count and a fixed computational cost throughout training, without sacrificing accuracy relative to existing dense-to-sparse training methods. Our method updates the topology of the sparse network during training by using parameter magnitudes and infrequent gradient calculations. We show that this approach requires fewer floating-point operations (FLOPs) to achieve a given level of accuracy compared to prior techniques. We demonstrate state-of-the-art sparse training results on a variety of networks and datasets, including ResNet-50, MobileNets on Imagenet-2012, and RNNs on WikiText-103. Finally, we provide some insights into why allowing the topology to change during the optimization can overcome local minima encountered when the topology remains static. Code used in our work can be found in github.com/google-research/rigl.","url_abs":"https://arxiv.org/abs/1911.11134v3","url_pdf":"https://arxiv.org/pdf/1911.11134v3.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":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/google-research/rigl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/varun19299/rigl-reproducibility","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/Shiweiliuiiiiiii/GraNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/Shiweiliuiiiiiii/In-Time-Over-Parameterization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/calgaryml/condensed-sparsity","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/hyeon95y/sparselinear","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/nollied/rigl-torch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/stevenboys/agent","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/stevenboys/moon","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/verbose-avocado/rigl-torch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"rigging-the-lottery-making-all-tickets-1","repo_url":"https://github.com/vita-group/granet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"all","task_name":"All"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"sparse-learning","task_name":"Sparse Learning"}],"methods":[{"method_slug":"rigl","method_name":"RigL"}],"datasets_introduced":[],"methods_introduced":[{"slug":"rigl","name":"RigL","full_name":"Rigging the Lottery"}],"results":[{"leaderboard":"/sota/sparse-learning-on-imagenet","task":"Sparse Learning","dataset":"ImageNet","model":"Resnet-50: 80% Sparse","rank_in_archive_order":1,"of":9,"metrics":{"Top-1 Accuracy":"77.1"},"uses_additional_data":false},{"leaderboard":"/sota/sparse-learning-on-imagenet","task":"Sparse Learning","dataset":"ImageNet","model":"Resnet-50: 90% Sparse","rank_in_archive_order":2,"of":9,"metrics":{"Top-1 Accuracy":"76.4"},"uses_additional_data":false},{"leaderboard":"/sota/sparse-learning-on-imagenet","task":"Sparse Learning","dataset":"ImageNet","model":"MobileNet-v1: 75% Sparse","rank_in_archive_order":7,"of":9,"metrics":{"Top-1 Accuracy":"71.9"},"uses_additional_data":false},{"leaderboard":"/sota/sparse-learning-on-imagenet","task":"Sparse Learning","dataset":"ImageNet","model":"MobileNet-v1: 90% Sparse","rank_in_archive_order":8,"of":9,"metrics":{"Top-1 Accuracy":"68.1"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1911.11134","atlas_url":"https://app.syntology.ai/?focus=1911.11134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11134"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1911.11134"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1911.11134"},"call":"get_harvested_code_for_paper(arxiv_id=\"1911.11134\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1911.11134"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1911.11134\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1911.11134"},"call":"get_concepts_for_paper(arxiv_id=\"1911.11134\")"}],"by_repo":[{"repo":"google-research/rigl","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.04840"],"harvested_for_calls":[{"arxiv_id":"1907.04840","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.04840"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.04840\")"}]},{"repo":"varun19299/rigl-reproducibility","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Shiweiliuiiiiiii/GraNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Shiweiliuiiiiiii/In-Time-Over-Parameterization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"calgaryml/condensed-sparsity","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2305.02299"],"harvested_for_calls":[{"arxiv_id":"2305.02299","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.02299"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.02299\")"}]},{"repo":"hyeon95y/sparselinear","kind":"listed","samples":1,"ran":1,"instrument":1,"unverified":0},{"repo":"nollied/rigl-torch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"stevenboys/agent","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"stevenboys/moon","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"verbose-avocado/rigl-torch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vita-group/granet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2106.10404"],"harvested_for_calls":[{"arxiv_id":"2106.10404","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.10404"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.10404\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1911.11134.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1911.11134.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Shiweiliuiiiiiii/GraNet","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/google-research/rigl","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nollied/rigl-torch","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/stevenboys/moon","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/vita-group/granet","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/verbose-avocado/rigl-torch","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/varun19299/rigl-reproducibility","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/calgaryml/condensed-sparsity","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hyeon95y/sparselinear","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Shiweiliuiiiiiii/In-Time-Over-Parameterization","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/stevenboys/agent","reach":{"status":"ok"}}],"summary":{"ran_fixture":1},"n_samples":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":true,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":1,"ran":1,"n_ran_checked":0,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"official_not_harvested":{"repositories":["google-research/rigl","varun19299/rigl-reproducibility"],"harvested_for_other_papers":[1,0],"samples_from_other_repositories":1,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":1,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"3a0749baa452d466","code_sha256_prefix":"3a0749baa452d466","entry":"small_world_chunker","repo":"hyeon95y/sparselinear","repo_kind":"listed","path":"sparselinear/sparselinear.py","file_url":"https://github.com/hyeon95y/sparselinear/blob/HEAD/sparselinear/sparselinear.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"inputs:Tensor/1/float, outputs:Tensor/1/float, nnz:float/0/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"3a0749baa452d466"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3a0749baa452d466"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"aa3ae0cff7f6fc454a821324a5a78746306d2b2ac5cf2b683c37a00b9767b454","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}