Papers by Zeyu Liu

18 papers
Composable Text Controls in Latent Space with ODEs (2023.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to composable text operations often require plug-and-play . a single LM can perform arbitrary text operation composition in the latent space .
Approach: They propose an efficient approach for composable text operations in the latent space of text . they connect pretrained LMs to the laten space and adapt them to the space .
Outcome: The proposed approach improves on existing methods in the latent space of text.
SwiftPrune: Hessian-Free Weight Pruning for Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: a novel post-training pruning method relies on the Hessian matrix to perform pruning . current pruning methods are computationally intensive and lack performance due to second-order derivative calculations.
Approach: They propose a Hessian-free weight pruning method that reduces computational burden . they use an Exponentially Weighted Moving Average technique to bypass weight sorting .
Outcome: The proposed method achieves hardware-efficient model compression by eliminating computational intensive calculations.
Gentopia.AI: A Collaborative Platform for Tool-Augmented LLMs (2023.emnlp-demo)

Copied to clipboard

Challenge: Existing frameworks for Augmented Language Models lack flexibility, democratization, and holistic evaluation.
Approach: They propose a lightweight and extensible framework for Augmented Language Models called Gentopia.
Outcome: The proposed framework integrates language models, task formats, prompting modules, and plugins into a unified paradigm.
DetectRL-X: Towards Reliable Multilingual and Real-World LLM-Generated Text Detection (2026.acl-long)

Copied to clipboard

Challenge: Existing detectors are limited in their ability to detect large language models generated content in multilingual environments.
Approach: They propose a multilingual benchmark to evaluate advanced detectors across 8 dimensions to better align with real-world applications.
Outcome: The proposed benchmark encompasses 8 languages commonly used in commercial contexts and collects human-written texts from 6 domains highly susceptible to LLM misuse.
Probing Across Time: What Does RoBERTa Know and When? (2021.findings-emnlp)

Copied to clipboard

Challenge: Current approaches to natural language processing rely on fixed artifacts such as language models . current studies have focused on how these models acquire and demonstrate knowledge .
Approach: They apply probing techniques to examine how language models acquire knowledge . they aim to inform future work on more efficient pretraining and understanding dependencies .
Outcome: The proposed model learns linguistic abstractions, factual and commonsense knowledge, and reasoning abilities fast, stably, and robustly across domains.
Demons in the Detail: On Implementing Load Balancing Loss for Training Specialized Mixture-of-Expert Models (2025.acl-long)

Copied to clipboard

Challenge: Existing Mixture-of-Experts training frameworks use a micro-batch to calculate LBL . micro-batches are restricted to a single sequence, preventing expert specialization .
Approach: They propose to use a global-batch to loosen the load balance constraint for MoEs models . they propose to synchronize fi across micro-batches and then use it to calculate the LBL .
Outcome: The proposed global-batch LBL improves the domain specialization of experts . the micro-battery LBL is almost at the sequence level, and the router is pushed to distribute the token evenly .
Powering Comparative Classification with Sentiment Analysis via Domain Adaptive Knowledge Transfer (2021.emnlp-main)

Copied to clipboard

Challenge: Comparative Preference Classification (CPC) is a natural language processing task that predicts whether a preference comparison exists between two entities in a given sentence .
Approach: They propose a sentiment analyzer that learns sentiments to individual entities via domain adaptive knowledge transfer.
Outcome: Experiments on the CompSent-19 dataset present a significant improvement on the F1 scores over the best existing CPC approaches.
Conditional Semantic Textual Similarity via Conditional Contrastive Learning (2025.coling-main)

Copied to clipboard

Challenge: Existing methods to assess similarity between sentences encounter over-estimation problem . compared to fuzzy representations, similarity is comparatively lower in terms of "The person's age".
Approach: They propose a conditional contrastive learning framework that constructs positive and negative samples from two perspectives.
Outcome: The proposed method achieves state-of-the-art performance with five models based on bi-encoder and tri-encoding architectures.
From Coarse to Fine: Self-Adaptive Hierarchical Planning for LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing plans for large language model-based agents are limited by their granularity and lack flexibility.
Approach: They propose a self-adaptive hierarchical planning mechanism that mimics human planning strategies and generates self-adapted hierarchic plans tailored to the varying difficulty levels of different tasks.
Outcome: The proposed method significantly improves task execution success rates while mitigating overthinking at the planning level, providing a flexible and efficient solution for multi-step complex decision-making tasks.
AFLoRA: Adaptive Freezing of Low Rank Adaptation in Parameter Efficient Fine-Tuning of Large Models (2024.acl-short)

Copied to clipboard

Challenge: Pre-trained language models have demonstrated commendable performance on various NLP tasks.
Approach: They propose a Parameter-Efficient Fine-Tuning (PEFT) method that incrementally freezes low-rank matrices during fine-tuning to reduce computation and alleviate over-fitting.
Outcome: The proposed method achieves state-of-the-art performance with an average improvement of 0.85% on the GLUE benchmark while yielding up to 1.86 improvement as opposed to similar PEFT alternatives.
Towards A Unified View of Sparse Feed-Forward Network in Pretraining Large Language Model (2023.emnlp-main)

Copied to clipboard

Challenge: Large and sparse feed-forward layers (S-FFN) have proven effective in scaling up the model size for pretraining large language models.
Approach: They compare S-FFN architectures for language modeling and compare their performance and efficiency . they found a simpler selection method that selects blocks through their mean aggregated hidden states .
Outcome: The proposed model size and selection method achieve lower perplexity in language model pretraining compared to existing MoE architectures.
CoV: Chain-of-View Prompting for Spatial Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Embodied question answering requires collecting context that is distributed across multiple viewpoints . most recent vision–language models (VLMs) are constrained to a fixed and finite set of input views .
Approach: They propose a training-free, test-time reasoning framework that transforms a VLM into an active viewpoint reasoner through a coarse-to-fine exploration process.
Outcome: The proposed framework improves LLM-Match performance by 11.98% on four mainstream VLMs.
Multi-Docker-Eval: A ‘Shovel of the Gold Rush’ Benchmark on Automatic Environment Building for Software Engineering (2026.findings-acl)

Copied to clipboard

Challenge: Automated environment configuration is a critical bottleneck in scaling software engineering (SWE) automation.
Approach: They propose a reliable evaluation standard for automated environment configuration for 40 real-world repositories spanning 9 programming languages.
Outcome: The proposed benchmark includes 40 real-world repositories spanning 9 programming languages and measures success in achieving executable states and efficiency under realistic constraints.
Qwen2.5-xCoder: Multi-Agent Collaboration for Multilingual Code Instruction Tuning (2025.acl-long)

Copied to clipboard

Challenge: Existing methods to train code LLMs view each programming language in isolation . experimental results show that Qwen2.5-xCoder can bridge the gap between different programming languages .
Approach: They propose a framework that allows agents to collaborate to enhance multilingual instruction tuning for code LLMs.
Outcome: Experimental results show that Qwen2.5-xCoder can transfer knowledge efficiently and effectively between languages.
Rethinking the Video Sampling and Reasoning Strategies for Temporal Sentence Grounding (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for temporal sentence grounding ignore two crucial issues . 1) Boundary-bias: the video downsampling process may lose these two frames . 2) Reasoning-biases: such incorrect new boundary frames lead to the reasoning bias .
Approach: They propose a siamese sampling mechanism to generate additional contextual frames . they use a reasoning strategy to learn the inter-relationship among these frames a .
Outcome: Extensive experiments demonstrate the effectiveness of a new siamese sampling network on three challenging datasets.
LAWCAT: Efficient Distillation from Quadratic to Linear Attention with Convolution across Tokens for Long Context Modeling (2025.findings-emnlp)

