{"list":"other","total":108,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"2203.02155","title":"Training language models to follow instructions with human feedback","created":"2022-03-04","cited_by_count":15971},{"id":"2106.09685","title":"LoRA: Low-Rank Adaptation of Large Language Models","created":"2021-06-17","cited_by_count":14380},{"id":"2201.11903","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","created":"2022-01-28","cited_by_count":12459},{"id":"2011.13456","title":"Score-Based Generative Modeling through Stochastic Differential Equations","created":"2020-11-26","cited_by_count":9122},{"id":"1503.03585","title":"Deep Unsupervised Learning using Nonequilibrium Thermodynamics","created":"2015-03-12","cited_by_count":7058},{"id":"1812.04948","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","created":"2018-12-12","cited_by_count":6013},{"id":"2302.05543","title":"Adding Conditional Control to Text-to-Image Diffusion Models","created":"2023-02-10","cited_by_count":5503},{"id":"1907.05600","title":"Generative Modeling by Estimating Gradients of the Data Distribution","created":"2019-07-12","cited_by_count":4101},{"id":"1406.1078","title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","created":"2014-06-03","cited_by_count":4057},{"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":"2205.14135","title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","created":"2022-05-27","cited_by_count":3673},{"id":"2305.10601","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","created":"2023-05-17","cited_by_count":3211},{"id":"1409.3215","title":"Sequence to Sequence Learning with Neural Networks","created":"2014-09-10","cited_by_count":2986},{"id":"2307.08691","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","created":"2023-07-17","cited_by_count":2598},{"id":"1704.00028","title":"Improved Training of Wasserstein GANs","created":"2017-03-31","cited_by_count":2235},{"id":"1505.05770","title":"Variational Inference with Normalizing Flows","created":"2015-05-21","cited_by_count":2170},{"id":"2211.14730","title":"A Time Series is Worth 64 Words: Long-term Forecasting with Transformers","created":"2022-11-27","cited_by_count":2039},{"id":"2206.00927","title":"DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps","created":"2022-06-02","cited_by_count":1979},{"id":"2102.09690","title":"Calibrate Before Use: Improving Few-Shot Performance of Language Models","created":"2021-02-19","cited_by_count":1392},{"id":"1912.02762","title":"Normalizing Flows for Probabilistic Modeling and Inference","created":"2019-12-05","cited_by_count":1323},{"id":"2012.15723","title":"Making Pre-trained Language Models Better Few-shot Learners","created":"2020-12-31","cited_by_count":1256},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"2305.11206","title":"LIMA: Less Is More for Alignment","created":"2023-05-18","cited_by_count":1100},{"id":"2211.01095","title":"DPM-Solver++: Fast Solver for Guided Sampling of Diffusion Probabilistic Models","created":"2022-11-02","cited_by_count":938},{"id":"2112.00114","title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","created":"2021-11-30","cited_by_count":886},{"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":"2104.08773","title":"Cross-Task Generalization via Natural Language Crowdsourcing Instructions","created":"2021-04-18","cited_by_count":699},{"id":"2008.07669","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","created":"2020-08-17","cited_by_count":605},{"id":"2304.15010","title":"LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Model","created":"2023-04-28","cited_by_count":602},{"id":"2407.08608","title":"FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision","created":"2024-07-11","cited_by_count":519},{"id":"1912.10077","title":"Are Transformers universal approximators of sequence-to-sequence functions?","created":"2019-12-20","cited_by_count":406},{"id":"1811.03115","title":"Blockwise Parallel Decoding for Deep Autoregressive Models","created":"2018-11-07","cited_by_count":323},{"id":"2212.14024","title":"Demonstrate-Search-Predict: Composing retrieval and language models for knowledge-intensive NLP","created":"2022-12-28","cited_by_count":318},{"id":"2201.03514","title":"Black-Box Tuning for Language-Model-as-a-Service","created":"2022-01-10","cited_by_count":256},{"id":"2406.16964","title":"Are Language Models Actually Useful for Time Series Forecasting?","created":"2024-06-22","cited_by_count":168},{"id":"2306.02896","title":"Representational Strengths and Limitations of Transformers","created":"2023-06-05","cited_by_count":133},{"id":"2402.04347","title":"The Hedgehog & the Porcupine: Expressive Linear Attentions with Softmax Mimicry","created":"2024-02-06","cited_by_count":120},{"id":"2102.08124","title":"Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks","created":"2021-02-16","cited_by_count":103},{"id":"2302.13214","title":"Fast Attention Requires Bounded Entries","created":"2023-02-26","cited_by_count":102},{"id":"2310.17513","title":"The Expressive Power of Low-Rank Adaptation","created":"2023-10-26","cited_by_count":102},{"id":"2409.17515","title":"From News to Forecast: Integrating Event Analysis in LLM-Based Time Series Forecasting with Reflection","created":"2024-09-26","cited_by_count":98},{"id":"2305.08298","title":"Symbol tuning improves in-context learning in language models","created":"2023-05-15","cited_by_count":75},{"id":"2112.07628","title":"Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time","created":"2021-12-14","cited_by_count":62},{"id":"2405.06640","title":"Linearizing Large Language Models","created":"2024-05-10","cited_by_count":51},{"id":"2402.15602","title":"Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions","created":"2024-02-23","cited_by_count":47},{"id":"2303.16504","title":"An Over-parameterized Exponential Regression","created":"2023-03-29","cited_by_count":45},{"id":"2210.02040","title":"GT-GAN: General Purpose Time Series Synthesis with Generative Adversarial Networks","created":"2022-10-05","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":"2202.02691","title":"TTS-GAN: A Transformer-based Time-Series Generative Adversarial Network","created":"2022-02-06","cited_by_count":41},{"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":"2407.15720","title":"Do Large Language Models Have Compositional Ability? An Investigation into Limitations and Scalability","created":"2024-07-22","cited_by_count":40},{"id":"2409.17422","title":"Discovering the Gems in Early Layers: Accelerating Long-Context LLMs with 1000x Input Token Reduction","created":"2024-09-25","cited_by_count":39},{"id":"2404.03827","title":"Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models","created":"2024-04-04","cited_by_count":38},{"id":"2412.12444","title":"LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers","created":"2024-12-17","cited_by_count":37},{"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":"2402.13973","title":"Linear-Time Graph Neural Networks for Scalable Recommendations","created":"2024-02-21","cited_by_count":31},{"id":"2402.15017","title":"Towards Few-Shot Adaptation of Foundation Models via Multitask Finetuning","created":"2024-02-22","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":"2501.06425","title":"Tensor Product Attention Is All You Need","created":"2025-01-11","cited_by_count":31},{"id":"2405.16411","title":"Training Tensor Attention Efficiently: From Cubic to Almost Linear Time","created":"2024-05-26","cited_by_count":30},{"id":"2011.06997","title":"Kernel Density Estimation through Density Constrained Near Neighbor Search","created":"2020-11-13","cited_by_count":29},{"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":"2006.08228","title":"Finding trainable sparse networks through Neural Tangent Transfer","created":"2020-06-15","cited_by_count":28},{"id":"2303.00106","title":"The Trade-off between Universality and Label Efficiency of Representations from Contrastive Learning","created":"2023-02-28","cited_by_count":27},{"id":"2308.12247","title":"How to Protect Copyright Data in Optimization of Large Language Models?","created":"2023-08-23","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":"2310.15290","title":"Reliable Generation of Privacy-preserving Synthetic Electronic Health Record Time Series via Diffusion Models","created":"2023-10-23","cited_by_count":24},{"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":"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":"1602.02262","title":"Recovery guarantee of weighted low-rank approximation via alternating minimization","created":"2016-02-06","cited_by_count":20},{"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.10165","title":"HSR-Enhanced Sparse Attention Acceleration","created":"2024-10-14","cited_by_count":19},{"id":"2410.23126","title":"Provably Optimal Memory Capacity for Modern Hopfield Models: Transformer-Compatible Dense Associative Memories as Spherical Codes","created":"2024-10-30","cited_by_count":19},{"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":"2310.03331","title":"Fine-tune Language Models to Approximate Unbiased In-context Learning","created":"2023-10-05","cited_by_count":12},{"id":"2410.07018","title":"Tri-Level Navigator: LLM-Empowered Tri-Level Learning for Time Series OOD Generalization","created":"2024-10-09","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":"2305.08367","title":"Toward Highly Efficient and Private Submodular Maximization via Matrix-Based Acceleration","created":"2023-05-15","cited_by_count":11},{"id":"2410.09397","title":"On Fine-Grained I/O Complexity of Attention Backward Passes","created":"2024-10-12","cited_by_count":11},{"id":"2110.02667","title":"Attentive Walk-Aggregating Graph Neural Networks","created":"2021-10-06","cited_by_count":10},{"id":"2303.06210","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","created":"2023-03-10","cited_by_count":10},{"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":"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":"2408.06395","title":"Fast John Ellipsoid Computation with Differential Privacy Optimization","created":"2024-08-12","cited_by_count":7},{"id":"2311.14652","title":"One Pass Streaming Algorithm for Super Long Token Attention Approximation in Sublinear Space","created":"2023-11-24","cited_by_count":6}],"next_cursor":"100"}