Arrow Research search

Author name cluster

Andrew Yao

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

NeurIPS Conference 2025 Conference Paper

Tensor Product Attention Is All You Need

  • Yifan Zhang
  • Yifeng Liu
  • Huizhuo Yuan
  • Zhen Qin
  • Yang Yuan
  • Quanquan Gu
  • Andrew Yao

Scaling language models to handle longer input sequences typically necessitates large key-value (KV) caches, resulting in substantial memory overhead during inference. In this paper, we propose Tensor Product Attention (TPA), a novel attention mechanism that uses tensor decompositions to represent queries, keys, and values compactly, substantially shrinking the KV cache size at inference time. By factorizing these representations into contextual low-rank components and seamlessly integrating with Rotary Position Embedding (RoPE), TPA achieves improved model quality alongside memory efficiency. Based on TPA, we introduce the Tensor ProducT ATTenTion Transformer (T6), a new model architecture for sequence modeling. Through extensive empirical evaluation on language modeling tasks, we demonstrate that T6 surpasses or matches the performance of standard Transformer baselines including Multi-Head Attention (MHA), Multi-Query Attention (MQA), Grouped-Query Attention (GQA), and Multi-Head Latent Attention (MLA) across various metrics, including perplexity and a range of established evaluation benchmarks. Notably, TPA's memory efficiency and computational efficiency at decoding stage enables processing longer sequences under fixed resource constraints, addressing a critical scalability challenge in modern language models. Project Page: https: //github. com/tensorgi/TPA.

NeurIPS Conference 2023 Conference Paper

Towards Data-Algorithm Dependent Generalization: a Case Study on Overparameterized Linear Regression

  • Jing Xu
  • Jiaye Teng
  • Yang Yuan
  • Andrew Yao

One of the major open problems in machine learning is to characterize generalization in the overparameterized regime, where most traditional generalization bounds become inconsistent even for overparameterized linear regression. In many scenarios, this failure can be attributed to obscuring the crucial interplay between the training algorithm and the underlying data distribution. This paper demonstrate that the generalization behavior of overparameterized model should be analyzed in a both data-relevant and algorithm-relevant manner. To make a formal characterization, We introduce a notion called data-algorithm compatibility, which considers the generalization behavior of the entire data-dependent training trajectory, instead of traditional last-iterate analysis. We validate our claim by studying the setting of solving overparameterized linear regression with gradient descent. Specifically, we perform a data-dependent trajectory analysis and derive a sufficient condition for compatibility in such a setting. Our theoretical results demonstrate that if we take early stopping iterates into consideration, generalization can hold with significantly weaker restrictions on the problem instance than the previous last-iterate analysis.

TCS Journal 1995 Journal Article

On the shrinkage exponent for read-once formulae

  • Johan Håstad
  • Alexander Razborov
  • Andrew Yao

We prove that the size of any read-once de Morgan formula reduces on average by a factor of at least p α − o(1) when all but a fraction p of the input variables are randomly assigned to {0, 1} (here α α l log2(√5 − 1) ≈ 3. 27 ). This resolves in the affirmative a conjecture of Paterson and Zwick. The bound is shown to be tight up to a polylogarithmic factor for all p ⩾ n− 1 α.

v2026.09.13