{"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":"/method/rigl","slug":"rigl","name":"RigL","full_name":"Rigging the Lottery","full_name_withheld":false,"description_markdown":"Dynamic Sparse Training method based on using the gradient norm to select which weights to remove/add in each mask update.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Rigging the Lottery: Making All Tickets Winners","paper":"/paper/rigging-the-lottery-making-all-tickets-1","first_author":"Utku Evci","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/rigging-the-lottery-making-all-tickets-1"},"source":{"url":"https://arxiv.org/abs/1911.11134v3","title":"Rigging the Lottery: Making All Tickets Winners","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Pruning","url":"/methods/category/pruning","pwc_aliases":[]}],"n_papers_tagged":5,"archive_num_papers":5,"papers_newest_first":[{"paper":"/paper/spatio-temporal-structure-of-excitation-and","slug":"spatio-temporal-structure-of-excitation-and","title":"Learning Delays Through Gradients and Structure: Emergence of Spatiotemporal Patterns in Spiking Neural Networks","date":"2024-07-07","arxiv_id":"2407.18917","n_code_links":1,"syntology":null},{"paper":"/paper/rigl-a-unified-reciprocal-approach-for","slug":"rigl-a-unified-reciprocal-approach-for","title":"RIGL: A Unified Reciprocal Approach for Tracing the Independent and Group Learning Processes","date":"2024-06-18","arxiv_id":"2406.12465","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":4,"n_instrument":1,"unverified":3,"pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 3 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["labyrinthineleo/rigl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/dynamic-sparse-training-with-structured","slug":"dynamic-sparse-training-with-structured","title":"Dynamic Sparse Training with Structured Sparsity","date":"2023-05-03","arxiv_id":"2305.02299","n_code_links":1,"syntology":{"ran":8,"of":10,"n_ran_checked":8,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["calgaryml/condensed-sparsity"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/reproducibility-report-rigging-the-lottery","slug":"reproducibility-report-rigging-the-lottery","title":"[Re] Rigging the Lottery: Making All Tickets Winners","date":"2021-03-29","arxiv_id":"2103.15767","n_code_links":1,"syntology":null},{"paper":"/paper/rigging-the-lottery-making-all-tickets-1","slug":"rigging-the-lottery-making-all-tickets-1","title":"Rigging the Lottery: Making All Tickets Winners","date":"2019-11-25","arxiv_id":"1911.11134","n_code_links":11,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["google-research/rigl","varun19299/rigl-reproducibility"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":5,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":5,"with_a_code_link":5,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":5,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/method/rigl/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/rigl/papers/ran/1","json":"/method/rigl/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/all","name":"All","papers":2},{"task":null,"name":"GPU","papers":2},{"task":"/task/image-classification","name":"Image Classification","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":null,"name":"CPU","papers":1},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":1},{"task":"/task/keyword-spotting","name":"Keyword Spotting","papers":1},{"task":"/task/sparse-learning","name":"Sparse Learning","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1}],"tasks_shown":9,"n_tasks":9,"usage_by_year":[{"year":"2019","papers":1},{"year":"2021","papers":1},{"year":"2023","papers":1},{"year":"2024","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/rigl"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=RigL","read_at":"2026-10-05T01:01:18+00:00","query":"RigL","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1911.11134","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":1,"served":null,"leading_other_bearer":{"arxiv_id":"2406.12465","title":"RIGL: A Unified Reciprocal Approach for Tracing the Independent and Group Learning Processes","citations":17,"named_by":["title_prefix"],"bearer_name":"RIGL: A Unified Reciprocal Approach for Tracing the Independent and Group Learning Processes","ask_with":"have('2406.12465')"},"n_other_bearers_listed":1,"note":"Nothing resolved to 'RigL' by name, but 1 thing(s) here DECLARE that name -- most cited: the paper 'RIGL: A Unified Reciprocal Approach for Tracing the Independent and Group Learning Processes' (arXiv:2406.12465, 17 citations). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 1 entry in Syntology's graph carry it; the most cited is the paper “RIGL: A Unified Reciprocal Approach for Tracing the Independent and Group Learning Processes” (arXiv:2406.12465, 17 citations). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","near_matches":["Structured RigL (SRigL)"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"1079664f507126693d280874824ec89eaaf5b02cd6d5e633be51303abe9bb5f2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}