← Search

Danyang Zhuo

10 accepted papers

2026

DecodeShare: Tracing the Shared Pathways of LLM Decode-Time Decisions

ICML 2026spotlight

Large language models (LLMs) handle many tasks with one set of parameters, but under KV-cached inference it is unclear what task-general structure, if any, is used at $\textit{decode time}$ rather than during $\textit{prefill}$. We propose $\textbf{DecodeShare}$, a protocol that identifies a low-dim…

Cited by 0SourceScholar
2026

FlashSVD: Memory-Efficient Inference with Streaming for Low-Rank Models

AAAI 2026technical

Singular Value Decomposition (SVD) has recently gained traction as an effective compression technique for large language models (LLMs), with many studies reporting 20-80% parameter reduction at minimal accuracy cost. However, despite reducing weight memory, existing SVD-based approaches still rely o

Cited by 0SourcePDFScholar
2026

InfoFlow KV: Information-Flow-Aware KV Recomputation for Long Context

ICML 2026poster

Retrieval-augmented generation (RAG) for long-context question answering is bottlenecked by inference-time prefilling over large retrieved contexts. A common strategy is to precompute key–value (KV) caches for individual documents and selectively recompute a small subset of tokens to restore global …

Cited by 0SourceScholar
2025

Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory

UAI 2025

Kernel density estimation (KDE) stands out as a challenging task in machine learning. The problem is defined in the following way: given a kernel function $f(x,y)$ and a set of points $\{x_1, x_2, \cdots, x_n \} \subset \mathbb{R}^d$, we would like to compute $\frac{1}{n}\sum_{i=1}^{n} f(x_i,y)$ for

Cited by 0SourcePDFScholar
2025

KVCOMM: Online Cross-context KV-cache Communication for Efficient LLM-based Multi-agent Systems

NeurIPS 2025poster

Multi-agent large language model (LLM) systems are increasingly adopted for complex language processing tasks that require communication and coordination among agents. However, these systems often suffer substantial overhead from repeated reprocessing of overlapping contexts across agents. In typica…

Cited by 0SourcecodeScholar
2023

An Online and Unified Algorithm for Projection Matrix Vector Multiplication with Application to Empirical Risk Minimization

AISTATS 2023poster

Online matrix vector multiplication is a fundamental step and bottleneck in many machine learning algorithms. It is defined as follows: given a matrix at the pre-processing phase, at each iteration one receives a query vector and needs to form the matrix-vector product (approximately) before observi…

Cited by 53SourcePDFScholar
2023

Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing

NeurIPS 2023poster

Over the last decade, deep neural networks have transformed our society, and they are already widely applied in various machine learning applications. State-of-the-art deep neural networks are becoming larger in size every year to deliver increasing model accuracy, and as a result, model training co…

Cited by 37SourcePDFScholar
2022

Fast Graph Neural Tangent Kernel via Kronecker Sketching

AAAI 2022technical

Many deep learning tasks need to deal with graph data (e.g., social networks, protein structures, code ASTs). Due to the importance of these tasks, people turned to Graph Neural Networks (GNNs) as the de facto method for machine learning on graph data. GNNs have become widely applied due to their co…

Cited by 8SourcePDFScholar
2021

TeraPipe: Token-Level Pipeline Parallelism for Training Large-Scale Language Models

ICML 2021spotlight

Model parallelism has become a necessity for training modern large-scale deep language models. In this work, we identify a new and orthogonal dimension from existing model parallel approaches: it is possible to perform pipeline parallelism within a single training sequence for Transformer-based lang…