{"url":"/task/computational-efficiency","name":"Computational Efficiency","slug":"computational-efficiency","description_markdown":"Methods and optimizations to reduce the computational resources (e.g., time, memory, or power) needed for training and inference in models. This involves techniques that streamline processing, optimize algorithms, or leverage hardware to enhance performance without compromising accuracy.","categories":[{"name":"Methodology","url":"/area/methodology"},{"name":"Miscellaneous","url":"/area/miscellaneous"},{"name":"Time Series","url":"/area/time-series"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":4891,"papers_with_code":1644,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":[{"leaderboard":"/sota/computational-efficiency-on-plant-village","slug":"computational-efficiency-on-plant-village","dataset":"Plant village","dataset_url":null,"rows_in_archive":1,"metrics":["Hamming Loss"],"first_row_in_archive_order":{"model":"ViTaL","paper_title":"ViTaL: An Advanced Framework for Automated Plant Disease Identification in Leaf Images Using Vision Transformers and Linear Projection For Feature Reduction","paper_url":"/paper/vital-an-advanced-framework-for-automated","paper_date":"2024-02-27","arxiv_id":"2402.17424","code_links":[{"title":"abby1712/ViTaL","url":"https://github.com/abby1712/ViTaL"}],"syntology":null}}],"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":30,"of":1644,"tagged_in_all":4891,"items":[{"url":"/paper/rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","arxiv_id":"1512.00567","repositories_listed":113,"syntology":{"n":26,"n_ran":5,"n_unverified":21,"n_pointer_only":4}},{"url":"/paper/attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","arxiv_id":"1804.03999","repositories_listed":37,"syntology":{"n":28,"n_ran":8,"n_unverified":20,"n_pointer_only":7}},{"url":"/paper/mamba-linear-time-sequence-modeling-with","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","date":"2023-12-01","arxiv_id":"2312.00752","repositories_listed":35,"syntology":{"n":62,"n_ran":18,"n_unverified":44,"n_pointer_only":28}},{"url":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","arxiv_id":"2303.14535","repositories_listed":33,"syntology":{"n":35,"n_ran":1,"n_unverified":34,"n_pointer_only":0}},{"url":"/paper/simple-random-search-provides-a-competitive","title":"Simple random search provides a competitive approach to reinforcement learning","date":"2018-03-19","arxiv_id":"1803.07055","repositories_listed":26,"syntology":{"n":15,"n_ran":3,"n_unverified":12,"n_pointer_only":3}},{"url":"/paper/efficient-neural-network-robustness","title":"Efficient Neural Network Robustness Certification with General Activation Functions","date":"2018-11-02","arxiv_id":"1811.00866","repositories_listed":16,"syntology":{"n":43,"n_ran":4,"n_unverified":39,"n_pointer_only":3}},{"url":"/paper/rwkv-reinventing-rnns-for-the-transformer-era","title":"RWKV: Reinventing RNNs for the Transformer Era","date":"2023-05-22","arxiv_id":"2305.13048","repositories_listed":14,"syntology":{"n":11,"n_ran":3,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/vmamba-visual-state-space-model","title":"VMamba: Visual State Space Model","date":"2024-01-18","arxiv_id":"2401.10166","repositories_listed":13,"syntology":{"n":46,"n_ran":20,"n_unverified":26,"n_pointer_only":0}},{"url":"/paper/kimera-an-open-source-library-for-real-time","title":"Kimera: an Open-Source Library for Real-Time Metric-Semantic Localization and Mapping","date":"2019-10-06","arxiv_id":"1910.02490","repositories_listed":12,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/resurrecting-recurrent-neural-networks-for","title":"Resurrecting Recurrent Neural Networks for Long Sequences","date":"2023-03-11","arxiv_id":"2303.06349","repositories_listed":11,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/pp-ocr-a-practical-ultra-lightweight-ocr","title":"PP-OCR: A Practical Ultra Lightweight OCR System","date":"2020-09-21","arxiv_id":"2009.09941","repositories_listed":10,"syntology":{"n":12,"n_ran":0,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/pointnetlk-robust-efficient-point-cloud","title":"PointNetLK: Robust & Efficient Point Cloud Registration using PointNet","date":"2019-03-13","arxiv_id":"1903.05711","repositories_listed":7,"syntology":{"n":24,"n_ran":2,"n_unverified":22,"n_pointer_only":22}},{"url":"/paper/scalable-bayesian-rule-lists","title":"Scalable Bayesian Rule Lists","date":"2016-02-27","arxiv_id":"1602.08610","repositories_listed":7,"syntology":null},{"url":"/paper/dnabert-2-efficient-foundation-model-and","title":"DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome","date":"2023-06-26","arxiv_id":"2306.15006","repositories_listed":6,"syntology":{"n":23,"n_ran":8,"n_unverified":15,"n_pointer_only":0}},{"url":"/paper/simplified-state-space-layers-for-sequence","title":"Simplified State Space Layers for Sequence Modeling","date":"2022-08-09","arxiv_id":"2208.04933","repositories_listed":6,"syntology":{"n":19,"n_ran":4,"n_unverified":15,"n_pointer_only":3}},{"url":"/paper/a-transformer-based-framework-for-1","title":"A Transformer-based Framework for Multivariate Time Series Representation Learning","date":"2020-10-06","arxiv_id":"2010.02803","repositories_listed":6,"syntology":{"n":32,"n_ran":5,"n_unverified":27,"n_pointer_only":2}},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","repositories_listed":6,"syntology":null},{"url":"/paper/continual-learning-through-synaptic","title":"Continual Learning Through Synaptic Intelligence","date":"2017-03-13","arxiv_id":"1703.04200","repositories_listed":6,"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/reinforce-a-simple-and-efficient-approach-for","title":"REINFORCE++: A Simple and Efficient Approach for Aligning Large Language Models","date":"2025-01-04","arxiv_id":"2501.03262","repositories_listed":5,"syntology":null},{"url":"/paper/convmae-masked-convolution-meets-masked","title":"ConvMAE: Masked Convolution Meets Masked Autoencoders","date":"2022-05-08","arxiv_id":"2205.03892","repositories_listed":5,"syntology":{"n":10,"n_ran":5,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/multi-level-wavelet-cnn-for-image-restoration","title":"Multi-level Wavelet-CNN for Image Restoration","date":"2018-05-18","arxiv_id":"1805.07071","repositories_listed":5,"syntology":null},{"url":"/paper/graphgan-graph-representation-learning-with","title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","date":"2017-11-22","arxiv_id":"1711.08267","repositories_listed":5,"syntology":null},{"url":"/paper/distribution-free-predictive-inference-for","title":"Distribution-Free Predictive Inference For Regression","date":"2016-04-14","arxiv_id":"1604.04173","repositories_listed":5,"syntology":null},{"url":"/paper/towards-good-practices-for-very-deep-two","title":"Towards Good Practices for Very Deep Two-Stream ConvNets","date":"2015-07-08","arxiv_id":"1507.02159","repositories_listed":5,"syntology":null},{"url":"/paper/high-performance-training-and-inference-for","title":"High-performance training and inference for deep equivariant interatomic potentials","date":"2025-04-22","arxiv_id":"2504.16068","repositories_listed":4,"syntology":{"n":6,"n_ran":0,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/comet-fine-grained-computation-communication","title":"Comet: Fine-grained Computation-communication Overlapping for Mixture-of-Experts","date":"2025-02-27","arxiv_id":"2502.19811","repositories_listed":4,"syntology":{"n":20,"n_ran":1,"n_unverified":19,"n_pointer_only":0}},{"url":"/paper/simba-simplicity-bias-for-scaling-up","title":"SimBa: Simplicity Bias for Scaling Up Parameters in Deep Reinforcement Learning","date":"2024-10-13","arxiv_id":"2410.09754","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/u-net-v2-rethinking-the-skip-connections-of-u","title":"U-Net v2: Rethinking the Skip Connections of U-Net for Medical Image Segmentation","date":"2023-11-29","arxiv_id":"2311.17791","repositories_listed":4,"syntology":null},{"url":"/paper/vocos-closing-the-gap-between-time-domain-and","title":"Vocos: Closing the gap between time-domain and Fourier-based neural vocoders for high-quality audio synthesis","date":"2023-06-01","arxiv_id":"2306.00814","repositories_listed":4,"syntology":{"n":16,"n_ran":5,"n_unverified":11,"n_pointer_only":0}},{"url":"/paper/audioldm-text-to-audio-generation-with-latent","title":"AudioLDM: Text-to-Audio Generation with Latent Diffusion Models","date":"2023-01-29","arxiv_id":"2301.12503","repositories_listed":4,"syntology":{"n":21,"n_ran":8,"n_unverified":13,"n_pointer_only":10}}],"syntology_records":22,"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-24T18:15:14+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"}}