Papers by Zicheng Xu

7 papers
SCVQ: Sparse-Compensated Vector Quantization for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing vector quantization methods incur inference overhead due to massive codebook storage and intensive index lookups.
Approach: They propose a framework for vector quantization that incorporates a salience-aware weighted K-means clustering scheme with symmetry constraints to reduce codebook size and indexing costs.
Outcome: The proposed framework achieves a perplexity of 5.78 on WikiText-2 for LLaMA-2-7B at 2-bit quantization while delivering a 1.4 speedup over existing baselines.
Self-Ensemble: Mitigating Confidence Distortion for Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models exhibit a confidence distortion problem on multichoice question-answering . Self-Ensemble solves this problem by splitting the choices into several groups .
Approach: They propose a method that splits LLM choices into several groups and ensembles them to reach a final decision.
Outcome: The proposed method outperforms standard inference and baseline methods on MCQA.
Beyond Logits: Aligning Feature Dynamics for Effective Knowledge Distillation (2025.acl-long)

Copied to clipboard

Challenge: Knowledge distillation (KD) compresses large language models into lightweight versions called student models.
Approach: They propose to align the entire feature dynamics between teacher and student models by using two additional loss terms to achieve this.
Outcome: The proposed method matches the entire feature dynamics between teacher and student models rather than just the final states.
Taming LLMs with Gradient Grouping (2025.acl-long)

Copied to clipboard

Challenge: a new study presents scaling with gradient grouping (SGG) the adaptive learning rate scaling approach is based on per-parameter statistics, which incurs memory overhead.
Approach: They propose an optimizer wrapper that improves adaptive learning rate estimation by dynamic grouping and group-specific scaling.
Outcome: The proposed algorithm improves learning rate estimation on diverse models with different model sizes and batch sizes.
Reliable Use of Lemmas via Eligibility Reasoning and Section-Aware Reinforcement Learning (2026.acl-short)

Copied to clipboard

Challenge: Recent large language models (LLMs) perform strongly on mathematical benchmarks but often import conclusions without validating assumptions.
Approach: They propose a model that encodes a lemma specification and trains with reinforcement learning and section-aware loss masking to assign penalty to the section responsible for errors.
Outcome: The proposed model performs well on benchmarks but often misapplyes lemmas . the model is able to encode the specification and train with reinforcement learning .
Retrieval-Augmented Language Models are Mimetic Theorem Provers (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models often fail to provide rigorous proof-based reasoning for research-level mathematics.
Approach: They propose a simple yet effective RAG framework that augments retrieved proofs with queries and document contexts to improve retrieval performance.
Outcome: The proposed framework improves retrieval performance by 34.19% . dual RAG can be used to prove research-level theorems in theoretical machine learning .
DRIFT: Transferring Reasoning Priors for Efficient MLLM Fine-Tuning (2026.findings-acl)

Copied to clipboard

Challenge: Multimodal large language models (MLLMs) have made rapid progress in perception and alignment, but their reasoning ability often lags behind strong text-only LLMs.
Approach: They propose a method that transfers reasoning knowledge in the gradient space while preserving multimodal alignment.
Outcome: Experiments on multimodal reasoning benchmarks show that DRIFT outperforms naive merging and standard SFT.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations