{"list":"other","total":71,"rows":[{"id":"2010.11929","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","created":"2020-10-22","cited_by_count":30186},{"id":"2407.21783","title":"The Llama 3 Herd of Models","created":"2024-07-31","cited_by_count":14715},{"id":"2106.09685","title":"LoRA: Low-Rank Adaptation of Large Language Models","created":"2021-06-17","cited_by_count":14380},{"id":"1803.05457","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","created":"2018-03-14","cited_by_count":4886},{"id":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"id":"1504.08083","title":"Fast R-CNN","created":"2015-04-30","cited_by_count":2933},{"id":"1911.11641","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","created":"2019-11-26","cited_by_count":2883},{"id":"1905.10044","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","created":"2019-05-24","cited_by_count":2183},{"id":"1809.02789","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","created":"2018-09-08","cited_by_count":2164},{"id":"1306.5151","title":"Fine-Grained Visual Classification of Aircraft","created":"2013-06-21","cited_by_count":1726},{"id":"1702.03118","title":"Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning","created":"2017-02-10","cited_by_count":950},{"id":"2112.08654","title":"Learning to Prompt for Continual Learning","created":"2021-12-16","cited_by_count":944},{"id":"2205.05638","title":"Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learning","created":"2022-05-11","cited_by_count":896},{"id":"2402.09353","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","created":"2024-02-14","cited_by_count":758},{"id":"2205.13535","title":"AdaptFormer: Adapting Vision Transformers for Scalable Visual Recognition","created":"2022-05-26","cited_by_count":719},{"id":"2403.06764","title":"An Image is Worth 1/2 Tokens After Layer 2: Plug-and-Play Inference Acceleration for Large Vision-Language Models","created":"2024-03-11","cited_by_count":642},{"id":"2311.17043","title":"LLaMA-VID: An Image is Worth 2 Tokens in Large Language Models","created":"2023-11-28","cited_by_count":546},{"id":"1910.04867","title":"A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmark","created":"2019-10-01","cited_by_count":425},{"id":"2410.04417","title":"SparseVLM: Visual Token Sparsification for Efficient Vision-Language Model Inference","created":"2024-10-06","cited_by_count":391},{"id":"2303.11305","title":"SVDiff: Compact Parameter Space for Diffusion Fine-Tuning","created":"2023-03-20","cited_by_count":338},{"id":"2304.01933","title":"LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Models","created":"2023-04-04","cited_by_count":324},{"id":"2210.08823","title":"Scaling & Shifting Your Features: A New Baseline for Efficient Model Tuning","created":"2022-10-17","cited_by_count":294},{"id":"2403.07378","title":"SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression","created":"2024-03-12","cited_by_count":243},{"id":"2210.07558","title":"DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptation","created":"2022-10-14","cited_by_count":233},{"id":"2404.00228","title":"InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learning","created":"2024-03-30","cited_by_count":198},{"id":"2004.09602","title":"Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluation","created":"2020-04-20","cited_by_count":188},{"id":"2303.17015","title":"HyperDiffusion: Generating Implicit Neural Fields with Weight-Space Diffusion","created":"2023-03-29","cited_by_count":152},{"id":"2402.11187","title":"LaCo: Large Language Model Pruning via Layer Collapse","created":"2024-02-17","cited_by_count":126},{"id":"2311.06243","title":"Parameter-Efficient Orthogonal Finetuning via Butterfly Factorization","created":"2023-11-10","cited_by_count":114},{"id":"2204.07154","title":"MiniViT: Compressing Vision Transformers with Weight Multiplexing","created":"2022-04-14","cited_by_count":88},{"id":"2405.20985","title":"DeCo: Decoupling Token Compression from Semantic Abstraction in Multimodal Large Language Models","created":"2024-05-31","cited_by_count":75},{"id":"2107.01378","title":"Learning Efficient Vision Transformers via Fine-Grained Manifold Distillation","created":"2021-07-03","cited_by_count":60},{"id":"2405.19597","title":"SVFT: Parameter-Efficient Fine-Tuning with Singular Vectors","created":"2024-05-30","cited_by_count":58},{"id":"2301.13741","title":"UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformers","created":"2023-01-31","cited_by_count":54},{"id":"2305.18403","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","created":"2023-05-28","cited_by_count":53},{"id":"2405.15179","title":"VB-LoRA: Extreme Parameter Efficient Fine-Tuning with Vector Banks","created":"2024-05-24","cited_by_count":52},{"id":"2401.04679","title":"RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation","created":"2024-01-09","cited_by_count":48},{"id":"2311.11261","title":"Adversarial Prompt Tuning for Vision-Language Models","created":"2023-11-19","cited_by_count":44},{"id":"2412.18110","title":"SlimGPT: Layer-wise Structured Pruning for Large Language Models","created":"2024-12-24","cited_by_count":44},{"id":"2111.15127","title":"A Unified Pruning Framework for Vision Transformers","created":"2021-11-30","cited_by_count":40},{"id":"2307.16424","title":"MetaDiff: Meta-Learning with Conditional Diffusion for Few-Shot Learning","created":"2023-07-31","cited_by_count":40},{"id":"2410.03765","title":"Basis Sharing: Cross-Layer Parameter Sharing for Large Language Model Compression","created":"2024-10-02","cited_by_count":35},{"id":"2305.06061","title":"Visual Tuning","created":"2023-05-10","cited_by_count":34},{"id":"2311.08236","title":"MeLo: Low-rank Adaptation is Better than Fine-tuning for Medical Image Diagnosis","created":"2023-11-14","cited_by_count":33},{"id":"2402.02382","title":"Revisiting the Power of Prompt for Visual Tuning","created":"2024-02-04","cited_by_count":32},{"id":"2411.01327","title":"Visual Fourier Prompt Tuning","created":"2024-11-02","cited_by_count":30},{"id":"1902.09701","title":"Learning Implicitly Recurrent CNNs Through Parameter Sharing","created":"2019-02-26","cited_by_count":27},{"id":"2303.09992","title":"LION: Implicit Vision Prompt Tuning","created":"2023-03-17","cited_by_count":22},{"id":"2407.04616","title":"Isomorphic Pruning for Vision Models","created":"2024-07-05","cited_by_count":21},{"id":"2406.07876","title":"Small Scale Data-Free Knowledge Distillation","created":"2024-06-12","cited_by_count":20},{"id":"2406.16330","title":"Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Merging","created":"2024-06-24","cited_by_count":19},{"id":"2309.01270","title":"COMEDIAN: Self-Supervised Learning and Knowledge Distillation for Action Spotting using Transformers","created":"2023-09-03","cited_by_count":17},{"id":"2501.15296","title":"You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learning","created":"2025-01-25","cited_by_count":17},{"id":"2403.17921","title":"The Need for Speed: Pruning Transformers with One Recipe","created":"2024-03-26","cited_by_count":16},{"id":"2006.10598","title":"Neural Parameter Allocation Search","created":"2020-06-18","cited_by_count":15},{"id":"2404.02900","title":"DeiT-LT Distillation Strikes Back for Vision Transformer Training on Long-Tailed Datasets","created":"2024-04-03","cited_by_count":14},{"id":"2407.05417","title":"See Further for Parameter Efficient Fine-tuning by Standing on the Shoulders of Decomposition","created":"2024-07-07","cited_by_count":14},{"id":"2201.00043","title":"Multi-Dimensional Model Compression of Vision Transformer","created":"2021-12-31","cited_by_count":13},{"id":"2211.08071","title":"KD-DETR: Knowledge Distillation for Detection Transformer with Consistent Distillation Points Sampling","created":"2022-11-15","cited_by_count":13},{"id":"2406.01820","title":"Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruning","created":"2024-06-03","cited_by_count":10},{"id":"2409.00119","title":"3-in-1: 2D Rotary Adaptation for Efficient Finetuning, Efficient Batching and Composability","created":"2024-08-28","cited_by_count":10},{"id":"2309.15755","title":"CAIT: Triple-Win Compression towards High Accuracy, Fast Inference, and Favorable Transferability For ViTs","created":"2023-09-27","cited_by_count":9},{"id":"2403.18708","title":"Dense Vision Transformer Compression with Few Samples","created":"2024-03-27","cited_by_count":9},{"id":"2503.06901","title":"PRO-VPT: Distribution-Adaptive Visual Prompt Tuning via Prompt Relocation","created":"2025-03-10","cited_by_count":9},{"id":"2403.15835","title":"Once for Both: Single Stage of Importance and Sparsity Search for Vision Transformer Compression","created":"2024-03-23","cited_by_count":8},{"id":"2404.09326","title":"Weight Copy and Low-Rank Adaptation for Few-Shot Distillation of Vision Transformers","created":"2024-04-14","cited_by_count":6},{"id":"2402.16319","title":"Data-free Weight Compress and Denoise for Large Language Models","created":"2024-02-26","cited_by_count":3},{"id":"2506.08591","title":"Diversity-Guided MLP Reduction for Efficient Large Vision Transformers","created":"2025-06-10","cited_by_count":3},{"id":"2506.23675","title":"Pruning by Block Benefit: Exploring the Properties of Vision Transformer Blocks during Domain Adaptation","created":"2025-06-30","cited_by_count":3},{"id":"2411.16870","title":"RECAST: Reparameterized, Compact weight Adaptation for Sequential Tasks","created":"2024-11-25","cited_by_count":2},{"id":"2509.25136","title":"BALF: Budgeted Activation-Aware Low-Rank Factorization for Fine-Tuning-Free Model Compression","created":"2025-09-29","cited_by_count":2}],"next_cursor":null}