{"list":"other","total":62,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"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":"2307.09288","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","created":"2023-07-18","cited_by_count":13028},{"id":"2108.07258","title":"On the Opportunities and Risks of Foundation Models","created":"2021-08-16","cited_by_count":4033},{"id":"2205.01068","title":"OPT: Open Pre-trained Transformer Language Models","created":"2022-05-02","cited_by_count":3512},{"id":"2305.14314","title":"QLoRA: Efficient Finetuning of Quantized LLMs","created":"2023-05-23","cited_by_count":3418},{"id":"2212.13138","title":"Large Language Models Encode Clinical Knowledge","created":"2022-12-26","cited_by_count":1830},{"id":"2403.13372","title":"LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Models","created":"2024-03-20","cited_by_count":1464},{"id":"2303.17564","title":"BloombergGPT: A Large Language Model for Finance","created":"2023-03-30","cited_by_count":939},{"id":"2002.04745","title":"On Layer Normalization in the Transformer Architecture","created":"2020-02-12","cited_by_count":922},{"id":"2402.09353","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","created":"2024-02-14","cited_by_count":758},{"id":"1912.07875","title":"Libri-Light: A Benchmark for ASR with Limited or No Supervision","created":"2019-12-17","cited_by_count":467},{"id":"2402.12354","title":"LoRA+: Efficient Low Rank Adaptation of Large Models","created":"2024-02-19","cited_by_count":377},{"id":"2307.13269","title":"LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Composition","created":"2023-07-25","cited_by_count":364},{"id":"1906.01787","title":"Learning Deep Transformer Models for Machine Translation","created":"2019-06-05","cited_by_count":309},{"id":"2402.17762","title":"Massive Activations in Large Language Models","created":"2024-02-27","cited_by_count":294},{"id":"2306.06031","title":"FinGPT: Open-Source Financial Large Language Models","created":"2023-06-09","cited_by_count":253},{"id":"2310.08659","title":"LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Models","created":"2023-10-12","cited_by_count":196},{"id":"2306.15794","title":"HyenaDNA: Long-Range Genomic Sequence Modeling at Single Nucleotide Resolution","created":"2023-06-27","cited_by_count":194},{"id":"2203.06904","title":"Delta Tuning: A Comprehensive Study of Parameter Efficient Methods for Pre-trained Language Models","created":"2022-03-14","cited_by_count":180},{"id":"2309.14717","title":"QA-LoRA: Quantization-Aware Low-Rank Adaptation of Large Language Models","created":"2023-09-26","cited_by_count":155},{"id":"2306.12929","title":"Quantizable Transformers: Removing Outliers by Helping Attention Heads Do Nothing","created":"2023-06-22","cited_by_count":151},{"id":"2306.15006","title":"DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome","created":"2023-06-26","cited_by_count":143},{"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":"2311.11696","title":"Sparse Low-rank Adaptation of Pre-trained Language Models","created":"2023-11-20","cited_by_count":96},{"id":"2311.12023","title":"LQ-LoRA: Low-rank Plus Quantized Matrix Decomposition for Efficient Language Model Finetuning","created":"2023-11-20","cited_by_count":92},{"id":"2403.17919","title":"LISA: Layerwise Importance Sampling for Memory-Efficient Large Language Model Fine-Tuning","created":"2024-03-26","cited_by_count":89},{"id":"2309.07937","title":"Voxtlm: unified decoder-only models for consolidating speech recognition/synthesis and speech/text continuation tasks","created":"2023-09-14","cited_by_count":72},{"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":"2309.12673","title":"On Sparse Modern Hopfield Model","created":"2023-09-22","cited_by_count":42},{"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":"2404.03827","title":"Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models","created":"2024-04-04","cited_by_count":38},{"id":"2404.03828","title":"Outlier-Efficient Hopfield Layers for Large Transformer-Based Models","created":"2024-04-04","cited_by_count":38},{"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":"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":"2402.04497","title":"The Fine-Grained Complexity of Gradient Computation for Training Large Language Models","created":"2024-02-07","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":"1712.09473","title":"Sketching for Kronecker Product Regression and P-splines","created":"2017-12-27","cited_by_count":29},{"id":"1909.13384","title":"Optimal Sketching for Kronecker Product Regression and Low Rank Approximation","created":"2019-09-29","cited_by_count":29},{"id":"2011.02466","title":"Algorithms and Hardness for Linear Algebra on Geometric Graphs","created":"2020-11-04","cited_by_count":22},{"id":"2404.03830","title":"BiSHop: Bi-Directional Cellular Learning for Tabular Data with Generalized Sparse Modern Hopfield Model","created":"2024-04-04","cited_by_count":21},{"id":"1803.00904","title":"Hardness of Approximate Nearest Neighbor Search","created":"2018-03-02","cited_by_count":19},{"id":"2205.06249","title":"Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation","created":"2022-05-12","cited_by_count":19},{"id":"1704.02958","title":"On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks","created":"2017-04-10","cited_by_count":16},{"id":"2404.03900","title":"Nonparametric Modern Hopfield Models","created":"2024-04-05","cited_by_count":16},{"id":"1802.02325","title":"On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product","created":"2018-02-07","cited_by_count":12},{"id":"1404.1448","title":"Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails","created":"2014-04-05","cited_by_count":6},{"id":"1709.05282","title":"On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry","created":"2017-09-15","cited_by_count":6},{"id":"1812.00901","title":"On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic","created":"2018-12-03","cited_by_count":6},{"id":"1511.07070","title":"Which Regular Expression Patterns are Hard to Match?","created":"2015-11-22","cited_by_count":5},{"id":"1803.00938","title":"Multivariate Fine-Grained Complexity of Longest Common Subsequence","created":"2018-03-02","cited_by_count":5},{"id":"1811.12017","title":"An Equivalence Class for Orthogonal Vectors","created":"2018-11-29","cited_by_count":5},{"id":"1510.04622","title":"Subtree Isomorphism Revisited","created":"2015-10-15","cited_by_count":2},{"id":"1611.00918","title":"A Dichotomy for Regular Expression Membership Testing","created":"2016-11-03","cited_by_count":2},{"id":"1702.05805","title":"Conditional Lower Bounds for All-Pairs Max-Flow","created":"2017-02-19","cited_by_count":2},{"id":"2203.08356","title":"Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV","created":"2022-03-16","cited_by_count":2}],"next_cursor":null}