{"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 (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":14,"of":14,"tagged_in_all":34,"items":[{"url":"/paper/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":0,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/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","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","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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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","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","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_unverified":3,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","title":"Decomposable-Net: Scalable Low-Rank Compression for Neural Networks","date":"2019-10-29","arxiv_id":"1910.13141","repositories_listed":1,"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"},"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-09-25T09:33:49+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}