Papers by Yike Zhu

10 papers
BTC-LLM: Efficient Sub-1-Bit LLM Quantization via Learnable Transformation and Binary Codebook (2026.acl-long)

Copied to clipboard

Challenge: Recent sparsity-aware binarization approaches can achieve sub-1-bit compression, but they face performance degradation, mask-management overhead, and limited hardware compatibility.
Approach: They propose a binary quantization framework that leverages binary pattern clustering and weight transformation to overcome performance degradation and mask-management overhead.
Outcome: The proposed framework achieves state-of-the-art compression (1.11–0.7 bits) it maintains high performance with only a 3.1% accuracy drop in zero-shot benchmarks while delivering a 1.6 speedup over FP16.
InsightEval: An Expert-Curated Benchmark for Assessing Insight Discovery in LLM-Driven Data Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing frameworks for data analysis and insight exploration are lacking in terms of benchmarks . existing frameworks suffer from format inconsistencies, poorly conceived objectives, and redundant insights.
Approach: They propose a data-curation pipeline to construct a new dataset named InsightEval.
Outcome: The proposed benchmarks highlight prevailing challenges in automated insight discovery and raise key findings to guide future research.
Bit-by-Bit: Progressive QAT Strategy with Outlier Channel Splitting for Stable Low-Bit LLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to training LLMs at ultra-low precisions suffer from convergence instability and substantial training costs.
Approach: They propose a progressive QAT framework with outlier channel splitting to address these issues . they use nested structure of integer quantization grids to enable a "train once, deploy any precision" paradigm .
Outcome: The proposed framework outperforms baselines on both Llama2/3 and W2A16, with an 11 speedup over BF16.
SafeMT: Multi-turn Safety for Multimodal Language Models (2026.acl-long)

Copied to clipboard

Challenge: Multi-turn dialogues pose a greater risk than single prompts, but existing safety benchmarks do not account for this situation.
Approach: They propose a benchmark that features dialogues of varying lengths generated from harmful queries accompanied by images.
Outcome: The proposed model reduces multi-turn Attack Success Rate (ASR) compared to existing guard models.
Boosting Policy and Process Reward Models with Monte Carlo Tree Search in Open-Domain QA (2025.findings-acl)

Copied to clipboard

Challenge: Experimental results show that our approach can effectively improve the performance of both the policy model and the reward model.
Approach: They propose to use Monte Carlo Tree Search for both policy model improvement and reward model improvement to bridge it to more subtle open-domain question answering.
Outcome: The proposed approach surpasses existing methods for annotation and training data with fewer data points and achieves better performance in test-time scaling strategies.
Benchmarking Fine-Grained Error Detection in Multimodal Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Multimodal Process Reward Models (MPRMs) have emerged as a pivotal framework for enhancing the reasoning capabilities of Multimodal Large Language Models.
Approach: They propose a benchmark specifically designed to evaluate MPRMs’ proficiency in detecting erroneous reasoning steps across diverse error categories.
Outcome: The proposed model achieves up to 4.8% performance improvement through test-time scaling.
LLaSE-G1: Incentivizing Generalization Capability for LLaMA-based Speech Enhancement (2025.acl-long)

Copied to clipboard

Challenge: Recent advances in language models have demonstrated strong capabilities in semantic understanding and contextual modeling.
Approach: They propose a LLaMA-based language model that incentivizes generalization capabilities for speech enhancement.
Outcome: The proposed language model outperforms prior task-specific discriminative and generative models in acoustic enhancement tasks.
QaRL: Rollout-Aligned Quantization-Aware RL for Fast and Stable Training under Training–Inference Mismatch (2026.findings-acl)

Copied to clipboard

Challenge: Recent work has shown that reinforcement learning with simple rule-based reward functions (RLVR) can induce emergent reasoning behaviors and yield gains in challenging domains such as math problem solving.
Approach: They propose a rollout-alignment-quantization-aware RL which aligns training-side forward with the quantized rollout to minimize mismatch.
Outcome: The proposed approach outperforms quantized-rollout training by +5.5 on Qwen3-30B-A3B MoE for math problems while maintaining low-bit throughput.
LegalReasoner: Step-wised Verification-Correction for Legal Judgment Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Existing legal judgment prediction methods struggle with logical errors when conducting complex legal reasoning.
Approach: They propose a method which enhances LJP reliability through step-wise verification and correction of the reasoning process.
Outcome: The proposed model significantly improves concordance with court decisions from 72.37 to 80.27 on LLAMA-3.1-70B.
SafeLawBench: Towards Safe Alignment of Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Recent studies indicate that large language models (LLMs) may exhibit risks, including threats to the protection of private data and the generation of hallucinations.
Approach: They propose to evaluate LLMs from a legal perspective using the SafeLawBench benchmark.
Outcome: The proposed framework categorizes safety risks into three levels based on legal standards and includes 24,860 multi-choice questions and 1,106 open-domain question-answering tasks.

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