Imagen de Portada

Circuit Complexity Bounds for Visual Autoregressive Model

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ke, Yekun, Li, Xiaoyu, Liang, Yingyu, Shi, Zhenmei, Song, Zhao
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Artificial Intelligence Computational Complexity Computation and Language
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis
por: Ke, Yekun, et al.
Publicado: (2025)

Circuit Complexity Bounds for RoPE-based Transformer Architecture
por: Chen, Bo, et al.
Publicado: (2024)

The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity
por: Chen, Yifang, et al.
Publicado: (2024)

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
por: Li, Xiaoyu, et al.
Publicado: (2025)

On Fine-Grained I/O Complexity of Attention Backward Passes
por: Li, Xiaoyu, et al.
Publicado: (2024)

Theoretical Constraints on the Expressive Power of $\mathsf{RoPE}$-based Tensor Attention Transformers
por: Li, Xiaoyu, et al.
Publicado: (2024)

Modern Hopfield Networks Require Chain-of-Thought to Solve $\mathsf{NC}^1$-Hard Problems
por: Cao, Yang, et al.
Publicado: (2024)

Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding
por: Chen, Yifang, et al.
Publicado: (2025)

Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers
por: Huang, Zekai, et al.
Publicado: (2025)

RoPE Attention Can Be Trained in Almost Linear Time
por: Cao, Yang, et al.
Publicado: (2024)

On Computational Limits of FlowAR Models: Expressivity and Efficiency
por: Cao, Yang, et al.
Publicado: (2025)

When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
por: Li, Chenyang, et al.
Publicado: (2025)

Universal Approximation of Visual Autoregressive Transformers
por: Chen, Yifang, et al.
Publicado: (2025)

Visual Autoregressive Transformers Must Use $Ω(n^2 d)$ Memory
por: Cao, Yang, et al.
Publicado: (2025)

Looped ReLU MLPs May Be All You Need as Practical Programmable Computers
por: Liang, Yingyu, et al.
Publicado: (2024)

A Tighter Complexity Analysis of SparseGPT
por: Li, Xiaoyu, et al.
Publicado: (2024)

Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent
por: Chen, Bo, et al.
Publicado: (2025)

Do Large Language Models Have Compositional Ability? An Investigation into Limitations and Scalability
por: Xu, Zhuoyan, et al.
Publicado: (2024)

Training Tensor Attention Efficiently: From Cubic to Almost Linear Time
por: Cao, Yang, et al.
Publicado: (2024)

Towards Infinite-Long Prefix in Transformer
por: Liang, Yingyu, et al.
Publicado: (2024)

Advancing the Understanding of Fixed Point Iterations in Deep Neural Networks: A Detailed Analytical Study
por: Ke, Yekun, et al.
Publicado: (2024)

Why Larger Language Models Do In-context Learning Differently?
por: Shi, Zhenmei, et al.
Publicado: (2024)

HSR-Enhanced Sparse Attention Acceleration
por: Chen, Bo, et al.
Publicado: (2024)

Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix
por: Liang, Yingyu, et al.
Publicado: (2024)

Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time
por: Liang, Yingyu, et al.
Publicado: (2024)

Curse of Attention: A Kernel-Based Perspective for Why Transformers Fail to Generalize on Time Series Forecasting and Beyond
por: Ke, Yekun, et al.
Publicado: (2024)

NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes
por: Fan, Lizhou, et al.
Publicado: (2023)

RichSpace: Enriching Text-to-Video Prompt Space via Text Embedding Interpolation
por: Cao, Yuefan, et al.
Publicado: (2025)

Unlocking the Theory Behind Scaling 1-Bit Neural Networks
por: Daliri, Majid, et al.
Publicado: (2024)

Towards Few-Shot Adaptation of Foundation Models via Multitask Finetuning
por: Xu, Zhuoyan, et al.
Publicado: (2024)

HOFAR: High-Order Augmentation of Flow Autoregressive Transformers
por: Liang, Yingyu, et al.
Publicado: (2025)

Provable Differentially Private Computation of the Cross-Attention Mechanism
por: Ke, Yekun, et al.
Publicado: (2024)

Discovering the Gems in Early Layers: Accelerating Long-Context LLMs with 1000x Input Token Reduction
por: Shi, Zhenmei, et al.
Publicado: (2024)

Unraveling the Smoothness Properties of Diffusion Models: A Gaussian Mixture Perspective
por: Liang, Yingyu, et al.
Publicado: (2024)

A Theory of Learning with Autoregressive Chain of Thought
por: Joshi, Nirmit, et al.
Publicado: (2025)

A Measure-Theoretic Analysis of Reasoning: Structural Generalization and Approximation Limits
por: Zhang, Yuyang, et al.
Publicado: (2026)

Demystifying the unreasonable effectiveness of online alignment methods
por: Kang, Enoch Hyunwook
Publicado: (2026)

Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models
por: Hu, Jerry Yao-Chieh, et al.
Publicado: (2024)

CMAT: A Multi-Agent Collaboration Tuning Framework for Enhancing Small Language Models
por: Liang, Xuechen, et al.
Publicado: (2024)

Transformers Can Represent $n$-gram Language Models
por: Svete, Anej, et al.
Publicado: (2024)