{"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/pruning/papers/ran/3","list_of":"/method/pruning","method":"Pruning","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not isolate this method inside it.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":3,"pages_in_order":5,"rows_per_page":100,"rows":[201,300],"of":478,"counts":{"archive_papers_tagged":3874,"with_a_code_link":1508,"where_syntology_ran_a_sample":478,"not_listed_spam_title":0,"listed":3874,"listed_where_code_ran":478,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":395,"every_run_a_failure_of_syntologys_instrument":83,"listed_with_a_run_with_no_instrument_failure":395,"listed_every_run_a_failure_of_syntologys_instrument":83,"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"},"first_page":"/method/pruning/papers/ran/1","prev":"/method/pruning/papers/ran/2","next":"/method/pruning/papers/ran/4","papers":[{"paper":"/paper/grokking-tickets-lottery-tickets-accelerate","slug":"grokking-tickets-lottery-tickets-accelerate","title":"Bridging Lottery Ticket and Grokking: Understanding Grokking from Inner Structure of Networks","date":"2023-10-30","arxiv_id":"2310.19470","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":2,"n_instrument":1,"unverified":2,"pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["gouki510/grokking-tickets"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/lorashear-efficient-large-language-model","slug":"lorashear-efficient-large-language-model","title":"LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recovery","date":"2023-10-24","arxiv_id":"2310.18356","n_code_links":2,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"1 ran (of which 0 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) · 2 unverified","official":null}},{"paper":"/paper/you-only-condense-once-two-rules-for-pruning-1","slug":"you-only-condense-once-two-rules-for-pruning-1","title":"You Only Condense Once: Two Rules for Pruning Condensed Datasets","date":"2023-10-21","arxiv_id":"2310.14019","n_code_links":1,"syntology":{"ran":13,"of":16,"n_ran_checked":11,"n_instrument":2,"unverified":3,"pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["he-y/you-only-condense-once"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/how-a-student-becomes-a-teacher-learning-and","slug":"how-a-student-becomes-a-teacher-learning-and","title":"How a student becomes a teacher: learning and forgetting through Spectral methods","date":"2023-10-19","arxiv_id":"2310.12612","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 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","official":{"repos":["jamba15/spectral-regularization-teacher-student"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/survival-of-the-most-influential-prompts","slug":"survival-of-the-most-influential-prompts","title":"Survival of the Most Influential Prompts: Efficient Black-Box Prompt Search via Clustering and Pruning","date":"2023-10-19","arxiv_id":"2310.12774","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"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) · 2 unverified","official":{"repos":["cambridgeltl/claps"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/one-shot-sensitivity-aware-mixed-sparsity","slug":"one-shot-sensitivity-aware-mixed-sparsity","title":"One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models","date":"2023-10-14","arxiv_id":"2310.09499","n_code_links":1,"syntology":{"ran":4,"of":11,"n_ran_checked":1,"n_instrument":3,"unverified":7,"pointer_only":11,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","official":{"repos":["talkking/MixGPT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/does-clip-s-generalization-performance-mainly","slug":"does-clip-s-generalization-performance-mainly","title":"Does CLIP's Generalization Performance Mainly Stem from High Train-Test Similarity?","date":"2023-10-14","arxiv_id":"2310.09562","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":1,"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","official":{"repos":["brendel-group/clip-ood"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["unlocated"]}}},{"paper":"/paper/dynamic-sparse-no-training-training-free-fine","slug":"dynamic-sparse-no-training-training-free-fine","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","date":"2023-10-13","arxiv_id":"2310.08915","n_code_links":1,"syntology":{"ran":8,"of":15,"n_ran_checked":6,"n_instrument":2,"unverified":7,"pointer_only":15,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","official":{"repos":["zyxxmu/dsnot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/d2-pruning-message-passing-for-balancing","slug":"d2-pruning-message-passing-for-balancing","title":"D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruning","date":"2023-10-11","arxiv_id":"2310.07931","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":7,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["adymaharana/d2pruning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/subp-soft-uniform-block-pruning-for-1xn","slug":"subp-soft-uniform-block-pruning-for-1xn","title":"SUBP: Soft Uniform Block Pruning for 1xN Sparse CNNs Multithreading Acceleration","date":"2023-10-10","arxiv_id":"2310.06218","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["JingyangXiang/SUBP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/sheared-llama-accelerating-language-model-pre","slug":"sheared-llama-accelerating-language-model-pre","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","date":"2023-10-10","arxiv_id":"2310.06694","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["princeton-nlp/llm-shearing"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/compressing-context-to-enhance-inference","slug":"compressing-context-to-enhance-inference","title":"Compressing Context to Enhance Inference Efficiency of Large Language Models","date":"2023-10-09","arxiv_id":"2310.06201","n_code_links":2,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 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) · 1 unverified","official":{"repos":["liyucheng09/selective_context"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/compresso-structured-pruning-with","slug":"compresso-structured-pruning-with","title":"Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models","date":"2023-10-08","arxiv_id":"2310.05015","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"3 ran (of which 0 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) · 0 unverified","official":{"repos":["microsoft/moonlit"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/outlier-weighed-layerwise-sparsity-owl-a","slug":"outlier-weighed-layerwise-sparsity-owl-a","title":"Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity","date":"2023-10-08","arxiv_id":"2310.05175","n_code_links":1,"syntology":{"ran":2,"of":6,"n_ran_checked":2,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["luuyin/owl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/robust-network-pruning-with-sparse-entropic","slug":"robust-network-pruning-with-sparse-entropic","title":"SWAP: Sparse Entropic Wasserstein Regression for Robust Network Pruning","date":"2023-10-07","arxiv_id":"2310.04918","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":4,"n_instrument":1,"unverified":0,"pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["youlei202/entropic-wasserstein-pruning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/spade-sparsity-guided-debugging-for-deep","slug":"spade-sparsity-guided-debugging-for-deep","title":"SPADE: Sparsity-Guided Debugging for Deep Neural Networks","date":"2023-10-06","arxiv_id":"2310.04519","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":3,"n_instrument":2,"unverified":4,"pointer_only":9,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["ist-daslab/spade"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/ppt-token-pruning-and-pooling-for-efficient","slug":"ppt-token-pruning-and-pooling-for-efficient","title":"PPT: Token Pruning and Pooling for Efficient Vision Transformers","date":"2023-10-03","arxiv_id":"2310.01812","n_code_links":2,"syntology":{"ran":6,"of":7,"n_ran_checked":4,"n_instrument":2,"unverified":1,"pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["xjwu1024/PPT","mindspore-lab/models"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/deepzero-scaling-up-zeroth-order-optimization","slug":"deepzero-scaling-up-zeroth-order-optimization","title":"DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Training","date":"2023-10-03","arxiv_id":"2310.02025","n_code_links":1,"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":["OPTML-Group/DeepZero"],"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"]}}},{"paper":"/paper/venom-a-vectorized-n-m-format-for-unleashing","slug":"venom-a-vectorized-n-m-format-for-unleashing","title":"VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Cores","date":"2023-10-03","arxiv_id":"2310.02065","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 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","official":{"repos":["udc-gac/venom"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/sieve-multimodal-dataset-pruning-using-image","slug":"sieve-multimodal-dataset-pruning-using-image","title":"Sieve: Multimodal Dataset Pruning Using Image Captioning Models","date":"2023-10-03","arxiv_id":"2310.02110","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["facebookresearch/sieve"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/compressing-llms-the-truth-is-rarely-pure-and","slug":"compressing-llms-the-truth-is-rarely-pure-and","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","date":"2023-10-02","arxiv_id":"2310.01382","n_code_links":1,"syntology":{"ran":2,"of":8,"n_ran_checked":1,"n_instrument":1,"unverified":6,"pointer_only":8,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","official":{"repos":["vita-group/llm-kick"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/scaling-for-training-time-and-post-hoc-out-of","slug":"scaling-for-training-time-and-post-hoc-out-of","title":"Scaling for Training Time and Post-hoc Out-of-distribution Detection Enhancement","date":"2023-09-30","arxiv_id":"2310.00227","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 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","official":{"repos":["kai422/scale"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/dreamgaussian-generative-gaussian-splatting","slug":"dreamgaussian-generative-gaussian-splatting","title":"DreamGaussian: Generative Gaussian Splatting for Efficient 3D Content Creation","date":"2023-09-28","arxiv_id":"2309.16653","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["dreamgaussian/dreamgaussian"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/comflp-correlation-measure-based-fast-search","slug":"comflp-correlation-measure-based-fast-search","title":"CoMFLP: Correlation Measure based Fast Search on ASR Layer Pruning","date":"2023-09-21","arxiv_id":"2309.11768","n_code_links":1,"syntology":{"ran":11,"of":12,"n_ran_checked":9,"n_instrument":2,"unverified":1,"pointer_only":12,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["louislau1129/comflp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/bayesian-sparsification-for-deep-neural","slug":"bayesian-sparsification-for-deep-neural","title":"Bayesian sparsification for deep neural networks with Bayesian model reduction","date":"2023-09-21","arxiv_id":"2309.12095","n_code_links":1,"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":["dimarkov/bmr4pml"],"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"]}}},{"paper":"/paper/flash-llm-enabling-cost-effective-and-highly","slug":"flash-llm-enabling-cost-effective-and-highly","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","date":"2023-09-19","arxiv_id":"2309.10285","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["alibabaresearch/flash-llm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/uncovering-neural-scaling-laws-in-molecular-1","slug":"uncovering-neural-scaling-laws-in-molecular-1","title":"Uncovering Neural Scaling Laws in Molecular Representation Learning","date":"2023-09-15","arxiv_id":"2309.15123","n_code_links":2,"syntology":{"ran":6,"of":10,"n_ran_checked":6,"n_instrument":0,"unverified":4,"pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["data-reindeer/nsl_mrl","Data-reindeer/MolScaling"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/transformer-compression-via-subspace","slug":"transformer-compression-via-subspace","title":"$\\rm SP^3$: Enhancing Structured Pruning via PCA Projection","date":"2023-08-31","arxiv_id":"2308.16475","n_code_links":1,"syntology":{"ran":12,"of":14,"n_ran_checked":11,"n_instrument":1,"unverified":2,"pointer_only":14,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["hyx1999/sp3"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-diverse-features-in-vision","slug":"learning-diverse-features-in-vision","title":"Learning Diverse Features in Vision Transformers for Improved Generalization","date":"2023-08-30","arxiv_id":"2308.16274","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"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) · 0 unverified","official":{"repos":["armandnm/diverse-vit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/increlora-incremental-parameter-allocation","slug":"increlora-incremental-parameter-allocation","title":"IncreLoRA: Incremental Parameter Allocation Method for Parameter-Efficient Fine-tuning","date":"2023-08-23","arxiv_id":"2308.12043","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["feiyuzhang98/increlora"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-robustness-of-open-world-test-time","slug":"on-the-robustness-of-open-world-test-time","title":"On the Robustness of Open-World Test-Time Training: Self-Training with Dynamic Prototype Expansion","date":"2023-08-19","arxiv_id":"2308.09942","n_code_links":1,"syntology":{"ran":9,"of":11,"n_ran_checked":9,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"9 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; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["yushu-li/owttt"],"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":["official"]}}},{"paper":"/paper/which-tokens-to-use-investigating-token","slug":"which-tokens-to-use-investigating-token","title":"Which Tokens to Use? Investigating Token Reduction in Vision Transformers","date":"2023-08-09","arxiv_id":"2308.04657","n_code_links":1,"syntology":{"ran":8,"of":8,"n_ran_checked":6,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/knowledge-preserving-pruning-for-pre-trained","slug":"knowledge-preserving-pruning-for-pre-trained","title":"Accurate Retraining-free Pruning for Pretrained Encoder-based Language Models","date":"2023-08-07","arxiv_id":"2308.03449","n_code_links":1,"syntology":{"ran":12,"of":16,"n_ran_checked":12,"n_instrument":0,"unverified":4,"pointer_only":16,"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) · 4 unverified","official":{"repos":["snudm-starlab/k-prune"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/dynamic-token-pruning-in-plain-vision","slug":"dynamic-token-pruning-in-plain-vision","title":"Dynamic Token Pruning in Plain Vision Transformers for Semantic Segmentation","date":"2023-08-02","arxiv_id":"2308.01045","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/data-centric-diet-effective-multi-center","slug":"data-centric-diet-effective-multi-center","title":"Data-Centric Diet: Effective Multi-center Dataset Pruning for Medical Image Segmentation","date":"2023-08-02","arxiv_id":"2308.01189","n_code_links":0,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 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) · 0 unverified","official":null}},{"paper":"/paper/e-2vpt-an-effective-and-efficient-approach","slug":"e-2vpt-an-effective-and-efficient-approach","title":"E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuning","date":"2023-07-25","arxiv_id":"2307.13770","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["chenghan111/e2vpt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/fmt-removing-backdoor-feature-maps-via","slug":"fmt-removing-backdoor-feature-maps-via","title":"Adversarial Feature Map Pruning for Backdoor","date":"2023-07-21","arxiv_id":"2307.11565","n_code_links":2,"syntology":{"ran":7,"of":7,"n_ran_checked":4,"n_instrument":3,"unverified":0,"pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ase2023paper/fmt","retsuh-bqw/fmp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/learned-thresholds-token-merging-and-pruning","slug":"learned-thresholds-token-merging-and-pruning","title":"Learned Thresholds Token Merging and Pruning for Vision Transformers","date":"2023-07-20","arxiv_id":"2307.10780","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":3,"n_instrument":1,"unverified":1,"pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["mxbonn/ltmp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-region-aware-neural-radiance-fields","slug":"efficient-region-aware-neural-radiance-fields","title":"Efficient Region-Aware Neural Radiance Fields for High-Fidelity Talking Portrait Synthesis","date":"2023-07-18","arxiv_id":"2307.09323","n_code_links":1,"syntology":{"ran":10,"of":12,"n_ran_checked":7,"n_instrument":3,"unverified":2,"pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["fictionarry/er-nerf"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/upscale-unconstrained-channel-pruning","slug":"upscale-unconstrained-channel-pruning","title":"UPSCALE: Unconstrained Channel Pruning","date":"2023-07-17","arxiv_id":"2307.08771","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":1,"n_instrument":4,"unverified":2,"pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["apple/ml-upscale"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/pruning-vs-quantization-which-is-better","slug":"pruning-vs-quantization-which-is-better","title":"Pruning vs Quantization: Which is Better?","date":"2023-07-06","arxiv_id":"2307.02973","n_code_links":1,"syntology":{"ran":10,"of":10,"n_ran_checked":10,"n_instrument":0,"unverified":0,"pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Qualcomm-AI-research/pruning-vs-quantization"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/improving-retrieval-augmented-large-language","slug":"improving-retrieval-augmented-large-language","title":"Improving Retrieval-Augmented Large Language Models via Data Importance Learning","date":"2023-07-06","arxiv_id":"2307.03027","n_code_links":1,"syntology":{"ran":2,"of":6,"n_ran_checked":2,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["amsterdata/ragbooster"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/filter-pruning-for-efficient-cnns-via","slug":"filter-pruning-for-efficient-cnns-via","title":"Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler","date":"2023-07-01","arxiv_id":"2307.00198","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":5,"n_instrument":2,"unverified":4,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["osilly/kdfs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-multilingual-translator-to-sql-with","slug":"a-multilingual-translator-to-sql-with","title":"A Multilingual Translator to SQL with Database Schema Pruning to Improve Self-Attention","date":"2023-06-25","arxiv_id":"2306.14256","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["c4ai/gap-text2sql"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/fantastic-weights-and-how-to-find-them-where-1","slug":"fantastic-weights-and-how-to-find-them-where-1","title":"Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training","date":"2023-06-21","arxiv_id":"2306.12230","n_code_links":1,"syntology":{"ran":15,"of":20,"n_ran_checked":13,"n_instrument":2,"unverified":5,"pointer_only":5,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","official":{"repos":["alooow/fantastic_weights_paper"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/a-simple-and-effective-pruning-approach-for","slug":"a-simple-and-effective-pruning-approach-for","title":"A Simple and Effective Pruning Approach for Large Language Models","date":"2023-06-20","arxiv_id":"2306.11695","n_code_links":7,"syntology":{"ran":9,"of":22,"n_ran_checked":6,"n_instrument":3,"unverified":13,"pointer_only":9,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 13 unverified","official":{"repos":["locuslab/wanda"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":"/paper/instant-soup-cheap-pruning-ensembles-in-a","slug":"instant-soup-cheap-pruning-ensembles-in-a","title":"Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models","date":"2023-06-18","arxiv_id":"2306.10460","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["vita-group/instant_soup"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/revisiting-token-pruning-for-object-detection","slug":"revisiting-token-pruning-for-object-detection","title":"Revisiting Token Pruning for Object Detection and Instance Segmentation","date":"2023-06-12","arxiv_id":"2306.07050","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["uzh-rpg/svit"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/large-scale-dataset-pruning-with-dynamic","slug":"large-scale-dataset-pruning-with-dynamic","title":"Large-scale Dataset Pruning with Dynamic Uncertainty","date":"2023-06-08","arxiv_id":"2306.05175","n_code_links":2,"syntology":{"ran":11,"of":11,"n_ran_checked":8,"n_instrument":3,"unverified":0,"pointer_only":7,"phrase":"11 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["baai-dcai/dataset-pruning"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/training-free-neural-architecture-search-for","slug":"training-free-neural-architecture-search-for","title":"Training-free Neural Architecture Search for RNNs and Transformers","date":"2023-06-01","arxiv_id":"2306.00288","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["aaronserianni/training-free-nas"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/lottery-tickets-in-evolutionary-optimization","slug":"lottery-tickets-in-evolutionary-optimization","title":"Lottery Tickets in Evolutionary Optimization: On Sparse Backpropagation-Free Trainability","date":"2023-05-31","arxiv_id":"2306.00045","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"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) · 0 unverified","official":{"repos":["roberttlange/es-lottery"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/out-of-distributed-semantic-pruning-for-1","slug":"out-of-distributed-semantic-pruning-for-1","title":"Out-of-Distributed Semantic Pruning for Robust Semi-Supervised Learning","date":"2023-05-29","arxiv_id":"2305.18158","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"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":["rain305f/osp"],"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"]}}},{"paper":"/paper/one-network-many-masks-towards-more-parameter","slug":"one-network-many-masks-towards-more-parameter","title":"One Network, Many Masks: Towards More Parameter-Efficient Transfer Learning","date":"2023-05-28","arxiv_id":"2305.17682","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["chaoscodes/propetl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/a-three-regime-model-of-network-pruning","slug":"a-three-regime-model-of-network-pruning","title":"A Three-regime Model of Network Pruning","date":"2023-05-28","arxiv_id":"2305.18383","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yefanzhou/threeregimepruning"],"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"]}}},{"paper":"/paper/pruning-meets-low-rank-parameter-efficient","slug":"pruning-meets-low-rank-parameter-efficient","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","date":"2023-05-28","arxiv_id":"2305.18403","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["aim-uofa/loraprune"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/is-centralized-training-with-decentralized","slug":"is-centralized-training-with-decentralized","title":"Is Centralized Training with Decentralized Execution Framework Centralized Enough for MARL?","date":"2023-05-27","arxiv_id":"2305.17352","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 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","official":{"repos":["zyh1999/cadp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/pumer-pruning-and-merging-tokens-for","slug":"pumer-pruning-and-merging-tokens-for","title":"PuMer: Pruning and Merging Tokens for Efficient Vision Language Models","date":"2023-05-27","arxiv_id":"2305.17530","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["csarron/pumer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/improving-knowledge-distillation-via-1","slug":"improving-knowledge-distillation-via-1","title":"Improving Knowledge Distillation via Regularizing Feature Norm and Direction","date":"2023-05-26","arxiv_id":"2305.17007","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["wangyz1608/knowledge-distillation-via-nd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/comcat-towards-efficient-compression-and","slug":"comcat-towards-efficient-compression-and","title":"COMCAT: Towards Efficient Compression and Customization of Attention-Based Vision Models","date":"2023-05-26","arxiv_id":"2305.17235","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["jinqixiao/ComCAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-architectural-compression-of-text-to-image","slug":"on-architectural-compression-of-text-to-image","title":"BK-SDM: A Lightweight, Fast, and Cheap Version of Stable Diffusion","date":"2023-05-25","arxiv_id":"2305.15798","n_code_links":3,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Nota-NetsPresso/BK-SDM","segmind/distill-sd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/candidate-set-re-ranking-for-composed-image","slug":"candidate-set-re-ranking-for-composed-image","title":"Candidate Set Re-ranking for Composed Image Retrieval with Dual Multi-modal Encoder","date":"2023-05-25","arxiv_id":"2305.16304","n_code_links":2,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["Cuberick-Orion/Candidate-Reranking-CIR"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/pruning-pre-trained-language-models-with","slug":"pruning-pre-trained-language-models-with","title":"Pruning Pre-trained Language Models with Principled Importance and Self-regularization","date":"2023-05-21","arxiv_id":"2305.12394","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"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) · 0 unverified","official":{"repos":["drsy/pins"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/joint-token-pruning-and-squeezing-towards","slug":"joint-token-pruning-and-squeezing-towards","title":"Joint Token Pruning and Squeezing Towards More Aggressive Compression of Vision Transformers","date":"2023-04-21","arxiv_id":"2304.10716","n_code_links":1,"syntology":{"ran":4,"of":8,"n_ran_checked":3,"n_instrument":1,"unverified":4,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["megvii-research/tps-cvpr2023"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/line-out-of-distribution-detection-by","slug":"line-out-of-distribution-detection-by","title":"LINe: Out-of-Distribution Detection by Leveraging Important Neurons","date":"2023-03-24","arxiv_id":"2303.13995","n_code_links":1,"syntology":{"ran":17,"of":20,"n_ran_checked":10,"n_instrument":7,"unverified":3,"pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","official":{"repos":["yonghyun-ahn/line-out-of-distribution-detection-by-leveraging-important-neurons"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/dynamic-structure-pruning-for-compressing","slug":"dynamic-structure-pruning-for-compressing","title":"Dynamic Structure Pruning for Compressing CNNs","date":"2023-03-17","arxiv_id":"2303.09736","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":7,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["irishev/dsp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/one-4-all-neural-potential-fields-for","slug":"one-4-all-neural-potential-fields-for","title":"One-4-All: Neural Potential Fields for Embodied Navigation","date":"2023-03-07","arxiv_id":"2303.04011","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":"/paper/trojtext-test-time-invisible-textual-trojan","slug":"trojtext-test-time-invisible-textual-trojan","title":"TrojText: Test-time Invisible Textual Trojan Insertion","date":"2023-03-03","arxiv_id":"2303.02242","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["ucf-ml-research/trojtext"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/acceltran-a-sparsity-aware-accelerator-for","slug":"acceltran-a-sparsity-aware-accelerator-for","title":"AccelTran: A Sparsity-Aware Accelerator for Dynamic Inference with Transformers","date":"2023-02-28","arxiv_id":"2302.14705","n_code_links":1,"syntology":{"ran":6,"of":9,"n_ran_checked":6,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["jha-lab/acceltran"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-unified-framework-for-soft-threshold","slug":"a-unified-framework-for-soft-threshold","title":"A Unified Framework for Soft Threshold Pruning","date":"2023-02-25","arxiv_id":"2302.13019","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yanqi-chen/lats"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/lever-learning-to-verify-language-to-code","slug":"lever-learning-to-verify-language-to-code","title":"LEVER: Learning to Verify Language-to-Code Generation with Execution","date":"2023-02-16","arxiv_id":"2302.08468","n_code_links":1,"syntology":{"ran":18,"of":22,"n_ran_checked":18,"n_instrument":0,"unverified":4,"pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 1 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["niansong1996/lever"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/pruning-deep-neural-networks-from-a-sparsity-1","slug":"pruning-deep-neural-networks-from-a-sparsity-1","title":"Pruning Deep Neural Networks from a Sparsity Perspective","date":"2023-02-11","arxiv_id":"2302.05601","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":{"repos":["diaoenmao/pruning-deep-neural-networks-from-a-sparsity-perspective"],"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"]}}},{"paper":"/paper/what-matters-in-the-structured-pruning-of","slug":"what-matters-in-the-structured-pruning-of","title":"What Matters In The Structured Pruning of Generative Language Models?","date":"2023-02-07","arxiv_id":"2302.03773","n_code_links":1,"syntology":{"ran":2,"of":8,"n_ran_checked":2,"n_instrument":0,"unverified":6,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["huggingface/nn_pruning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/depgraph-towards-any-structural-pruning","slug":"depgraph-towards-any-structural-pruning","title":"DepGraph: Towards Any Structural Pruning","date":"2023-01-30","arxiv_id":"2301.12900","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":7,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["VainF/Torch-Pruning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-latency-aware-cnn-depth-compression","slug":"efficient-latency-aware-cnn-depth-compression","title":"Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming","date":"2023-01-28","arxiv_id":"2301.12187","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["snu-mllab/efficient-cnn-depth-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/massive-language-models-can-be-accurately","slug":"massive-language-models-can-be-accurately","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","date":"2023-01-02","arxiv_id":"2301.00774","n_code_links":6,"syntology":{"ran":9,"of":12,"n_ran_checked":7,"n_instrument":2,"unverified":3,"pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["ist-daslab/sparsegpt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/gradient-based-intra-attention-pruning-on-pre","slug":"gradient-based-intra-attention-pruning-on-pre","title":"Gradient-based Intra-attention Pruning on Pre-trained Language Models","date":"2022-12-15","arxiv_id":"2212.07634","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["airaria/grain"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/diggan-discriminator-gradient-gap","slug":"diggan-discriminator-gradient-gap","title":"DigGAN: Discriminator gradIent Gap Regularization for GAN Training with Limited Data","date":"2022-11-27","arxiv_id":"2211.14694","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"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":["ailsaf/diggan"],"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"]}}},{"paper":"/paper/transform-once-efficient-operator-learning-in","slug":"transform-once-efficient-operator-learning-in","title":"Transform Once: Efficient Operator Learning in Frequency Domain","date":"2022-11-26","arxiv_id":"2211.14453","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":1,"n_instrument":2,"unverified":2,"pointer_only":5,"phrase":"3 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; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["diffeqml/kairos"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/galvatron-efficient-transformer-training-over","slug":"galvatron-efficient-transformer-training-over","title":"Galvatron: Efficient Transformer Training over Multiple GPUs Using Automatic Parallelism","date":"2022-11-25","arxiv_id":"2211.13878","n_code_links":3,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["pku-dair/hetu"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/a-fair-loss-function-for-network-pruning","slug":"a-fair-loss-function-for-network-pruning","title":"A Fair Loss Function for Network Pruning","date":"2022-11-18","arxiv_id":"2211.10285","n_code_links":1,"syntology":{"ran":8,"of":12,"n_ran_checked":6,"n_instrument":2,"unverified":4,"pointer_only":12,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["robbiemeyer/pw_loss_pruning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/structured-pruning-adapters","slug":"structured-pruning-adapters","title":"Structured Pruning Adapters","date":"2022-11-17","arxiv_id":"2211.10155","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lukashedegaard/structured-pruning-adapters"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/finding-skill-neurons-in-pre-trained","slug":"finding-skill-neurons-in-pre-trained","title":"Finding Skill Neurons in Pre-trained Transformer-based Language Models","date":"2022-11-14","arxiv_id":"2211.07349","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["thu-keg/skill-neuron"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/multitasking-models-are-robust-to-structural","slug":"multitasking-models-are-robust-to-structural","title":"Multitasking Models are Robust to Structural Failure: A Neural Model for Bilingual Cognitive Reserve","date":"2022-10-20","arxiv_id":"2210.11618","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":0,"n_instrument":4,"unverified":1,"pointer_only":5,"phrase":"4 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; 4 where Syntology's instrument failed) · 1 unverified","official":{"repos":["giannisdaras/multilingual_robustness"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/token-merging-your-vit-but-faster","slug":"token-merging-your-vit-but-faster","title":"Token Merging: Your ViT But Faster","date":"2022-10-17","arxiv_id":"2210.09461","n_code_links":5,"syntology":{"ran":5,"of":5,"n_ran_checked":2,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["facebookresearch/tome"],"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":["listed","official","unlocated"]}}},{"paper":"/paper/efficientvlm-fast-and-accurate-vision","slug":"efficientvlm-fast-and-accurate-vision","title":"EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruning","date":"2022-10-14","arxiv_id":"2210.07795","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":4,"n_instrument":3,"unverified":2,"pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["swaggy-tn/efficientvlm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/structural-pruning-via-latency-saliency","slug":"structural-pruning-via-latency-saliency","title":"Structural Pruning via Latency-Saliency Knapsack","date":"2022-10-13","arxiv_id":"2210.06659","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"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":null}},{"paper":"/paper/pruning-adversarially-robust-neural-networks","slug":"pruning-adversarially-robust-neural-networks","title":"Pruning Adversarially Robust Neural Networks without Adversarial Examples","date":"2022-10-09","arxiv_id":"2210.04311","n_code_links":1,"syntology":{"ran":6,"of":14,"n_ran_checked":5,"n_instrument":1,"unverified":8,"pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","official":{"repos":["neu-spiral/pwoa"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":"/paper/advancing-model-pruning-via-bi-level","slug":"advancing-model-pruning-via-bi-level","title":"Advancing Model Pruning via Bi-level Optimization","date":"2022-10-08","arxiv_id":"2210.04092","n_code_links":1,"syntology":{"ran":1,"of":7,"n_ran_checked":1,"n_instrument":0,"unverified":6,"pointer_only":7,"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) · 6 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["optml-group/bip"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/adaptive-sparse-vit-towards-learnable","slug":"adaptive-sparse-vit-towards-learnable","title":"Adaptive Sparse ViT: Towards Learnable Adaptive Token Pruning by Fully Exploiting Self-Attention","date":"2022-09-28","arxiv_id":"2209.13802","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"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":["cydia2018/as-vit"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"paper":"/paper/cryptogcn-fast-and-scalable-homomorphically","slug":"cryptogcn-fast-and-scalable-homomorphically","title":"CryptoGCN: Fast and Scalable Homomorphically Encrypted Graph Convolutional Network Inference","date":"2022-09-24","arxiv_id":"2209.11904","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":4,"n_instrument":1,"unverified":2,"pointer_only":7,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ranran0523/cryptogcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/towards-sparsification-of-graph-neural","slug":"towards-sparsification-of-graph-neural","title":"Towards Sparsification of Graph Neural Networks","date":"2022-09-11","arxiv_id":"2209.04766","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":4,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["harveyp123/iccd_sptrn_slr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/pointclm-a-contrastive-learning-based","slug":"pointclm-a-contrastive-learning-based","title":"PointCLM: A Contrastive Learning-based Framework for Multi-instance Point Cloud Registration","date":"2022-09-01","arxiv_id":"2209.00219","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 2 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) · 0 unverified","official":{"repos":["phdymz/pointclm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/ribac-towards-robust-and-imperceptible","slug":"ribac-towards-robust-and-imperceptible","title":"RIBAC: Towards Robust and Imperceptible Backdoor Attack against Compact DNN","date":"2022-08-22","arxiv_id":"2208.10608","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":0,"n_instrument":1,"unverified":3,"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) · 3 unverified","official":{"repos":["huyvnphan/eccv2022-ribac"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/cram-a-compression-aware-minimizer","slug":"cram-a-compression-aware-minimizer","title":"CrAM: A Compression-Aware Minimizer","date":"2022-07-28","arxiv_id":"2207.14200","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["ist-daslab/cram"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/fairgrape-fairness-aware-gradient-pruning","slug":"fairgrape-fairness-aware-gradient-pruning","title":"FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classification","date":"2022-07-22","arxiv_id":"2207.10888","n_code_links":1,"syntology":{"ran":3,"of":7,"n_ran_checked":3,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"3 ran (of which 0 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) · 4 unverified","official":{"repos":["bernardo1998/fairgrape"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/supertickets-drawing-task-agnostic-lottery","slug":"supertickets-drawing-task-agnostic-lottery","title":"SuperTickets: Drawing Task-Agnostic Lottery Tickets from Supernets via Jointly Architecture Searching and Parameter Pruning","date":"2022-07-08","arxiv_id":"2207.03677","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":{"repos":["rice-eic/supertickets"],"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"]}}},{"paper":"/paper/platon-pruning-large-transformer-models-with","slug":"platon-pruning-large-transformer-models-with","title":"PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance","date":"2022-06-25","arxiv_id":"2206.12562","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["qingruzhang/platon"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/winning-the-lottery-ahead-of-time-efficient","slug":"winning-the-lottery-ahead-of-time-efficient","title":"Winning the Lottery Ahead of Time: Efficient Early Network Pruning","date":"2022-06-21","arxiv_id":"2206.10451","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["johnrachwan123/Early-Cropression-via-Gradient-Flow-Preservation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/voxgraf-fast-3d-aware-image-synthesis-with","slug":"voxgraf-fast-3d-aware-image-synthesis-with","title":"VoxGRAF: Fast 3D-Aware Image Synthesis with Sparse Voxel Grids","date":"2022-06-15","arxiv_id":"2206.07695","n_code_links":1,"syntology":{"ran":17,"of":18,"n_ran_checked":15,"n_instrument":2,"unverified":1,"pointer_only":6,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 4 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["autonomousvision/voxgraf"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/zeroth-order-topological-insights-into","slug":"zeroth-order-topological-insights-into","title":"Zeroth-Order Topological Insights into Iterative Magnitude Pruning","date":"2022-06-14","arxiv_id":"2206.06563","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":null}}],"record_sha256":"bdd218838138c3110618903f62acb8bd57005790877a2bd732d085dfe74077c1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}