{"total":24,"rows":[{"id":"2405.19592","title":"Why Larger Language Models Do In-context Learning Differently?","created":"2024-05-30","cited_by_count":45,"area":null},{"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,"area":null},{"id":"2406.03136","title":"Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models","created":"2024-06-05","cited_by_count":31,"area":null},{"id":"2501.06425","title":"Tensor Product Attention Is All You Need","created":"2025-01-11","cited_by_count":31,"area":null},{"id":"2408.09503","title":"Out-of-distribution generalization via composition: a lens through induction heads in Transformers","created":"2024-08-18","cited_by_count":28,"area":null},{"id":"2411.07602","title":"Circuit Complexity Bounds for RoPE-based Transformer Architecture","created":"2024-11-12","cited_by_count":26,"area":null},{"id":"2408.13233","title":"Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time","created":"2024-08-23","cited_by_count":22,"area":null},{"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,"area":null},{"id":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2410.10165","title":"HSR-Enhanced Sparse Attention Acceleration","created":"2024-10-14","cited_by_count":19,"area":null},{"id":"2412.17316","title":"RoPE Attention Can Be Trained in Almost Linear Time","created":"2024-12-23","cited_by_count":13,"area":null},{"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,"area":null},{"id":"2406.14036","title":"Towards Infinite-Long Prefix in Transformer","created":"2024-06-20","cited_by_count":10,"area":null},{"id":"2502.16490","title":"On Computational Limits of FlowAR Models: Expressivity and Efficiency","created":"2025-02-23","cited_by_count":10,"area":null},{"id":"2505.11892","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","created":"2025-05-17","cited_by_count":9,"area":null},{"id":"2505.02130","title":"Attention Mechanisms Perspective: Exploring LLM Processing of Graph-Structured Data","created":"2025-05-04","cited_by_count":8,"area":null},{"id":"2502.05790","title":"Breaking the Frozen Subspace: Importance Sampling for Low-Rank Optimization in LLM Pretraining","created":"2025-02-09","cited_by_count":7,"area":null},{"id":"2505.16284","title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","created":"2025-05-22","cited_by_count":7,"area":null},{"id":"2503.01314","title":"Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approaches","created":"2025-03-03","cited_by_count":4,"area":null},{"id":"2409.01688","title":"Differentially Private Kernel Density Estimation","created":"2024-09-03","cited_by_count":3,"area":null},{"id":"2502.16912","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2506.19993","title":"CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems","created":"2025-06-24","cited_by_count":3,"area":null},{"id":"2510.22993","title":"Can Language Models Compose Skills In-Context?","created":"2025-10-27","cited_by_count":0,"area":null},{"id":"2601.21177","title":"Flow Perturbation++: Multi-Step Unbiased Jacobian Estimation for High-Dimensional Boltzmann Sampling","created":"2026-01-29","cited_by_count":0,"area":null}],"next_cursor":null}