{"total":21,"rows":[{"id":"2411.06646","title":"Understanding Scaling Laws with Statistical and Approximation Theory for Transformer Neural Networks on Intrinsically Low-dimensional Data","created":"2024-11-11","cited_by_count":30,"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":"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":"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,"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":"2501.04299","title":"Circuit Complexity Bounds for Visual Autoregressive Model","created":"2025-01-08","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.04946","title":"T2VTextBench: A Human Evaluation Benchmark for Textual Control in Video Generation Models","created":"2025-05-08","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.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":"2409.00055","title":"SORSA: Singular Values and Orthonormal Regularized Singular Vectors Adaptation of Large Language Models","created":"2024-08-21","cited_by_count":5,"area":null},{"id":"2410.11279","title":"Advancing the Understanding of Fixed Point Iterations in Deep Neural Networks: A Detailed Analytical Study","created":"2024-10-15","cited_by_count":4,"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.12220","title":"Two Heads Are Better than One: Simulating Large Transformers with Small Ones","created":"2025-06-13","cited_by_count":2,"area":null},{"id":"2510.05494","title":"Fundamental Limits of Crystalline Equivariant Graph Neural Networks: A Circuit Complexity Perspective","created":"2025-10-07","cited_by_count":0,"area":null},{"id":"2605.07463","title":"Approximation Error Upper and Lower Bounds for H\\\"{o}lder Class with Transformers","created":"2026-05-08","cited_by_count":0,"area":null}],"next_cursor":null}