Papers by Zeyu Ma
Mention Extraction and Linking for SQL Query Generation (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing text-to-SQL systems take a slot-filling approach, but they are limited in capturing inter-dependencies among SQL clauses. |
| Approach: | They propose an extraction-linking approach where a unified extractor recognizes all types of slot mentions appearing in the question sentence before a linker maps the recognized columns to the table schema to generate executable SQL queries. |
| Outcome: | The proposed method achieves the first place on the WikiSQL benchmark. |
PaddleSpeech: An Easy-to-Use All-in-One Speech Toolkit (2022.naacl-demo)
Copied to clipboard
Hui Zhang, Tian Yuan, Junkun Chen, Xintong Li, Renjie Zheng, Yuxin Huang, Xiaojie Chen, Enlei Gong, Zeyu Chen, Xiaoguang Hu, Dianhai Yu, Yanjun Ma, Liang Huang
| Challenge: | PaddleSpeech is an open-source speech toolkit that supports speech-to-text and text-to speech tasks. |
| Approach: | They describe the design philosophy and core architecture of PaddleSpeech to support several essential speech-to-text and text-to speech tasks. |
| Outcome: | The proposed framework achieves competitive or state-of-the-art performance on various speech datasets and implements the most popular methods. |
Frustratingly Simple Few-Shot Slot Tagging (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing fewshot methods for slot tagging are weak in encoding slot name semantics and slot dependencies. |
| Approach: | They propose a simple and effective few-shot model for slot tagging which incorporates machine reading comprehension (MRC) using source domain and target domain data. |
| Outcome: | The proposed model outperforms state-of-the-art methods on the SNIPS dataset. |
Towards Hierarchical Multi-Step Reward Models for Enhanced Reasoning in Large Language Models (2026.findings-acl)
Copied to clipboard
Teng Wang, Jiang Zhangyi, Zhenqi He, Hailei Gong, Shenyang Tong, Wenhan Yang, Zeyu Li, Yanan Zheng, Zifan He, Zewen Ye, Shengjie Ma, Jianping Zhang
| Challenge: | Existing Process Reward Models (PRMs) are vulnerable to reward hacking and require expensive, large-scale annotation of reasoning steps. |
| Approach: | They propose a reward model approach which evaluates both individual and consecutive reasoning steps from fine-grained and coarse-grounded level. |
| Outcome: | Empirical results show that the proposed model performs better than existing PRMs and is more robust than existing models. |
TrendSim: Simulating Trending Topics in Social Media Under Poisoning Attacks with LLM-based Multi-agent System (2025.findings-naacl)
Copied to clipboard
Zeyu Zhang, Jianxun Lian, Chen Ma, Yaning Qu, Ye Luo, Lei Wang, Rui Li, Xu Chen, Yankai Lin, Le Wu, Xing Xie, Ji-Rong Wen
| Challenge: | Trending topics bring in a new channel for poisoning attacks, resulting in negative impacts on society. |
| Approach: | They propose an LLM-based multi-agent system to simulate trending topics in social media . they propose a time-aware interaction mechanism, centralized message dissemination, and an interactive system . |
| Outcome: | The proposed system simulates trending topics under poisoning attacks on social media platforms. |
A Gentle Introduction to Deep Nets and Opportunities for the Future (2022.acl-tutorials)
Copied to clipboard
| Challenge: | a tutorial on deep nets will introduce a new language for fine tuning deep net programs . the tutorial will be divided into two parts: Part A will make deep net programming accessible to a broader audience . |
| Approach: | This tutorial introduces a new language for fine tuning deep nets with short (1-line) programs that are as easy to code as regression in statistics packages such as R. |
| Outcome: | This tutorial will introduce gft (general fine tuning), a new language for deep nets . glm is a "little language" similar to gslm in statistics package R . |
MemBench: Towards More Comprehensive Evaluation on the Memory of LLM-based Agents (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have highlighted the significance of memory mechanisms in LLM-based agents, which enable them to store observed information and adapt to dynamic environments. |
| Approach: | They propose a dataset and benchmark to evaluate the memory capability of LLM-based agents from multiple aspects including their effectiveness, efficiency, and capacity. |
| Outcome: | The proposed benchmark incorporates factual memory and reflective memory as different levels, and proposes participation and observation as various interactive scenarios. |
TURINGBENCH: A Benchmark Environment for Turing Test in the Age of Neural Text Generation (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Recent advances in generative language models have enabled machines to generate realistic texts. |
| Approach: | They propose a benchmark environment to test the 'Turing Test' problem for neural text generation methods. |
| Outcome: | The proposed benchmark environment is based on 200K human- or machine-generated samples across 20 labels Human, GPT-1, GTP-2_small, GTT-2_medium, GPG-2_large, GGT-2_PyTorch, GGP-3, GROVER_base, griover_large and GRover_mega. |
SQL Generation via Machine Reading Comprehension (2020.coling-main)
Copied to clipboard
| Challenge: | Text-to-SQL systems can generate SQL queries given natural language questions. |
| Approach: | They propose a method that formulates a question answering problem as a query answering problem where different slots are predicted by a unified machine reading comprehension (MRC) model. |
| Outcome: | The proposed method can achieve competitive results on WikiSQL, suggesting it being a promising direction for text-to-SQl. |
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. |
FASTMATCH: Accelerating the Inference of BERT-based Text Matching (2020.coling-main)
Copied to clipboard
| Challenge: | Recent pre-trained language models have shown state-of-the-art accuracies in text matching. |
| Approach: | They propose a BERT-based text matching model where representations and interactions are decoupled . they propose generating final matching scores using a lightweight attention network . |
| Outcome: | Experiments show that the proposed model can achieve up to 100X speed-up to BERT and RoBERTa while keeping more up to 98.7% of the performance. |
From Completion to Editing: Unlocking Context-Aware Code Infilling via Search-and-Replace Instruction Tuning (2026.acl-long)
Copied to clipboard
Jiajun Zhang, Zeyu Cui, Jiaxi Yang, Lei Zhang, Yuheng Jing, Zeyao Ma, Tianyi Bai, Zilei Wang, Qiang Liu, Liang Wang, Binyuan Hui, Junyang Lin
| 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. |