Papers by Yike Wang

20 papers
Taming System Complexity: Demystifying Software Engineering Agents in Diagnosing Linux Kernel Faults (2026.acl-long)

Copied to clipboard

Challenge: Existing LLM agents struggle with identifying bugs in the Linux kernel . bugs can affect billions of users, affecting the Linux Foundation's research on the topic .
Approach: They propose a LinuxFLBench benchmark to measure the accuracy of LLM agents on the Linux kernel.
Outcome: The proposed framework improves FL accuracy with minimal costs.
UnifiedGEC: Integrating Grammatical Error Correction Approaches for Multi-languages with a Unified Framework (2025.coling-demos)

Copied to clipboard

Challenge: Existing tools for GEC have been developed to support research on grammatical errors, but there is no comprehensive evaluation on these models.
Approach: They propose an open-source framework for Grammatical Error Correction that integrates 5 widely-used GEC models and compares their performance on 7 datasets in different languages.
Outcome: The proposed framework compares 5 widely-used models on 7 datasets in different languages.
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.
Learning While Staying Curious: Entropy-Preserving Supervised Fine-Tuning via Adaptive Self-Distillation for Large Reasoning Models (2026.acl-long)

Copied to clipboard

Challenge: Recent advances establish "SFT-then-RL" as the defacto paradigm for enhancing large reasoning mod- els on automatically verifiable tasks.
Approach: They propose an entropy-preserving SFT method to enhance exploration capabilities through intrinsic curiosity.
Outcome: The proposed method outperforms the vanilla method on reasoning tasks by 2.5 points . it also outperformed the vanilla SFT by 2.9 points on out-of-distribution tasks .
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.
VisCGEC: Benchmarking the Visual Chinese Grammatical Error Correction (2025.naacl-long)

Copied to clipboard

Challenge: Existing studies on Chinese grammatical error correction ignore multi-modality and faked errors, which pushes techniques far away from real-world scenarios.
Approach: They propose to benchmark Chinese grammatical error correction for Chinese as a foreign language learner (CFL) using a dataset, they propose to use two CGEC frameworks to conduct experiments .
Outcome: The proposed approach achieves an F 0.5 score of only 28.9%.
Improving Deep Embedded Clustering via Learning Cluster-level Representations (2022.coling-1)

Copied to clipboard

Challenge: Existing efforts to learn meaningful representations at the instance level are limited.
Approach: They propose a deep embedded clustering model with cluster-level representation learning to jointly learn cluster and instance level representations.
Outcome: The proposed model produces meaningful clusters on real-world short text datasets.
Data Swarms: Optimizable Generation of Synthetic Evaluation Data (2026.findings-acl)

Copied to clipboard

Challenge: Extensive experiments demonstrate that Data Swarms outperforms eight data generation baselines across five evaluation objectives.
Approach: They propose an algorithm to optimize the generation of synthetic evaluation data and advance quantitative desiderata of LLM evaluation.
Outcome: The proposed algorithm outperforms baseline evaluations and Adversarial Swarms generates harder data while learning from such data.
Towards Robust Evidence-Aware Fake News Detection via Improving Semantic Perception (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods lack sufficient semantic perception and are easily blinded by textual expressions.
Approach: They propose a model-agnostic training framework to improve the semantic perception of evidence-aware fake news detection by combining two kinds of data augmentations with synthetic data.
Outcome: The proposed framework outperforms state-of-the-art methods on the extended test set while achieving competitive performance on the original one.
FocusLLM: Precise Understanding of Long Context by Dynamic Condensing (2025.acl-long)

Copied to clipboard

Challenge: Existing context condensing methods cannot accurately understand the full context, as there is a considerable amount of information loss in the condensed process.
Approach: They propose a framework to extend the fixed context length of any decoder-only LLM by distilling crucial information from long sequences.
Outcome: The proposed framework extends the fixed context length of any decoder-only LLM, allowing it to focus on relevant information from very long sequences.
LeanK: Learnable K Cache Channel Pruning for Efficient Decoding (2025.emnlp-main)

Copied to clipboard

Challenge: Existing efforts to optimize the key-value (KV) cache include: (1) Eviction, which discards cache of less important tokens; (2) Selection, which retains the full KV cache but selectively reads relevant entries.
Approach: They propose a learning-based method that prunes unimportant key (K) cache channels by leveraging static channel sparsity.
Outcome: Experiments show that LeanK reduces GPU memory and accelerates decoding without sacrificing accuracy.
ChatMusician: Understanding and Generating Music Intrinsically with LLM (2024.findings-acl)

Copied to clipboard

Challenge: Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task.
Approach: They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5.
Outcome: The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers.
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.
PKU-SafeRLHF: Towards Multi-Level Safety Alignment for LLMs with Human Preference (2025.acl-long)

Copied to clipboard

Challenge: Using large-scale annotation data, large language models can generate noise, errors and biases, leading to unexpected behaviours.
Approach: They propose a dataset to promote safety alignment in large language models . they separate helpfulness and harmlessness annotations for question-answering pairs .
Outcome: The proposed dataset provides 44.6k prompts and 265k question-answer pairs with safety meta-labels for 19 harm categories and three severity levels, with answers generated by Llama-family models.
When One LLM Drools, Multi-LLM Collaboration Rules (2026.acl-long)

Copied to clipboard

Challenge: a single general-purpose LLM is not enough to produce a reliable output, argues this paper . a multi-LLM collaboration approach addresses reliability, democratization, and pluralism .
Approach: They argue that a single general-purpose LLM is not enough to produce a reliable output . they organize existing multi-LLM collaboration methods into a hierarchy based on access and information exchange .
Outcome: The proposed method addresses reliability, democratization, and pluralism challenges a single LLM fails to produce a reliable output.
Tree-CoT-RT: An Explainable Multi-Path Tree-Guided Chain-of-Thought and Reinforcement Learning Framework for Aspect Sentiment Quad Prediction (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods lack explainability and generalization, making it difficult to justify inference decisions and detect implicit sentiment across domains and varied expression patterns.
Approach: They propose an explainable multi-path tree-guided chain-of-thought framework specifically designed for ASQP.
Outcome: Experiments on benchmark datasets show that Tree-CoT-RT outperforms baselines.
Teaching LLMs to Abstain across Languages via Multilingual Feedback (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies on LLM abstention focus on English, but they show that it can reduce the accuracy of the model by 20.5% .
Approach: They propose to teach LLMs to abstain in the face of knowledge gaps by generating multiple feedback items in related languages.
Outcome: Extensive experiments show that the proposed approach outperforms baselines and achieves 9.2% improvement for low-resource languages.
When Slower Isn’t Truer: Inverse Scaling Law of Truthfulness in Multimodal Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: a study of slow reasoning models for multimodal reasoning finds that they are more prone to fabricating plausible yet false details when confronted with incomplete or misleading visual inputs.
Approach: They conduct the first systematic study of the inverse scaling law in slow-thinking paradigms for multimodal reasoning.
Outcome: The findings suggest that slower reasoning models are more prone to fabricating false details . the study analyzed 5,000-sample hierarchical prompt dataset by 50 participants .
Can LLMs Evaluate Complex Attribution in QA? Automatic Benchmarking using Knowledge Graphs (2025.acl-long)

Copied to clipboard

Challenge: Attributed Question Answering (AQA) has attracted wide attention, but there are several limitations in evaluating the attributions.
Approach: They propose a large-scale benchmark containing comprehensive attribution categories . they compare 25 automatic evaluators with human evaluers and tested LLM evalators .
Outcome: The proposed method can compare attributions with subtle differences and provide feedback to improve them.

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