{"total":15,"rows":[{"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":"2410.09375","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","created":"2024-10-12","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":"2502.16490","title":"On Computational Limits of FlowAR Models: Expressivity and Efficiency","created":"2025-02-23","cited_by_count":10,"area":null},{"id":"2412.05562","title":"Modern Hopfield Networks Require Chain-of-Thought to Solve $\\mathsf{NC}^1$-Hard Problems","created":"2024-12-07","cited_by_count":9,"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":"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":"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":"2604.11810","title":"GRACE: A Dynamic Coreset Selection Framework for Large Language Model Optimization","created":"2026-04-09","cited_by_count":1,"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}],"next_cursor":null}