Efficient Communication in Latent Multi-Agent LLM Systems
University of California, Merced — Research Assistant, advised by Dr. Wan Du
- Observed that as latent multi-agent LLMs move from text to embeddings to full KV caches, bandwidth grows
while information density falls — so compressing the relayed KV is both necessary and effective.
- Introduced the first adaptation of KV-cache eviction to multi-agent latent
communication, with a role decomposition of the relayed cache that makes eviction interpretable.
- Proposed Orthogonal BackFill: inject a low-rank component of the discarded value states,
orthogonal to the retained ones, back into the retained KV to recover information lost to hard eviction.
08/2025 — PRESENT
Communication Efficiency & Conflict in Federated Learning
Joint Laboratory of BUPT and ChuangCache — Research Assistant, advised by Dr. Yuchao Zhang
- Designed the core algorithms, wrote nearly all the code and ran every experiment across four
publications; also built the lab's shared FL testing framework that all four projects ran on.
- FedSparse — a Resource Optimization Proximal loss enforcing sparse client updates,
plus a backpropagation-time node-pruning scheme, cutting communication up to 24%.
- Federated Gradient Tailor — detects and corrects conflicting client gradients
before aggregation; authored the formal convergence proof.
- DCD — dynamic curriculum knowledge distillation, benchmarked against vanilla KD
and MEKD across multiple datasets.
08/2021 — 03/2025