{"list":"other","total":58,"rows":[{"id":"1910.10683","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","created":"2019-10-23","cited_by_count":14599},{"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":"2307.09288","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","created":"2023-07-18","cited_by_count":13028},{"id":"2104.08691","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","created":"2021-04-18","cited_by_count":3795},{"id":"2205.01068","title":"OPT: Open Pre-trained Transformer Language Models","created":"2022-05-02","cited_by_count":3512},{"id":"1510.00149","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","created":"2015-10-01","cited_by_count":2329},{"id":"2110.08207","title":"Multitask Prompted Training Enables Zero-Shot Task Generalization","created":"2021-10-15","cited_by_count":1470},{"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":"1804.04235","title":"Adafactor: Adaptive Learning Rates with Sublinear Memory Cost","created":"2018-04-11","cited_by_count":905},{"id":"1911.00536","title":"DialoGPT: Large-Scale Generative Pre-training for Conversational Response Generation","created":"2019-11-01","cited_by_count":842},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1802.09568","title":"Shampoo: Preconditioned Stochastic Tensor Optimization","created":"2018-02-26","cited_by_count":426},{"id":"2110.02861","title":"8-bit Optimizers via Block-wise Quantization","created":"2021-10-06","cited_by_count":403},{"id":"1407.0202","title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","created":"2014-07-01","cited_by_count":402},{"id":"2305.17333","title":"Fine-Tuning Language Models with Just Forward Passes","created":"2023-05-27","cited_by_count":345},{"id":"1807.01695","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator","created":"2018-07-04","cited_by_count":287},{"id":"1312.2139","title":"Optimal rates for zero-order convex optimization: the power of two function evaluations","created":"2013-12-07","cited_by_count":198},{"id":"2409.20325","title":"Old Optimizer, New Norm: An Anthology","created":"2024-09-30","cited_by_count":193},{"id":"2409.11321","title":"SOAP: Improving and Stabilizing Shampoo using Adam","created":"2024-09-17","cited_by_count":192},{"id":"2502.07529","title":"Training Deep Learning Models with Norm-Constrained LMOs","created":"2025-02-11","cited_by_count":192},{"id":"1308.6594","title":"Mini-batch Stochastic Approximation Methods for Nonconvex Stochastic Composite Optimization","created":"2013-08-29","cited_by_count":143},{"id":"1705.07774","title":"Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradients","created":"2017-05-22","cited_by_count":139},{"id":"2306.09782","title":"Full Parameter Fine-tuning for Large Language Models with Limited Resources","created":"2023-06-16","cited_by_count":134},{"id":"2402.11592","title":"Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark","created":"2024-02-18","cited_by_count":114},{"id":"2503.12645","title":"Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization","created":"2025-03-16","cited_by_count":92},{"id":"2502.02900","title":"A Note on the Convergence of Muon","created":"2025-02-05","cited_by_count":83},{"id":"2410.21265","title":"Modular Duality in Deep Learning","created":"2024-10-28","cited_by_count":77},{"id":"1910.06513","title":"ZO-AdaMM: Zeroth-Order Adaptive Momentum Method for Black-Box Optimization","created":"2019-10-15","cited_by_count":76},{"id":"2309.01507","title":"Memory Efficient Optimizers with 4-bit States","created":"2023-09-04","cited_by_count":54},{"id":"2402.15751","title":"Sparse MeZO: Less Parameters for Better Performance in Zeroth-Order LLM Fine-Tuning","created":"2024-02-24","cited_by_count":54},{"id":"2306.07179","title":"Benchmarking Neural Network Training Algorithms","created":"2023-06-12","cited_by_count":52},{"id":"2410.07698","title":"Enhancing Zeroth-order Fine-tuning for Language Models with Low-rank Structures","created":"2024-10-10","cited_by_count":50},{"id":"1905.12938","title":"Stochastic Sign Descent Methods: New Algorithms and Better Theory","created":"2019-05-30","cited_by_count":49},{"id":"2102.10707","title":"A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization","created":"2021-02-21","cited_by_count":46},{"id":"1606.00498","title":"A Comprehensive Linear Speedup Analysis for Asynchronous Stochastic Parallel Optimization from Zeroth-Order to First-Order","created":"2016-06-01","cited_by_count":44},{"id":"2008.08170","title":"Accelerated Zeroth-Order and First-Order Momentum Methods from Mini to Minimax Optimization","created":"2020-08-18","cited_by_count":40},{"id":"2406.02913","title":"Zeroth-Order Fine-Tuning of LLMs with Extreme Sparsity","created":"2024-06-05","cited_by_count":28},{"id":"2410.08989","title":"Zeroth-Order Fine-Tuning of LLMs in Random Subspaces","created":"2024-10-11","cited_by_count":26},{"id":"2312.15184","title":"ZO-AdaMU Optimizer: Adapting Perturbation by the Momentum and Uncertainty in Zeroth-order Optimization","created":"2023-12-23","cited_by_count":25},{"id":"1310.2059","title":"Distributed Coordinate Descent Method for Learning with Big Data","created":"2013-10-08","cited_by_count":23},{"id":"2310.17752","title":"PockEngine: Sparse and Efficient Fine-tuning in a Pocket","created":"2023-10-26","cited_by_count":23},{"id":"2107.03941","title":"Zeroth order optimization with orthogonal random directions","created":"2021-07-08","cited_by_count":21},{"id":"1810.03233","title":"Towards Gradient Free and Projection Free Stochastic Optimization","created":"2018-10-08","cited_by_count":15},{"id":"2403.06504","title":"LoHan: Low-Cost High-Performance Framework to Fine-Tune 100B Model on a Consumer GPU","created":"2024-03-11","cited_by_count":10},{"id":"2410.09823","title":"Simultaneous Computation and Memory Efficient Zeroth-Order Optimizer for Fine-Tuning Large Language Models","created":"2024-10-13","cited_by_count":9},{"id":"1802.09022","title":"An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization","created":"2018-02-25","cited_by_count":8},{"id":"2206.05124","title":"Stochastic Zeroth order Descent with Structured Directions","created":"2022-06-10","cited_by_count":8},{"id":"2109.13391","title":"Curvature-Aware Derivative-Free Optimization","created":"2021-09-27","cited_by_count":7},{"id":"2204.01275","title":"Direct search based on probabilistic descent in reduced spaces","created":"2022-04-04","cited_by_count":7},{"id":"2107.06534","title":"Zeroth and First Order Stochastic Frank-Wolfe Algorithms for Constrained Optimization","created":"2021-07-14","cited_by_count":6},{"id":"2309.16119","title":"ModuLoRA: Finetuning 2-Bit LLMs on Consumer GPUs by Integrating with Modular Quantizers","created":"2023-09-28","cited_by_count":6},{"id":"2401.13944","title":"Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization","created":"2024-01-25","cited_by_count":6},{"id":"1804.02394","title":"An Accelerated Directional Derivative Method for Smooth Stochastic Convex Optimization","created":"2018-04-08","cited_by_count":5},{"id":"2406.06788","title":"Stochastic Frank-Wolfe: Unified Analysis and Zoo of Special Cases","created":"2024-06-10","cited_by_count":5},{"id":"2409.10442","title":"New Aspects of Black Box Conditional Gradient: Variance Reduction and One Point Feedback","created":"2024-09-16","cited_by_count":3},{"id":"2307.07030","title":"Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima","created":"2023-07-13","cited_by_count":2},{"id":"2502.19170","title":"On the Byzantine Fault Tolerance of signSGD with Majority Vote","created":"2025-02-26","cited_by_count":2}],"next_cursor":null}