Copied to clipboard

Challenge: a novel linearization framework is proposed to reduce the cost of training transformers from scratch.
Approach: They propose a linear attention framework that integrates pre-trained transformers into a performant linear attention architecture.
Outcome: The proposed framework improves performance on mistral-7B with 1K-length sequences and BABILong benchmarks.
DPGA-TextSyn: Differentially Private Genetic Algorithm for Synthetic Text Generation (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods to fine-tune large language models pose privacy risks . researchers have synthesized data with strong generation capabilities closed-source LLMs to alleviate this problem .
Approach: They propose to combine general LLMs with genetic algorithm to produce relevant and diverse synthetic text under differential privacy constraints.
Outcome: The proposed method significantly improves the performance of the model in downstream tasks while ensuring privacy.
From Completion to Editing: Unlocking Context-Aware Code Infilling via Search-and-Replace Instruction Tuning (2026.acl-long)

Copied to clipboard

Challenge: Fill-in-the-Middle (FIM) models suffer from performance degradation and prohibitive latency.
Approach: They propose a search-and-replace infilling framework that integrates agentic verification and editing into a single-pass inference process.
Outcome: The proposed framework harmonizes completion tasks with the instruction-following priors of Chat LLMs, extending the paradigm from static infilling to dynamic context-aware editing.

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