{"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/low-rank-compression","name":"Low-rank compression","slug":"low-rank-compression","description_markdown":null,"categories":[{"name":"Computer Code","url":"/area/computer-code"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":34,"papers_with_code":14,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"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":1,"rows_per_page":100,"shown":34,"of":34,"of_with_code":14,"tagged_in_all":34,"counts":{"archive_papers_tagged":34,"with_a_code_link":14,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":34,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/compressing-neural-networks-towards","slug":"compressing-neural-networks-towards","title":"Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decomposition","date":"2021-07-23","arxiv_id":"2107.11442","repositories_listed":2,"syntology":{"n":12,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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) · 9 unverified","sample_list":"/paper/compressing-neural-networks-towards#ran","syntology_url":"https://syntology.ai/paper/2107.11442","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.11442"}},"official":{"repos":["lucaslie/torchprune"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/domain-adaptive-deep-network-compression","slug":"domain-adaptive-deep-network-compression","title":"Domain-adaptive deep network compression","date":"2017-09-04","arxiv_id":"1709.01041","repositories_listed":2,"syntology":null},{"url":"/paper/recalkv-low-rank-kv-cache-compression-via","slug":"recalkv-low-rank-kv-cache-compression-via","title":"ReCalKV: Low-Rank KV Cache Compression via Head Reordering and Offline Calibration","date":"2025-05-30","arxiv_id":"2505.24357","repositories_listed":1,"syntology":null},{"url":"/paper/liteasr-efficient-automatic-speech","slug":"liteasr-efficient-automatic-speech","title":"LiteASR: Efficient Automatic Speech Recognition with Low-Rank Approximation","date":"2025-02-27","arxiv_id":"2502.20583","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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","sample_list":"/paper/liteasr-efficient-automatic-speech#ran","syntology_url":"https://syntology.ai/paper/2502.20583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.20583"}},"official":{"repos":["efeslab/liteasr"],"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":["official"]}}},{"url":"/paper/calor-towards-comprehensive-model-inversion","slug":"calor-towards-comprehensive-model-inversion","title":"CALoR: Towards Comprehensive Model Inversion Defense","date":"2024-10-08","arxiv_id":"2410.05814","repositories_listed":1,"syntology":null},{"url":"/paper/unified-low-rank-compression-framework-for","slug":"unified-low-rank-compression-framework-for","title":"Unified Low-rank Compression Framework for Click-through Rate Prediction","date":"2024-05-28","arxiv_id":"2405.18146","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-gradient-compression-with-error","slug":"low-rank-gradient-compression-with-error","title":"Efficient Wireless Federated Learning via Low-Rank Gradient Factorization","date":"2024-01-15","arxiv_id":"2401.07496","repositories_listed":1,"syntology":null},{"url":"/paper/maestro-uncovering-low-rank-structures-via","slug":"maestro-uncovering-low-rank-structures-via","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","date":"2023-08-28","arxiv_id":"2308.14929","repositories_listed":1,"syntology":{"n":18,"n_ran":15,"n_constructed":1,"n_ran_checked":11,"n_instrument":4,"n_unverified":3,"n_honours":2,"n_violates":2,"n_no_contract":7,"n_pointer_only":0,"phrase":"15 ran (of which 1 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 2 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/maestro-uncovering-low-rank-structures-via#ran","syntology_url":"https://syntology.ai/paper/2308.14929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14929"}},"official":{"repos":["samuelhorvath/maestro-lod"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":1,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tt-nf-tensor-train-neural-fields","slug":"tt-nf-tensor-train-neural-fields","title":"TT-NF: Tensor Train Neural Fields","date":"2022-09-30","arxiv_id":"2209.15529","repositories_listed":1,"syntology":null},{"url":"/paper/compact-model-training-by-low-rank-projection","slug":"compact-model-training-by-low-rank-projection","title":"Compact Model Training by Low-Rank Projection with Energy Transfer","date":"2022-04-12","arxiv_id":"2204.05566","repositories_listed":1,"syntology":null},{"url":"/paper/model-compression-as-constrained-optimization-2","slug":"model-compression-as-constrained-optimization-2","title":"Model compression as constrained optimization, with application to neural nets. Part V: combining compressions","date":"2021-07-09","arxiv_id":"2107.04380","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-compression-of-neural-nets-learning","slug":"low-rank-compression-of-neural-nets-learning","title":"Low-Rank Compression of Neural Nets: Learning the Rank of Each Layer","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-flexible-extensible-software-framework-for","slug":"a-flexible-extensible-software-framework-for","title":"A flexible, extensible software framework for model compression based on the LC algorithm","date":"2020-05-15","arxiv_id":"2005.07786","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-deep-neural-networks-via-low-rank-1","slug":"scalable-deep-neural-networks-via-low-rank-1","title":"Decomposable-Net: Scalable Low-Rank Compression for Neural Networks","date":"2019-10-29","arxiv_id":"1910.13141","repositories_listed":1,"syntology":null},{"url":null,"slug":"mlorc-momentum-low-rank-compression-for-large","title":"MLorc: Momentum Low-rank Compression for Large Language Model Adaptation","date":"2025-06-02","arxiv_id":"2506.01897","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamical-low-rank-compression-of-neural","title":"Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks","date":"2025-05-12","arxiv_id":"2505.08022","repositories_listed":0,"syntology":null},{"url":null,"slug":"cognitive-memory-in-large-language-models","title":"Cognitive Memory in Large Language Models","date":"2025-04-03","arxiv_id":"2504.02441","repositories_listed":0,"syntology":null},{"url":null,"slug":"penrose-tiled-low-rank-compression-and","title":"Penrose Tiled Low-Rank Compression and Section-Wise Q&A Fine-Tuning: A General Framework for Domain-Specific Large Language Model Adaptation","date":"2025-03-28","arxiv_id":"2503.22074","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-compression-for-imc-arrays","title":"Low-Rank Compression for IMC Arrays","date":"2025-02-10","arxiv_id":"2502.07820","repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-guarantees-for-low-rank","title":"Theoretical Guarantees for Low-Rank Compression of Deep Neural Networks","date":"2025-02-04","arxiv_id":"2502.02766","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-pruning-of-pretrained-transformer","title":"Adaptive Pruning of Pretrained Transformer via Differential Inclusions","date":"2025-01-06","arxiv_id":"2501.03289","repositories_listed":0,"syntology":null},{"url":null,"slug":"lorc-low-rank-compression-for-llms-kv-cache","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","date":"2024-10-04","arxiv_id":"2410.03111","repositories_listed":0,"syntology":null},{"url":null,"slug":"basis-selection-low-rank-decomposition-of","title":"Basis Selection: Low-Rank Decomposition of Pretrained Large Language Models for Target Applications","date":"2024-05-24","arxiv_id":"2405.15877","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-based-low-rank-compression-of-large","title":"Feature-based Low-Rank Compression of Large Language Models via Bayesian Optimization","date":"2024-05-17","arxiv_id":"2405.10616","repositories_listed":0,"syntology":null},{"url":null,"slug":"elrt-efficient-low-rank-training-for-compact","title":"ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networks","date":"2024-01-18","arxiv_id":"2401.10341","repositories_listed":0,"syntology":null},{"url":null,"slug":"haloc-hardware-aware-automatic-low-rank","title":"HALOC: Hardware-Aware Automatic Low-Rank Compression for Compact Neural Networks","date":"2023-01-20","arxiv_id":"2301.09422","repositories_listed":0,"syntology":null},{"url":null,"slug":"drone-data-aware-low-rank-compression-for","title":"DRONE: Data-aware Low-rank Compression for Large NLP Models","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-highly-effective-low-rank-compression-of","title":"A Highly Effective Low-Rank Compression of Deep Neural Networks with Modified Beam-Search and Modified Stable Rank","date":"2021-11-30","arxiv_id":"2111.15179","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedhm-efficient-federated-learning-for","title":"FedHM: Efficient Federated Learning for Heterogeneous Models via Low-rank Factorization","date":"2021-11-29","arxiv_id":"2111.14655","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-tensor-product-based-tensordecomposition","title":"Semi-tensor Product-based TensorDecomposition for Neural Network Compression","date":"2021-09-30","arxiv_id":"2109.15200","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-federated-learning-6","title":"Communication-Efficient Federated Learning with Dual-Side Low-Rank Compression","date":"2021-04-26","arxiv_id":"2104.12416","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-aware-low-rank-compression-for-large-nlp","title":"Data-aware Low-Rank Compression for Large NLP Models","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"antman-sparse-low-rank-compression-to-1","title":"AntMan: Sparse Low-Rank Compression to Accelerate RNN inference","date":"2019-10-02","arxiv_id":"1910.01740","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-fpga-based-lstms-under","title":"Approximate FPGA-based LSTMs under Computation Time Constraints","date":"2018-01-07","arxiv_id":"1801.02190","repositories_listed":0,"syntology":null}],"syntology_records":3,"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":3,"papers_where_code_ran_first_page":"/task/low-rank-compression/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":"ran","page":1,"of":1,"url":"/task/low-rank-compression/papers/ran/1","json":"/task/low-rank-compression/papers/ran/1.json","rows":3}],"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":"94a5c7a8ae9f69842ec8a8f0108b48bfa031d4710e7021ef459399d6fddfa429","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}