Papers by Ke Liang

11 papers
Sparse-RL: Breaking the Memory Wall in LLM Reinforcement Learning via Stable Sparse Rollouts (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for storing key-value caches during long-horizon rollouts cause performance collapses.
Approach: They propose a new training paradigm that empowers stable RL training under sparse rollouts.
Outcome: The proposed model reduces rollout overhead while maintaining the performance.
BUMP: A Benchmark of Unfaithful Minimal Pairs for Meta-Evaluation of Faithfulness Metrics (2023.acl-long)

Copied to clipboard

Challenge: Existing benchmarks measure the correlation with human judgements of faithfulness on model-generated summaries, but they are insufficient for diagnosing whether metrics are consistent, effective on human-written texts, and sensitive to different error types.
Approach: They propose to use unfaithful minimal pairs to measure the consistency of automatic faithfulness metrics by comparing human-written summary pairs with a dataset of 889 human-writing, minimally different summary pairs.
Outcome: The proposed benchmarks show that the most discriminative metrics tend not to be the most consistent, and that the best performing metrics are sensitive to errors.
Beta-LR: Interpretable Logical Reasoning based on Beta Distribution (2024.findings-naacl)

Copied to clipboard

Challenge: Existing methods to capture logical information from text are limited by the uncertainty of the text.
Approach: They propose a probabilistic embedding method to capture logical information from text . they embed texts into beta distributions on each dimension to eliminate logical uncertainty .
Outcome: The proposed method achieves competitive performances on two datasets.
You Can Have a Second Chance: Unbiased and Multi-bit Watermarking for Diffusion Language Models with Regret-based Remasking (2026.acl-long)

Copied to clipboard

Challenge: Existing sequential LLMs cannot be directly applied to DLMs, as their generation order is arbitrary.
Approach: They propose a stability-aware constraint that allows watermarking only in stable contexts and a bit-controlled, unbiased modulation to preserve the original DLM output distribution.
Outcome: The proposed scheme achieves stable watermarking with minimal quality impact while maintaining high detection accuracy and multi-bit capacity.
Pre-training with Meta Learning for Chinese Word Segmentation (2021.naacl-main)

Copied to clipboard

Challenge: Recent studies show that pre-trained models are beneficial to Chinese Word Segmentation (CWS). However, these models lack task-specific prior segmentation knowledge.
Approach: They propose a pre-trained Chinese word segmentation model MetaSeg which incorporates meta learning into a multi-criteria pre-training task.
Outcome: Empirical results show that MetaSeg can achieve new state-of-the-art performance on twelve widely-used CWS datasets and significantly improve model performance in low-resource settings.
From Text to Historical Ecological Knowledge: The Construction and Application of the Shan Jing Knowledge Base (2024.lrec-main)

Copied to clipboard

Challenge: Traditional Ecological Knowledge (TEK) is a shared cultural heritage and crucial instrument to tackle environmental challenges.
Approach: They propose to build a language resource based on Shanhai Jing (the classic of mountains and seas) written 2000 years ago and uses a stylized narrative and juxtaposition of knowledge from multiple domains to build the knowledge base.
Outcome: The proposed knowledge base contains 1432 systematically classified entities and 3294 relationships.
Flexibly Utilize Memory for Long-Term Conversation via a Fragment-then-Compose Framework (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models extract useful information from conversation history to enhance the response in long-term conversations.
Approach: They propose a Fragment-then-Compose framework to optimize memory utilization for long-term open-domain conversation.
Outcome: The proposed framework can be used to extract useful information from conversation history . it can be adapted to different situations and improve response generation .
SCOPE: Preserving Modality-Specific Cues to Mitigate Modality Laziness in Multimodal Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to learning multimodal representations emphasize shared semantics and overlook modality-specific cues.
Approach: They propose a framework for learning complete multimodal representations using shared and practical cues.
Outcome: SCOPE outperforms SOTA benchmarks on four datasets and achieves 27.10% accuracy improvement.
Skip-Thinking: Chunk-wise Chain-of-Thought Distillation Enable Smaller Language Models to Reason Better and Faster (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods train small language models to learn long rationales in one iteration.
Approach: They propose a method that uses a heuristic search to divide rationale into internal chunks . they propose CWT, which uses CWt to focus SLM on learning from only one chunk per iteration.
Outcome: The proposed method can guide a large language model (LLM) in reasoning tasks.
Wav-BERT: Cooperative Acoustic and Linguistic Representation Learning for Low-Resource Speech Recognition (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to learn the transfer from speech to text are unexplored . how to solve the representation discrepancy of speech and text is unexplorable .
Approach: They propose a cooperative acoustic and linguistic representation learning method to fuse and utilize contextual information of speech and text.
Outcome: The proposed method outperforms existing methods on low-resource speech recognition.
FuseSearch: Learning Adaptive Parallel Execution for Efficient Code Localization (2026.findings-acl)

Copied to clipboard

Challenge: Existing parallel code localization agents suffer from a 34.9% redundant tool invocation rate . specialized localization agent that operate as dedicated search components is needed to achieve high localization accuracy.
Approach: They propose a parallel code localization system that reframes parallel code execution as a quality–efficiency co-optimization problem.
Outcome: The proposed method matches SOTA performance while being 93.6% faster.

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