activity
20232026
most citedBeyond Linear Approximations: A Novel Pruning Approach for Attention Matrix

3 citations · 34 across the 47 of their papers we have counts for

collaborators
Showing cs.LGShow all

35 papers · 1 filter

cs.LG2026

Know Thyself, Teach Thyself: Internal Information Flow for Selective Self-Distillation

Rui Wang, Ruijie Wang, Bo Chen +2

Self-distillation turns knowledge distillation into a closed learning loop and offers a path toward recursive self-improvement. Without an external teacher, however, the model must…

cs.LG2025

Can Language Models Compose Skills In-Context?

Zidong Liu, Zhuoyan Xu, Zhenmei Shi +1

Composing basic skills from simple tasks to accomplish composite tasks is crucial for modern intelligent systems. We investigate the in-context composition ability of language mode…

cs.LG2025★ 1 cited

Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding

Yifang Chen, Xiaoyu Li, Yingyu Liang +3

The key-value (KV) cache in the tensor version of transformers presents a significant bottleneck during inference. While previous work analyzes the fundamental space complexity bar…

cs.LG2025

Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows

Chengyue Gong, Xiaoyu Li, Yingyu Liang +4

Flow matching has emerged as a powerful framework for generative modeling, offering computational advantages over diffusion models by leveraging deterministic Ordinary Differential…

cs.LG2025

Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approaches

Yifang Chen, Xuyang Guo, Xiaoyu Li +3

Recently, Large Language Models (LLMs) have achieved remarkable success. A key factor behind this success is the scaling law observed by OpenAI. Specifically, for models with Trans…

cs.LG2025

Visual Autoregressive Transformers Must Use Memory

Yang Cao, Xiaoyu Li, Yekun Ke +3

A fundamental challenge in Visual Autoregressive models is the substantial memory overhead required during inference to store previously generated representations. Despite various…

cs.LG2025

Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modeling

Yang Cao, Bo Chen, Xiaoyu Li +5

This paper introduces Force Matching (ForM), a novel framework for generative modeling that represents an initial exploration into leveraging special relativistic mechanics to enha…

cs.LG2025

Universal Approximation of Visual Autoregressive Transformers

Yifang Chen, Xiaoyu Li, Yingyu Liang +2

We investigate the fundamental limits of transformer-based foundation models, extending our analysis to include Visual Autoregressive (VAR) transformers. VAR represents a big step…

cs.LG2025★ 1 cited

Dissecting Submission Limit in Desk-Rejections: A Mathematical Analysis of Fairness in AI Conference Policies

Yuefan Cao, Xiaoyu Li, Yingyu Liang +4

As AI research surges in both impact and volume, conferences have imposed submission limits to maintain paper quality and alleviate organizational pressure. In this work, we examin…

cs.LG2025

On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis

Yekun Ke, Xiaoyu Li, Yingyu Liang +3

Recently, Visual Autoregressive () Models introduced a groundbreaking advancement in the field of image generation, offering a scalable approach through a coarse-to-f…

cs.LG2025

On Computational Limits of FlowAR Models: Expressivity and Efficiency

Yang Cao, Chengyue Gong, Yekun Ke +5

The expressive power and computational complexity of deep visual generative models, such as flow-based and autoregressive (AR) models, have gained considerable interest for their w…

cs.LG2025

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective

Xiaoyu Li, Yingyu Liang, Zhenmei Shi +3

Graph Neural Networks (GNNs) have become the standard approach for learning and reasoning over relational data, leveraging the message-passing mechanism that iteratively propagates…

cs.LG2025

Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers

Zekai Huang, Yingyu Liang, Zhenmei Shi +2

Looped Transformers have shown exceptional neural algorithmic reasoning capability in simulating traditional graph algorithms, but their application to more complex structures like…

cs.LG2024

Theoretical Constraints on the Expressive Power of -based Tensor Attention Transformers

Xiaoyu Li, Yingyu Liang, Zhenmei Shi +2

Tensor Attention extends traditional attention mechanisms by capturing high-order correlations across multiple modalities, addressing the limitations of classical matrix-based atte…

cs.LG2024

RoPE Attention Can Be Trained in Almost Linear Time

Yang Cao, Jiayan Huo, Yingyu Liang +2

The Rotary Position Embedding (RoPE) mechanism has become a powerful enhancement to the Transformer architecture, which enables models to capture token relationships when encoding…

cs.LG2024★ 1 cited

Curse of Attention: A Kernel-Based Perspective for Why Transformers Fail to Generalize on Time Series Forecasting and Beyond

Yekun Ke, Yingyu Liang, Zhenmei Shi +2

The application of transformer-based models on time series forecasting (TSF) tasks has long been popular to study. However, many of these works fail to beat the simple linear resid…

cs.LG2024

Circuit Complexity Bounds for RoPE-based Transformer Architecture

Bo Chen, Xiaoyu Li, Yingyu Liang +3

Characterizing the express power of the Transformer architecture is critical to understanding its capacity limits and scaling law. Recent works provide the circuit complexity bound…

cs.LG2024★ 2 cited

Advancing the Understanding of Fixed Point Iterations in Deep Neural Networks: A Detailed Analytical Study

Yekun Ke, Xiaoyu Li, Yingyu Liang +2

Recent empirical studies have identified fixed point iteration phenomena in deep neural networks, where the hidden state tends to stabilize after several layers, showing minimal ch…

cs.LG2024★ 2 cited

Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descent

Bo Chen, Xiaoyu Li, Yingyu Liang +2

In-context learning has been recognized as a key factor in the success of Large Language Models (LLMs). It refers to the model's ability to learn patterns on the fly from provided…

cs.LG2024★ 3 cited

Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix

Yingyu Liang, Jiangxuan Long, Zhenmei Shi +2

Large Language Models (LLMs) have shown immense potential in enhancing various aspects of our daily lives, from conversational AI to search and AI assistants. However, their growin…

cs.LG2024★ 2 cited

HSR-Enhanced Sparse Attention Acceleration

Bo Chen, Yingyu Liang, Zhizhou Sha +2

Large Language Models (LLMs) have demonstrated remarkable capabilities across various applications, but their performance on long-context tasks is often limited by the computationa…

cs.LG2024★ 2 cited

On Fine-Grained I/O Complexity of Attention Backward Passes

Xiaoyu Li, Yingyu Liang, Zhenmei Shi +3

Large Language Models (LLMs) exhibit exceptional proficiency in handling extensive context windows in natural language. Nevertheless, the quadratic scaling of attention computation…

cs.LG2024★ 1 cited

Looped ReLU MLPs May Be All You Need as Practical Programmable Computers

Yingyu Liang, Zhizhou Sha, Zhenmei Shi +2

Previous work has demonstrated that attention mechanisms are Turing complete. More recently, it has been shown that a looped 9-layer Transformer can function as a universal program…

cs.LG2024★ 2 cited

Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time

Yingyu Liang, Zhizhou Sha, Zhenmei Shi +2

The computational complexity of the self-attention mechanism in popular transformer architectures poses significant challenges for training and inference, and becomes the bottlenec…