{"list":"other","total":60,"rows":[{"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":"1907.11692","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","created":"2019-07-26","cited_by_count":13372},{"id":"2110.14168","title":"Training Verifiers to Solve Math Word Problems","created":"2021-10-27","cited_by_count":10109},{"id":"2501.12948","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","created":"2025-01-22","cited_by_count":6330},{"id":"1804.07461","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","created":"2018-04-20","cited_by_count":4899},{"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":"1902.00751","title":"Parameter-Efficient Transfer Learning for NLP","created":"2019-02-02","cited_by_count":4236},{"id":"1905.07830","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","created":"2019-05-19","cited_by_count":4100},{"id":"2101.00190","title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","created":"2021-01-01","cited_by_count":3915},{"id":"2104.08691","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","created":"2021-04-18","cited_by_count":3795},{"id":"1911.11641","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","created":"2019-11-26","cited_by_count":2883},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"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":"1705.06950","title":"The Kinetics Human Action Video Dataset","created":"2017-05-19","cited_by_count":1909},{"id":"2503.19786","title":"Gemma 3 Technical Report","created":"2025-03-25","cited_by_count":1824},{"id":"2004.10964","title":"Don't Stop Pretraining: Adapt Language Models to Domains and Tasks","created":"2020-04-23","cited_by_count":1565},{"id":"2203.12602","title":"VideoMAE: Masked Autoencoders are Data-Efficient Learners for Self-Supervised Video Pre-Training","created":"2022-03-23","cited_by_count":1322},{"id":"2106.10199","title":"BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-models","created":"2021-06-18","cited_by_count":1245},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"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":"2103.07191","title":"Are NLP Models really able to Solve Simple Math Word Problems?","created":"2021-03-12","cited_by_count":878},{"id":"2110.04366","title":"Towards a Unified View of Parameter-Efficient Transfer Learning","created":"2021-10-08","cited_by_count":872},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800},{"id":"2402.09353","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","created":"2024-02-14","cited_by_count":758},{"id":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650},{"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":"2402.12354","title":"LoRA+: Efficient Low Rank Adaptation of Large Models","created":"2024-02-19","cited_by_count":377},{"id":"1608.01413","title":"Solving General Arithmetic Word Problems","created":"2016-08-04","cited_by_count":360},{"id":"2012.07463","title":"Parameter-Efficient Transfer Learning with Diff Pruning","created":"2020-12-14","cited_by_count":352},{"id":"2006.03677","title":"Visual Transformers: Token-based Image Representation and Processing for Computer Vision","created":"2020-06-05","cited_by_count":334},{"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":"2310.11454","title":"VeRA: Vector-based Random Matrix Adaptation","created":"2023-10-17","cited_by_count":300},{"id":"2007.12223","title":"The Lottery Ticket Hypothesis for Pre-trained BERT Networks","created":"2020-07-23","cited_by_count":275},{"id":"1911.13299","title":"What's Hidden in a Randomly Weighted Neural Network?","created":"2019-11-29","cited_by_count":237},{"id":"2002.00585","title":"Proving the Lottery Ticket Hypothesis: Pruning is All You Need","created":"2020-02-03","cited_by_count":201},{"id":"2108.06098","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","created":"2021-08-13","cited_by_count":141},{"id":"2308.03303","title":"LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuning","created":"2023-08-07","cited_by_count":137},{"id":"2212.10650","title":"KronA: Parameter Efficient Tuning with Kronecker Adapter","created":"2022-12-20","cited_by_count":133},{"id":"2005.00561","title":"When BERT Plays the Lottery, All Tickets Are Winning","created":"2020-05-01","cited_by_count":114},{"id":"2012.06908","title":"The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Models","created":"2020-12-12","cited_by_count":91},{"id":"2006.07990","title":"Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficient","created":"2020-06-14","cited_by_count":81},{"id":"2405.17604","title":"LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameters","created":"2024-05-27","cited_by_count":76},{"id":"2312.11420","title":"Tuning LayerNorm in Attention: Towards Efficient Multi-Modal LLM Finetuning","created":"2023-12-18","cited_by_count":64},{"id":"2111.13445","title":"How Well Do Sparse Imagenet Models Transfer?","created":"2021-11-26","cited_by_count":50},{"id":"2406.11909","title":"Mixture-of-Subspaces in Low-Rank Adaptation","created":"2024-06-16","cited_by_count":47},{"id":"2103.00794","title":"Early-Bird GCNs: Graph-Network Co-Optimization Towards More Efficient GCN Training and Inference via Drawing Early-Bird Lottery Tickets","created":"2021-03-01","cited_by_count":27},{"id":"2203.04248","title":"Dual Lottery Ticket Hypothesis","created":"2022-03-08","cited_by_count":27},{"id":"2401.16405","title":"Scaling Sparse Fine-Tuning to Large Language Models","created":"2024-01-29","cited_by_count":26},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24},{"id":"2305.17682","title":"One Network, Many Masks: Towards More Parameter-Efficient Transfer Learning","created":"2023-05-28","cited_by_count":18},{"id":"2504.14117","title":"PEFT A2Z: Parameter-Efficient Fine-Tuning Survey for Large Language and Vision Models","created":"2025-04-19","cited_by_count":16},{"id":"2405.17484","title":"Bridging The Gap between Low-rank and Orthogonal Adaptation via Householder Reflection Adaptation","created":"2024-05-24","cited_by_count":15},{"id":"2409.10927","title":"Propulsion: Steering LLM with Tiny Fine-Tuning","created":"2024-09-17","cited_by_count":14},{"id":"2305.15348","title":"READ: Recurrent Adaptation of Large Transformers","created":"2023-05-24","cited_by_count":9},{"id":"2410.10075","title":"RoCoFT: Efficient Finetuning of Large Language Models with Row-Column Updates","created":"2024-10-14","cited_by_count":8},{"id":"2409.15371","title":"MiSS: Revisiting the Trade-off in LoRA with an Efficient Shard-Sharing Structure","created":"2024-09-19","cited_by_count":7},{"id":"2407.16712","title":"Rapid Switching and Multi-Adapter Fusion via Sparse High Rank Adapters","created":"2024-07-22","cited_by_count":5},{"id":"2404.04522","title":"Q-PEFT: Query-dependent Parameter Efficient Fine-tuning for Text Reranking with Large Language Models","created":"2024-04-06","cited_by_count":4}],"next_cursor":null}