{"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":"/task/sparse-learning","name":"Sparse Learning","slug":"sparse-learning","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":185,"papers_with_code":52,"benchmarks":3,"benchmark_tables_in_archive":3,"benchmark_tables_shown":3,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/sparse-learning-on-imagenet","slug":"sparse-learning-on-imagenet","dataset":"ImageNet","dataset_url":"/dataset/imagenet","rows_in_archive":9,"metrics":["Top-1 Accuracy"],"first_row_in_archive_order":{"model":"Resnet-50: 80% Sparse","paper_title":"Rigging the Lottery: Making All Tickets Winners","paper_url":"/paper/rigging-the-lottery-making-all-tickets-1","paper_date":"2019-11-25","arxiv_id":"1911.11134","code_links":[{"title":"google-research/rigl","url":"https://github.com/google-research/rigl"},{"title":"verbose-avocado/rigl-torch","url":"https://github.com/verbose-avocado/rigl-torch"},{"title":"nollied/rigl-torch","url":"https://github.com/nollied/rigl-torch"},{"title":"hyeon95y/sparselinear","url":"https://github.com/hyeon95y/sparselinear"},{"title":"Shiweiliuiiiiiii/In-Time-Over-Parameterization","url":"https://github.com/Shiweiliuiiiiiii/In-Time-Over-Parameterization"},{"title":"vita-group/granet","url":"https://github.com/vita-group/granet"},{"title":"Shiweiliuiiiiiii/GraNet","url":"https://github.com/Shiweiliuiiiiiii/GraNet"},{"title":"varun19299/rigl-reproducibility","url":"https://github.com/varun19299/rigl-reproducibility"},{"title":"calgaryml/condensed-sparsity","url":"https://github.com/calgaryml/condensed-sparsity"},{"title":"stevenboys/moon","url":"https://github.com/stevenboys/moon"},{"title":"stevenboys/agent","url":"https://github.com/stevenboys/agent"}],"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/rigging-the-lottery-making-all-tickets-1#ran","syntology_url":"https://syntology.ai/paper/1911.11134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11134"}},"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"]}}}},{"leaderboard":"/sota/sparse-learning-on-cinic-10-1","slug":"sparse-learning-on-cinic-10-1","dataset":"CINIC-10","dataset_url":"/dataset/cinic-10","rows_in_archive":1,"metrics":["Sparsity"],"first_row_in_archive_order":{"model":"Resnet18","paper_title":"Adaptive Neural Connections for Sparsity Learning","paper_url":"/paper/adaptive-neural-connections-for-sparsity","paper_date":"2020-03-05","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/sparse-learning-on-imagenet32-1","slug":"sparse-learning-on-imagenet32-1","dataset":"ImageNet32","dataset_url":"/dataset/imagenet-32","rows_in_archive":1,"metrics":["Sparsity"],"first_row_in_archive_order":{"model":"Resnet18","paper_title":"Adaptive Neural Connections for Sparsity Learning","paper_url":"/paper/adaptive-neural-connections-for-sparsity","paper_date":"2020-03-05","arxiv_id":null,"code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/imagenet","name":"ImageNet","full_name":"","num_papers_in_archive":15430},{"url":"/dataset/cinic-10","name":"CINIC-10","full_name":"CINIC-10","num_papers_in_archive":197},{"url":"/dataset/imagenet-32","name":"ImageNet-32","full_name":"","num_papers_in_archive":112}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":185,"of_with_code":52,"tagged_in_all":185,"counts":{"archive_papers_tagged":185,"with_a_code_link":52,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":185,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":10,"listed_every_run_a_failure_of_syntologys_instrument":2,"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"},"items":[{"url":"/paper/variational-dropout-sparsifies-deep-neural","slug":"variational-dropout-sparsifies-deep-neural","title":"Variational Dropout Sparsifies Deep Neural Networks","date":"2017-01-19","arxiv_id":"1701.05369","repositories_listed":15,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/variational-dropout-sparsifies-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1701.05369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.05369"}},"official":null}},{"url":"/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","repositories_listed":11,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/rigging-the-lottery-making-all-tickets-1#ran","syntology_url":"https://syntology.ai/paper/1911.11134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11134"}},"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"]}}},{"url":"/paper/the-state-of-sparsity-in-deep-neural-networks","slug":"the-state-of-sparsity-in-deep-neural-networks","title":"The State of Sparsity in Deep Neural Networks","date":"2019-02-25","arxiv_id":"1902.09574","repositories_listed":6,"syntology":null},{"url":"/paper/do-we-actually-need-dense-over","slug":"do-we-actually-need-dense-over","title":"Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training","date":"2021-02-04","arxiv_id":"2102.02887","repositories_listed":4,"syntology":null},{"url":"/paper/a-general-iterative-shrinkage-and","slug":"a-general-iterative-shrinkage-and","title":"A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems","date":"2013-03-18","arxiv_id":"1303.4434","repositories_listed":4,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-general-iterative-shrinkage-and#ran","syntology_url":"https://syntology.ai/paper/1303.4434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1303.4434"}},"official":null}},{"url":"/paper/controlled-sparsity-via-constrained","slug":"controlled-sparsity-via-constrained","title":"Controlled Sparsity via Constrained Optimization or: How I Learned to Stop Tuning Penalties and Love Constraints","date":"2022-08-08","arxiv_id":"2208.04425","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/controlled-sparsity-via-constrained#ran","syntology_url":"https://syntology.ai/paper/2208.04425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04425"}},"official":{"repos":["cooper-org/cooper","gallego-posada/constrained_sparsity"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/abess-a-fast-best-subset-selection-library-in","slug":"abess-a-fast-best-subset-selection-library-in","title":"abess: A Fast Best Subset Selection Library in Python and R","date":"2021-10-19","arxiv_id":"2110.09697","repositories_listed":2,"syntology":null},{"url":"/paper/sparse-training-via-boosting-pruning","slug":"sparse-training-via-boosting-pruning","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","date":"2021-06-19","arxiv_id":"2106.10404","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/sparse-training-via-boosting-pruning#ran","syntology_url":"https://syntology.ai/paper/2106.10404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10404"}},"official":{"repos":["Shiweiliuiiiiiii/GraNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/sparse-regression-at-scale-branch-and-bound","slug":"sparse-regression-at-scale-branch-and-bound","title":"Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization","date":"2020-04-13","arxiv_id":"2004.06152","repositories_listed":2,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/sparse-regression-at-scale-branch-and-bound#ran","syntology_url":"https://syntology.ai/paper/2004.06152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06152"}},"official":{"repos":["alisaab/l0bnb"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sparse-networks-from-scratch-faster-training","slug":"sparse-networks-from-scratch-faster-training","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","date":"2019-07-10","arxiv_id":"1907.04840","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/sparse-networks-from-scratch-faster-training#ran","syntology_url":"https://syntology.ai/paper/1907.04840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04840"}},"official":{"repos":["TimDettmers/sparse_learning"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/scalable-training-of-artificial-neural","slug":"scalable-training-of-artificial-neural","title":"Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science","date":"2017-07-15","arxiv_id":"1707.04780","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-training-of-artificial-neural#ran","syntology_url":"https://syntology.ai/paper/1707.04780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.04780"}},"official":{"repos":["dcmocanu/sparse-evolutionary-artificial-neural-networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/feature-selection-a-data-perspective","slug":"feature-selection-a-data-perspective","title":"Feature Selection: A Data Perspective","date":"2016-01-29","arxiv_id":"1601.07996","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-subset-selection-in-linear-mixed","slug":"scalable-subset-selection-in-linear-mixed","title":"Scalable Subset Selection in Linear Mixed Models","date":"2025-06-25","arxiv_id":"2506.20425","repositories_listed":1,"syntology":null},{"url":"/paper/myesl-sparse-learning-in-molecular-evolution","slug":"myesl-sparse-learning-in-molecular-evolution","title":"MyESL: Sparse learning in molecular evolution and phylogenetic analysis","date":"2025-01-09","arxiv_id":"2501.04941","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-rare-word-accuracy-in-direct","slug":"optimizing-rare-word-accuracy-in-direct","title":"Optimizing Rare Word Accuracy in Direct Speech Translation with a Retrieval-and-Demonstration Approach","date":"2024-09-13","arxiv_id":"2409.09009","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-iterative-hard-thresholding-for","slug":"probabilistic-iterative-hard-thresholding-for","title":"Probabilistic Iterative Hard Thresholding for Sparse Learning","date":"2024-09-02","arxiv_id":"2409.01413","repositories_listed":1,"syntology":null},{"url":"/paper/ssprop-energy-efficient-training-for","slug":"ssprop-energy-efficient-training-for","title":"ssProp: Energy-Efficient Training for Convolutional Neural Networks with Scheduled Sparse Back Propagation","date":"2024-08-22","arxiv_id":"2408.12561","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02279","slug":"2408-02279","title":"DRFormer: Multi-Scale Transformer Utilizing Diverse Receptive Fields for Long Time-Series Forecasting","date":"2024-08-05","arxiv_id":"2408.02279","repositories_listed":1,"syntology":null},{"url":"/paper/sltrain-a-sparse-plus-low-rank-approach-for","slug":"sltrain-a-sparse-plus-low-rank-approach-for","title":"SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretraining","date":"2024-06-04","arxiv_id":"2406.02214","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"6 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sltrain-a-sparse-plus-low-rank-approach-for#ran","syntology_url":"https://syntology.ai/paper/2406.02214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02214"}},"official":{"repos":["andyjm3/SLTrain"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/classp-a-biologically-inspired-approach-to-1","slug":"classp-a-biologically-inspired-approach-to-1","title":"CLASSP: a Biologically-Inspired Approach to Continual Learning through Adjustment Suppression and Sparsity Promotion","date":"2024-04-29","arxiv_id":"2405.09637","repositories_listed":1,"syntology":null},{"url":"/paper/learning-with-diversification-from-block","slug":"learning-with-diversification-from-block","title":"Block Sparse Bayesian Learning: A Diversified Scheme","date":"2024-02-07","arxiv_id":"2402.04646","repositories_listed":1,"syntology":null},{"url":"/paper/building-explainable-graph-neural-network-by","slug":"building-explainable-graph-neural-network-by","title":"Building explainable graph neural network by sparse learning for the drug-protein binding prediction","date":"2023-08-27","arxiv_id":"2309.12906","repositories_listed":1,"syntology":null},{"url":"/paper/hypersparse-neural-networks-shifting","slug":"hypersparse-neural-networks-shifting","title":"HyperSparse Neural Networks: Shifting Exploration to Exploitation through Adaptive Regularization","date":"2023-08-14","arxiv_id":"2308.07163","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hypersparse-neural-networks-shifting#ran","syntology_url":"https://syntology.ai/paper/2308.07163","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07163"}},"official":{"repos":["greenautoml4fas/hypersparse"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/resource-constrained-model-compression-via","slug":"resource-constrained-model-compression-via","title":"Resource Constrained Model Compression via Minimax Optimization for Spiking Neural Networks","date":"2023-08-09","arxiv_id":"2308.04672","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-super-resolve-blurry-images-with","slug":"learning-to-super-resolve-blurry-images-with","title":"Learning to Super-Resolve Blurry Images with Events","date":"2023-02-27","arxiv_id":"2302.13766","repositories_listed":1,"syntology":null},{"url":"/paper/video-text-retrieval-by-supervised-multi","slug":"video-text-retrieval-by-supervised-multi","title":"Video-Text Retrieval by Supervised Sparse Multi-Grained Learning","date":"2023-02-19","arxiv_id":"2302.09473","repositories_listed":1,"syntology":null},{"url":"/paper/federated-sparse-training-lottery-aware-model","slug":"federated-sparse-training-lottery-aware-model","title":"Lottery Aware Sparsity Hunting: Enabling Federated Learning on Resource-Limited Edge","date":"2022-08-27","arxiv_id":"2208.13092","repositories_listed":1,"syntology":null},{"url":"/paper/adamix-mixture-of-adapter-for-parameter","slug":"adamix-mixture-of-adapter-for-parameter","title":"AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuning","date":"2022-05-24","arxiv_id":"2205.12410","repositories_listed":1,"syntology":null},{"url":"/paper/app-anytime-progressive-pruning","slug":"app-anytime-progressive-pruning","title":"APP: Anytime Progressive Pruning","date":"2022-04-04","arxiv_id":"2204.01640","repositories_listed":1,"syntology":null},{"url":"/paper/l0learn-a-scalable-package-for-sparse","slug":"l0learn-a-scalable-package-for-sparse","title":"L0Learn: A Scalable Package for Sparse Learning using L0 Regularization","date":"2022-02-10","arxiv_id":"2202.04820","repositories_listed":1,"syntology":null},{"url":"/paper/sl-cyclegan-blind-motion-deblurring-in-cycles","slug":"sl-cyclegan-blind-motion-deblurring-in-cycles","title":"SL-CycleGAN: Blind Motion Deblurring in Cycles using Sparse Learning","date":"2021-11-07","arxiv_id":"2111.04026","repositories_listed":1,"syntology":null},{"url":"/paper/learning-where-to-learn-gradient-sparsity-in","slug":"learning-where-to-learn-gradient-sparsity-in","title":"Learning where to learn: Gradient sparsity in meta and continual learning","date":"2021-10-27","arxiv_id":"2110.14402","repositories_listed":1,"syntology":null},{"url":"/paper/grouped-variable-selection-with-discrete","slug":"grouped-variable-selection-with-discrete","title":"Grouped Variable Selection with Discrete Optimization: Computational and Statistical Perspectives","date":"2021-04-14","arxiv_id":"2104.07084","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/grouped-variable-selection-with-discrete#ran","syntology_url":"https://syntology.ai/paper/2104.07084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07084"}},"official":{"repos":["hazimehh/l0group"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/similarity-preserving-unsupervised-feature","slug":"similarity-preserving-unsupervised-feature","title":"Similarity Preserving Unsupervised Feature Selection based on Sparse Learning","date":"2020-12-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knn-classification-with-one-step-computation","slug":"knn-classification-with-one-step-computation","title":"KNN Classification with One-step Computation","date":"2020-12-09","arxiv_id":"2012.06047","repositories_listed":1,"syntology":null},{"url":"/paper/thunder-a-fast-coordinate-selection-solver","slug":"thunder-a-fast-coordinate-selection-solver","title":"Thunder: a Fast Coordinate Selection Solver for Sparse Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-convergence-for-nonconvex-composite","slug":"improving-convergence-for-nonconvex-composite","title":"Accelerated Gradient Methods for Sparse Statistical Learning with Nonconvex Penalties","date":"2020-09-22","arxiv_id":"2009.10629","repositories_listed":1,"syntology":null},{"url":"/paper/block-wise-minimization-majorization","slug":"block-wise-minimization-majorization","title":"Block-wise Minimization-Majorization algorithm for Huber's criterion: sparse learning and applications","date":"2020-08-25","arxiv_id":"2008.10982","repositories_listed":1,"syntology":null},{"url":"/paper/event-enhanced-high-quality-image-recovery","slug":"event-enhanced-high-quality-image-recovery","title":"Event Enhanced High-Quality Image Recovery","date":"2020-07-16","arxiv_id":"2007.08336","repositories_listed":1,"syntology":null},{"url":"/paper/fast-oscar-and-owl-regression-via-safe","slug":"fast-oscar-and-owl-regression-via-safe","title":"Fast OSCAR and OWL Regression via Safe Screening Rules","date":"2020-06-29","arxiv_id":"2006.16433","repositories_listed":1,"syntology":null},{"url":"/paper/picasso-a-sparse-learning-library-for-high","slug":"picasso-a-sparse-learning-library-for-high","title":"Picasso: A Sparse Learning Library for High Dimensional Data Analysis in R and Python","date":"2020-06-27","arxiv_id":"2006.15261","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-weight-activation-training-1","slug":"sparse-weight-activation-training-1","title":"Sparse Weight Activation Training","date":"2020-01-07","arxiv_id":"2001.01969","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/sparse-weight-activation-training-1#ran","syntology_url":"https://syntology.ai/paper/2001.01969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01969"}},"official":{"repos":["AamirRaihan/SWAT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/collaborative-preference-embedding-against","slug":"collaborative-preference-embedding-against","title":"Collaborative Preference Embedding against Sparse Labels","date":"2019-10-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-tradeoff-between-privacy-and-accuracy-in","slug":"the-tradeoff-between-privacy-and-accuracy-in","title":"The Tradeoff Between Privacy and Accuracy in Anomaly Detection Using Federated XGBoost","date":"2019-07-16","arxiv_id":"1907.07157","repositories_listed":1,"syntology":null},{"url":"/paper/robusttrend-a-huber-loss-with-a-combined","slug":"robusttrend-a-huber-loss-with-a-combined","title":"RobustTrend: A Huber Loss with a Combined First and Second Order Difference Regularization for Time Series Trend Filtering","date":"2019-06-10","arxiv_id":"1906.03751","repositories_listed":1,"syntology":null},{"url":"/paper/minimizing-approximately-submodular-functions","slug":"minimizing-approximately-submodular-functions","title":"Optimal approximation for unconstrained non-submodular minimization","date":"2019-05-29","arxiv_id":"1905.12145","repositories_listed":1,"syntology":null},{"url":"/paper/cross-modal-ranking-with-soft-consistency-and","slug":"cross-modal-ranking-with-soft-consistency-and","title":"Cross-Modal Ranking with Soft Consistency and Noisy Labels for Robust RGB-T Tracking","date":"2018-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-best-subset-selection-coordinate-descent","slug":"fast-best-subset-selection-coordinate-descent","title":"Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms","date":"2018-03-05","arxiv_id":"1803.01454","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-learning-of-stochastic-dynamic","slug":"sparse-learning-of-stochastic-dynamic","title":"Sparse learning of stochastic dynamic equations","date":"2017-12-06","arxiv_id":"1712.02432","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sparse-learning-of-stochastic-dynamic#ran","syntology_url":"https://syntology.ai/paper/1712.02432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02432"}},"official":null}},{"url":"/paper/subset-selection-with-shrinkage-sparse-linear","slug":"subset-selection-with-shrinkage-sparse-linear","title":"Subset Selection with Shrinkage: Sparse Linear Modeling when the SNR is low","date":"2017-08-10","arxiv_id":"1708.03288","repositories_listed":1,"syntology":null},{"url":"/paper/learning-task-structure-via-sparsity-grouped","slug":"learning-task-structure-via-sparsity-grouped","title":"Learning task structure via sparsity grouped multitask learning","date":"2017-05-13","arxiv_id":"1705.04886","repositories_listed":1,"syntology":null},{"url":"/paper/from-safe-screening-rules-to-working-sets-for","slug":"from-safe-screening-rules-to-working-sets-for","title":"From safe screening rules to working sets for faster Lasso-type solvers","date":"2017-03-21","arxiv_id":"1703.07285","repositories_listed":1,"syntology":null},{"url":null,"slug":"learning-sparsity-for-effective-and-efficient","title":"Learning Sparsity for Effective and Efficient Music Performance Question Answering","date":"2025-06-02","arxiv_id":"2506.01319","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-hard-thresholding-for-sparse-model","title":"Optimizing Hard Thresholding for Sparse Model Discovery","date":"2025-04-28","arxiv_id":"2504.20256","repositories_listed":0,"syntology":null},{"url":null,"slug":"stars-sparse-learning-correlation-filter-with","title":"STARS: Sparse Learning Correlation Filter with Spatio-temporal Regularization and Super-resolution Reconstruction for Thermal Infrared Target Tracking","date":"2025-04-20","arxiv_id":"2504.14491","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsified-learning-for-heavy-tailed-locally","title":"Sparsified-Learning for Heavy-Tailed Locally Stationary Processes","date":"2025-04-08","arxiv_id":"2504.06477","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-regression-via-least-angle","title":"Low-Rank Matrix Regression via Least-Angle Regression","date":"2025-03-13","arxiv_id":"2503.10569","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-weight-factorization-sparse-learning","title":"Deep Weight Factorization: Sparse Learning Through the Lens of Artificial Symmetries","date":"2025-02-04","arxiv_id":"2502.02496","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-sparse-online-learning-of-the","title":"Nonparametric Sparse Online Learning of the Koopman Operator","date":"2025-01-27","arxiv_id":"2501.16489","repositories_listed":0,"syntology":null},{"url":null,"slug":"pushing-the-limits-of-sparsity-a-bag-of","title":"Pushing the Limits of Sparsity: A Bag of Tricks for Extreme Pruning","date":"2024-11-20","arxiv_id":"2411.13545","repositories_listed":0,"syntology":null},{"url":null,"slug":"guide-real-time-human-shaped-agents","title":"GUIDE: Real-Time Human-Shaped Agents","date":"2024-10-19","arxiv_id":"2410.15181","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-continuous-kernels-with-sparse","title":"Scaling Continuous Kernels with Sparse Fourier Domain Learning","date":"2024-09-15","arxiv_id":"2409.09875","repositories_listed":0,"syntology":null},{"url":null,"slug":"quasi-potential-and-drift-decomposition-in","title":"Quasi-potential and drift decomposition in stochastic systems by sparse identification","date":"2024-09-10","arxiv_id":"2409.06886","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-sigatnet-a-multimodal-schizophrenia-mri","title":"Multi-SIGATnet: A multimodal schizophrenia MRI classification algorithm using sparse interaction mechanisms and graph attention networks","date":"2024-08-25","arxiv_id":"2408.13830","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-adversarial-networks-for-imputing","title":"Generative Adversarial Networks for Imputing Sparse Learning Performance","date":"2024-07-26","arxiv_id":"2407.18875","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-deep-spiking-neural","title":"Towards Efficient Deep Spiking Neural Networks Construction with Spiking Activity based Pruning","date":"2024-06-03","arxiv_id":"2406.01072","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-online-learning-of-conditional","title":"Nonparametric Sparse Online Learning of the Koopman Operator","date":"2024-05-13","arxiv_id":"2405.07432","repositories_listed":0,"syntology":null},{"url":null,"slug":"crb-analysis-for-mixed-adc-based-doa","title":"CRB Analysis for Mixed-ADC Based DOA Estimation","date":"2024-03-14","arxiv_id":"2403.09301","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-sparse-learning-a-novel-paradigm-for","title":"Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendation","date":"2024-02-05","arxiv_id":"2402.02855","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-incremental-optimization-for-best","title":"Dynamic Incremental Optimization for Best Subset Selection","date":"2024-02-04","arxiv_id":"2402.02322","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-learning-and-class-probability","title":"Sparse Learning and Class Probability Estimation with Weighted Support Vector Machines","date":"2023-12-17","arxiv_id":"2312.10618","repositories_listed":0,"syntology":null},{"url":null,"slug":"sketching-for-convex-and-nonconvex","title":"Sketching for Convex and Nonconvex Regularized Least Squares with Sharp Guarantees","date":"2023-11-03","arxiv_id":"2311.01806","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothing-the-edges-a-general-framework-for","title":"Smoothing the Edges: Smooth Optimization for Sparse Regularization using Hadamard Overparametrization","date":"2023-07-07","arxiv_id":"2307.03571","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-stochastic-partial-differential","title":"Discovering stochastic partial differential equations from limited data using variational Bayes inference","date":"2023-06-28","arxiv_id":"2306.15873","repositories_listed":0,"syntology":null},{"url":null,"slug":"classical-verification-of-quantum-learning","title":"Classical Verification of Quantum Learning","date":"2023-06-08","arxiv_id":"2306.04843","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-representer-theorems-for-learning-in","title":"Sparse Representer Theorems for Learning in Reproducing Kernel Banach Spaces","date":"2023-05-21","arxiv_id":"2305.12584","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-art-of-transfer-learning-an-adaptive-and","title":"The ART of Transfer Learning: An Adaptive and Robust Pipeline","date":"2023-04-30","arxiv_id":"2305.00520","repositories_listed":0,"syntology":null},{"url":null,"slug":"channel-estimation-for-underwater-visible","title":"Channel Estimation for Underwater Visible Light Communication: A Sparse Learning Perspective","date":"2023-03-13","arxiv_id":"2303.07248","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-edge-model-sparse-learning-is-provably","title":"Joint Edge-Model Sparse Learning is Provably Efficient for Graph Neural Networks","date":"2023-02-06","arxiv_id":"2302.02922","repositories_listed":0,"syntology":null},{"url":null,"slug":"supergf-unifying-local-and-global-features","title":"SuperGF: Unifying Local and Global Features for Visual Localization","date":"2022-12-23","arxiv_id":"2212.13105","repositories_listed":0,"syntology":null},{"url":null,"slug":"zeroth-order-hard-thresholding-gradient-error","title":"Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity","date":"2022-10-11","arxiv_id":"2210.05279","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-sparse-auto-encoders-for-green-ai","title":"Learning sparse auto-encoders for green AI image coding","date":"2022-09-09","arxiv_id":"2209.04448","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-governing-physics-from-output-only","title":"Learning governing physics from output only measurements","date":"2022-08-11","arxiv_id":"2208.05609","repositories_listed":0,"syntology":null},{"url":null,"slug":"ams-net-adaptive-multiscale-sparse-neural","title":"AMS-Net: Adaptive Multiscale Sparse Neural Network with Interpretable Basis Expansion for Multiphase Flow Problems","date":"2022-07-24","arxiv_id":"2207.11735","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-graphs-underlying-generative-models","title":"Attribute Graphs Underlying Molecular Generative Models: Path to Learning with Limited Data","date":"2022-07-14","arxiv_id":"2207.07174","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsifying-binary-networks","title":"Sparsifying Binary Networks","date":"2022-07-11","arxiv_id":"2207.04974","repositories_listed":0,"syntology":null},{"url":null,"slug":"best-subset-selection-with-efficient-primal","title":"Best Subset Selection with Efficient Primal-Dual Algorithm","date":"2022-07-05","arxiv_id":"2207.02058","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bio-inspired-implementation-of-a-sparse","title":"A bio-inspired implementation of a sparse-learning spike-based hippocampus memory model","date":"2022-06-10","arxiv_id":"2206.04924","repositories_listed":0,"syntology":null},{"url":null,"slug":"infinite-dimensional-optimization-and","title":"Infinite-dimensional optimization and Bayesian nonparametric learning of stochastic differential equations","date":"2022-05-30","arxiv_id":"2205.15368","repositories_listed":0,"syntology":null},{"url":null,"slug":"safari-sparsity-enabled-federated-learning","title":"SAFARI: Sparsity enabled Federated Learning with Limited and Unreliable Communications","date":"2022-04-05","arxiv_id":"2204.02321","repositories_listed":0,"syntology":null},{"url":null,"slug":"infinite-dimensional-sparse-learning-in","title":"Infinite-Dimensional Sparse Learning in Linear System Identification","date":"2022-03-28","arxiv_id":"2203.14731","repositories_listed":0,"syntology":null},{"url":null,"slug":"ernie-sparse-learning-hierarchical-efficient-1","title":"ERNIE-SPARSE: Learning Hierarchical Efficient Transformer Through Regularized Self-Attention","date":"2022-03-23","arxiv_id":"2203.12276","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-generalized-bregman-surrogate","title":"Analysis of Generalized Bregman Surrogate Algorithms for Nonsmooth Nonconvex Statistical Learning","date":"2021-12-16","arxiv_id":"2112.09191","repositories_listed":0,"syntology":null},{"url":null,"slug":"ernie-sparse-learning-hierarchical-efficient","title":"ERNIE-SPARSE: Learning Hierarchical Efficient Transformer Through Regularized Self-Attention","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-slice-dense-sparse-learning-for","title":"Multi-Slice Dense-Sparse Learning for Efficient Liver and Tumor Segmentation","date":"2021-08-15","arxiv_id":"2108.06761","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-differentially-private","title":"High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data","date":"2021-07-23","arxiv_id":"2107.11136","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-low-latency-energy-efficient-deep","title":"Towards Low-Latency Energy-Efficient Deep SNNs via Attention-Guided Compression","date":"2021-07-16","arxiv_id":"2107.12445","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-sequential-recommendation","title":"Improving Sequential Recommendation Consistency with Self-Supervised Imitation","date":"2021-06-26","arxiv_id":"2106.14031","repositories_listed":0,"syntology":null},{"url":null,"slug":"surrogate-assisted-active-subspace-and-active","title":"Surrogate assisted active subspace and active subspace assisted surrogate -- A new paradigm for high dimensional structural reliability analysis","date":"2021-05-11","arxiv_id":"2105.04979","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-where-to-learn","title":"Learning where to learn","date":"2021-03-13","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":13,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":12,"papers_where_code_ran_first_page":"/task/sparse-learning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/sparse-learning/papers/2","json":"/task/sparse-learning/papers/2.json","rows":85},{"order":"ran","page":1,"of":1,"url":"/task/sparse-learning/papers/ran/1","json":"/task/sparse-learning/papers/ran/1.json","rows":12}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"3e5eaf07cad817e5b943eb9360a9587a621cf2075f9e8b2d8e7d50347cdbaa4e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}