{"list":"other","total":51,"rows":[{"id":"2303.08774","title":"GPT-4 Technical Report","created":"2023-03-15","cited_by_count":18396},{"id":"2302.13971","title":"LLaMA: Open and Efficient Foundation Language Models","created":"2023-02-27","cited_by_count":14132},{"id":"2010.02502","title":"Denoising Diffusion Implicit Models","created":"2020-10-06","cited_by_count":9781},{"id":"2204.02311","title":"PaLM: Scaling Language Modeling with Pathways","created":"2022-04-05","cited_by_count":5326},{"id":"2108.07258","title":"On the Opportunities and Risks of Foundation Models","created":"2021-08-16","cited_by_count":4033},{"id":"2210.11416","title":"Scaling Instruction-Finetuned Language Models","created":"2022-10-20","cited_by_count":3024},{"id":"2303.12712","title":"Sparks of Artificial General Intelligence: Early experiments with GPT-4","created":"2023-03-22","cited_by_count":2592},{"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":"2304.15010","title":"LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Model","created":"2023-04-28","cited_by_count":602},{"id":"1810.01367","title":"FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Models","created":"2018-10-02","cited_by_count":594},{"id":"2301.10972","title":"On the Importance of Noise Scheduling for Diffusion Models","created":"2023-01-26","cited_by_count":194},{"id":"2303.16504","title":"An Over-parameterized Exponential Regression","created":"2023-03-29","cited_by_count":45},{"id":"2312.03626","title":"TokenCompose: Text-to-Image Diffusion with Token-level Supervision","created":"2023-12-06","cited_by_count":40},{"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.03297","title":"Improved Noise Schedule for Diffusion Training","created":"2024-07-03","cited_by_count":39},{"id":"2304.04397","title":"Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension","created":"2023-04-10","cited_by_count":37},{"id":"2412.12444","title":"LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers","created":"2024-12-17","cited_by_count":37},{"id":"2305.00660","title":"An Iterative Algorithm for Rescaled Hyperbolic Functions Regression","created":"2023-05-01","cited_by_count":35},{"id":"2405.10313","title":"How Far Are We From AGI: Are LLMs All We Need?","created":"2024-05-16","cited_by_count":31},{"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":"2411.07602","title":"Circuit Complexity Bounds for RoPE-based Transformer Architecture","created":"2024-11-12","cited_by_count":26},{"id":"2412.12441","title":"Numerical Pruning for Efficient Autoregressive Models","created":"2024-12-17","cited_by_count":25},{"id":"2405.16418","title":"Unraveling the Smoothness Properties of Diffusion Models: A Gaussian Mixture Perspective","created":"2024-05-26","cited_by_count":24},{"id":"2308.10502","title":"GradientCoin: A Peer-to-Peer Decentralized Large Language Models","created":"2023-08-21","cited_by_count":23},{"id":"2310.16305","title":"Dolfin: Diffusion Layout Transformers without Autoencoder","created":"2023-10-25","cited_by_count":23},{"id":"2412.15579","title":"Score-based Generative Diffusion Models for Social Recommendations","created":"2024-12-20","cited_by_count":23},{"id":"2408.13233","title":"Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time","created":"2024-08-23","cited_by_count":22},{"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},{"id":"2411.16525","title":"Fundamental Limits of Prompt Tuning Transformers: Universality, Capacity and Efficiency","created":"2024-11-25","cited_by_count":22},{"id":"2411.17522","title":"On Statistical Rates of Conditional Diffusion Transformers: Approximation, Estimation and Minimax Optimality","created":"2024-11-26","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":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19},{"id":"2410.09375","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","created":"2024-10-12","cited_by_count":19},{"id":"2410.10165","title":"HSR-Enhanced Sparse Attention Acceleration","created":"2024-10-14","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":"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":"2201.05715","title":"Taylor-Lagrange Neural Ordinary Differential Equations: Toward Fast Training and Evaluation of Neural ODEs","created":"2022-01-14","cited_by_count":13},{"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":"2309.13482","title":"A Unified Scheme of ResNet and Softmax","created":"2023-09-23","cited_by_count":12},{"id":"2410.09397","title":"On Fine-Grained I/O Complexity of Attention Backward Passes","created":"2024-10-12","cited_by_count":11},{"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":"2501.04299","title":"Circuit Complexity Bounds for Visual Autoregressive Model","created":"2025-01-08","cited_by_count":10},{"id":"2305.17482","title":"Federated Empirical Risk Minimization via Second-Order Method","created":"2023-05-27","cited_by_count":9},{"id":"2309.07452","title":"Is Solving Graph Neural Tangent Kernel Equivalent to Training Graph Neural Network?","created":"2023-09-14","cited_by_count":8},{"id":"2408.14018","title":"Quantum Speedups for Approximating the John Ellipsoid","created":"2024-08-26","cited_by_count":6},{"id":"2406.05699","title":"An Investigation of Noise Robustness for Flow-Matching-Based Zero-Shot TTS","created":"2024-06-09","cited_by_count":4},{"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},{"id":"2412.17107","title":"Grams: Gradient Descent with Adaptive Momentum Scaling","created":"2024-12-22","cited_by_count":4}],"next_cursor":null}