{"list":"other","total":103,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"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":"2302.13971","title":"LLaMA: Open and Efficient Foundation Language Models","created":"2023-02-27","cited_by_count":14132},{"id":"2001.08361","title":"Scaling Laws for Neural Language Models","created":"2020-01-23","cited_by_count":6586},{"id":"2204.02311","title":"PaLM: Scaling Language Modeling with Pathways","created":"2022-04-05","cited_by_count":5326},{"id":"2108.07258","title":"On the Opportunities and Risks of Foundation Models","created":"2021-08-16","cited_by_count":4033},{"id":"1706.03741","title":"Deep reinforcement learning from human preferences","created":"2017-06-12","cited_by_count":3912},{"id":"2104.08691","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","created":"2021-04-18","cited_by_count":3795},{"id":"2203.15556","title":"Training Compute-Optimal Large Language Models","created":"2022-03-29","cited_by_count":3019},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"2303.12712","title":"Sparks of Artificial General Intelligence: Early experiments with GPT-4","created":"2023-03-22","cited_by_count":2592},{"id":"2102.09690","title":"Calibrate Before Use: Improving Few-Shot Performance of Language Models","created":"2021-02-19","cited_by_count":1392},{"id":"2012.15723","title":"Making Pre-trained Language Models Better Few-shot Learners","created":"2020-12-31","cited_by_count":1256},{"id":"2305.11206","title":"LIMA: Less Is More for Alignment","created":"2023-05-18","cited_by_count":1100},{"id":"2106.04560","title":"Scaling Vision Transformers","created":"2021-06-08","cited_by_count":999},{"id":"1812.11118","title":"Reconciling modern machine learning practice and the bias-variance trade-off","created":"2018-12-28","cited_by_count":927},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"2303.16199","title":"LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention","created":"2023-03-28","cited_by_count":781},{"id":"2212.07677","title":"Transformers learn in-context by gradient descent","created":"2022-12-15","cited_by_count":732},{"id":"1810.02054","title":"Gradient Descent Provably Optimizes Over-parameterized Neural Networks","created":"2018-10-04","cited_by_count":659},{"id":"2304.15010","title":"LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Model","created":"2023-04-28","cited_by_count":602},{"id":"1712.00409","title":"Deep Learning Scaling is Predictable, Empirically","created":"2017-12-01","cited_by_count":582},{"id":"1904.11955","title":"On Exact Computation with an Infinitely Wide Neural Net","created":"2019-04-26","cited_by_count":573},{"id":"2010.14701","title":"Scaling Laws for Autoregressive Generative Modeling","created":"2020-10-28","cited_by_count":522},{"id":"1903.08560","title":"Surprises in High-Dimensional Ridgeless Least Squares Interpolation","created":"2019-03-19","cited_by_count":513},{"id":"1908.05355","title":"The generalization error of random features regression: Precise asymptotics and double descent curve","created":"2019-08-14","cited_by_count":413},{"id":"2305.16264","title":"Scaling Data-Constrained Language Models","created":"2023-05-25","cited_by_count":403},{"id":"2102.06701","title":"Explaining Neural Scaling Laws","created":"2021-02-12","cited_by_count":363},{"id":"1811.04918","title":"Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers","created":"2018-11-12","cited_by_count":340},{"id":"1808.01204","title":"Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Data","created":"2018-08-03","cited_by_count":261},{"id":"1909.12673","title":"A Constructive Prediction of the Generalization Error Across Scales","created":"2019-09-27","cited_by_count":210},{"id":"2402.01092","title":"A Dynamical Model of Neural Scaling Laws","created":"2024-02-02","cited_by_count":111},{"id":"2302.13214","title":"Fast Attention Requires Bounded Entries","created":"2023-02-26","cited_by_count":102},{"id":"2105.15004","title":"Generalization Error Rates in Kernel Regression: The Crossover from the Noiseless to Noisy Regime","created":"2021-05-31","cited_by_count":96},{"id":"1810.12065","title":"On the Convergence Rate of Training Recurrent Neural Networks","created":"2018-10-29","cited_by_count":82},{"id":"2406.08466","title":"Scaling Laws in Linear Regression: Compute, Parameters, and Data","created":"2024-06-12","cited_by_count":57},{"id":"2004.10802","title":"A Neural Scaling Law from the Dimension of the Data Manifold","created":"2020-04-22","cited_by_count":52},{"id":"2304.10411","title":"Attention Scheme Inspired Softmax Regression","created":"2023-04-20","cited_by_count":49},{"id":"2303.16504","title":"An Over-parameterized Exponential Regression","created":"2023-03-29","cited_by_count":45},{"id":"2303.15725","title":"Solving Regularized Exp, Cosh and Sinh Regression Problems","created":"2023-03-28","cited_by_count":44},{"id":"2310.04064","title":"How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation","created":"2023-10-06","cited_by_count":44},{"id":"2402.04520","title":"On Computational Limits of Modern Hopfield Models: A Fine-Grained Complexity Analysis","created":"2024-02-07","cited_by_count":41},{"id":"2407.01079","title":"On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)","created":"2024-07-01","cited_by_count":40},{"id":"2304.04397","title":"Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension","created":"2023-04-10","cited_by_count":37},{"id":"2412.12444","title":"LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers","created":"2024-12-17","cited_by_count":37},{"id":"2305.00660","title":"An Iterative Algorithm for Rescaled Hyperbolic Functions Regression","created":"2023-05-01","cited_by_count":35},{"id":"2312.17346","title":"STanHop: Sparse Tandem Hopfield Model for Memory-Enhanced Time Series Prediction","created":"2023-12-28","cited_by_count":35},{"id":"2307.02419","title":"In-Context Learning for Attention Scheme: from Single Softmax Regression to Multiple Softmax Regression via a Tensor Trick","created":"2023-07-05","cited_by_count":32},{"id":"2405.05219","title":"Conv-Basis: A New Paradigm for Efficient Attention Inference and Gradient Computation in Transformers","created":"2024-05-08","cited_by_count":32},{"id":"2302.11068","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time","created":"2023-02-21","cited_by_count":31},{"id":"2406.03136","title":"Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models","created":"2024-06-05","cited_by_count":31},{"id":"2309.07418","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","created":"2023-09-14","cited_by_count":30},{"id":"2405.16411","title":"Training Tensor Attention Efficiently: From Cubic to Almost Linear Time","created":"2024-05-26","cited_by_count":30},{"id":"2306.02295","title":"A Mathematical Abstraction for Balancing the Trade-off Between Creativity and Reality in Large Language Models","created":"2023-06-04","cited_by_count":29},{"id":"2208.01857","title":"The Power and Limitation of Pretraining-Finetuning for Linear Regression under Covariate Shift","created":"2022-08-03","cited_by_count":26},{"id":"2411.07602","title":"Circuit Complexity Bounds for RoPE-based Transformer Architecture","created":"2024-11-12","cited_by_count":26},{"id":"2308.10502","title":"GradientCoin: A Peer-to-Peer Decentralized Large Language Models","created":"2023-08-21","cited_by_count":23},{"id":"2402.09469","title":"Fourier Circuits in Neural Networks and Transformers: A Case Study of Modular Arithmetic with Multiple Inputs","created":"2024-02-12","cited_by_count":22},{"id":"2408.13233","title":"Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time","created":"2024-08-23","cited_by_count":22},{"id":"2410.11268","title":"Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descent","created":"2024-10-15","cited_by_count":22},{"id":"2412.06148","title":"The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity","created":"2024-12-09","cited_by_count":21},{"id":"2410.11261","title":"Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix","created":"2024-10-15","cited_by_count":20},{"id":"2205.06249","title":"Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation","created":"2022-05-12","cited_by_count":19},{"id":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19},{"id":"2410.09375","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","created":"2024-10-12","cited_by_count":19},{"id":"2410.10165","title":"HSR-Enhanced Sparse Attention Acceleration","created":"2024-10-14","cited_by_count":19},{"id":"2307.08352","title":"Zero-th Order Algorithm for Softmax Attention Optimization","created":"2023-07-17","cited_by_count":16},{"id":"2302.00248","title":"A Nearly-Optimal Bound for Fast Regression with $\\ell_\\infty$ Guarantee","created":"2023-02-01","cited_by_count":14},{"id":"2407.13621","title":"Differential Privacy Mechanisms in Neural Tangent Kernel Regression","created":"2024-07-18","cited_by_count":14},{"id":"2407.14717","title":"Provable Differentially Private Computation of the Cross-Attention Mechanism","created":"2024-07-20","cited_by_count":14},{"id":"2501.04377","title":"On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis","created":"2025-01-08","cited_by_count":14},{"id":"2501.06444","title":"On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective","created":"2025-01-11","cited_by_count":14},{"id":"2210.08361","title":"A Nearly Optimal Size Coreset Algorithm with Nearly Linear Time","created":"2022-10-15","cited_by_count":13},{"id":"2412.17316","title":"RoPE Attention Can Be Trained in Almost Linear Time","created":"2024-12-23","cited_by_count":13},{"id":"2309.13482","title":"A Unified Scheme of ResNet and Softmax","created":"2023-09-23","cited_by_count":12},{"id":"2412.18040","title":"Theoretical Constraints on the Expressive Power of $\\mathsf{RoPE}$-based Tensor Attention Transformers","created":"2024-12-23","cited_by_count":12},{"id":"2502.08150","title":"Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modeling","created":"2025-02-12","cited_by_count":12},{"id":"2501.04299","title":"Circuit Complexity Bounds for Visual Autoregressive Model","created":"2025-01-08","cited_by_count":10},{"id":"2305.17482","title":"Federated Empirical Risk Minimization via Second-Order Method","created":"2023-05-27","cited_by_count":9},{"id":"2310.11291","title":"An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent","created":"2023-10-17","cited_by_count":9},{"id":"2311.15390","title":"Local Convergence of Approximate Newton Method for Two Layer Nonlinear Regression","created":"2023-11-26","cited_by_count":9},{"id":"2502.00690","title":"Dissecting Submission Limit in Desk-Rejections: A Mathematical Analysis of Fairness in AI Conference Policies","created":"2025-02-02","cited_by_count":9},{"id":"2502.06167","title":"Universal Approximation of Visual Autoregressive Transformers","created":"2025-02-10","cited_by_count":9},{"id":"2306.00406","title":"Faster Robust Tensor Power Method for Arbitrary Order","created":"2023-06-01","cited_by_count":8},{"id":"2208.03367","title":"Sublinear Time Algorithm for Online Weighted Bipartite Matching","created":"2022-08-05","cited_by_count":7},{"id":"2305.08353","title":"Fast and Efficient Matching Algorithm with Deadline Instances","created":"2023-05-15","cited_by_count":7},{"id":"2310.20051","title":"The Expressibility of Polynomial based Attention Scheme","created":"2023-10-30","cited_by_count":7},{"id":"2311.14823","title":"Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameters","created":"2023-11-24","cited_by_count":7},{"id":"2409.03891","title":"Overfitting Behaviour of Gaussian Kernel Ridgeless Regression: Varying Bandwidth or Dimensionality","created":"2024-09-05","cited_by_count":7},{"id":"2411.00401","title":"Statistical Guarantees for Lifelong Reinforcement Learning using PAC-Bayes Theory","created":"2024-11-01","cited_by_count":7},{"id":"2208.03915","title":"Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory","created":"2022-08-08","cited_by_count":6},{"id":"2306.09554","title":"Low-Switching Policy Gradient with Exploration via Online Sensitivity Sampling","created":"2023-06-15","cited_by_count":6},{"id":"2309.10129","title":"Adaptive Liquidity Provision in Uniswap V3 with Deep Reinforcement Learning","created":"2023-09-18","cited_by_count":6},{"id":"2402.12711","title":"Uniform Last-Iterate Guarantee for Bandits and Reinforcement Learning","created":"2024-02-20","cited_by_count":5},{"id":"2404.13785","title":"How to Inverting the Leverage Score Distribution?","created":"2024-04-21","cited_by_count":5},{"id":"2011.11877","title":"InstaHide's Sample Complexity When Mixing Two Private Images","created":"2020-11-24","cited_by_count":4},{"id":"2211.15118","title":"A Faster $k$-means++ Algorithm","created":"2022-11-28","cited_by_count":4}],"next_cursor":"100"}