Papers by Bin Lei

29 papers
Improving Event Detection via Open-domain Trigger Knowledge (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for event detecting are prone to overfitting densely labeled trigger words due to the small scale of training data.
Approach: They propose a novel Enrichment Knowledge Distillation model to leverage external open-domain trigger knowledge to reduce in-built biases to frequent trigger words in annotations.
Outcome: The proposed model outperforms nine strong baselines and is especially effective for unseen/sparsely labeled trigger words.
Preserving Knowledge Invariance: Rethinking Robustness Evaluation of Open Information Extraction (2023.emnlp-main)

Copied to clipboard

Challenge: Existing evaluation benchmarks focus on pairwise matching, ignoring robustness . current models exhibit frustrating degradation, with a maximum drop of 23.43 F1 score .
Approach: They propose a benchmark that simulates the evaluation of open information extraction models in the real world . they perform experiments on typical models published in the last decade and a representative large language model .
Outcome: The proposed model is rated robust on a knowledge-invariant clique with different syntactic and expressive forms.
MINED: Probing and Updating with Multimodal Time-Sensitive Knowledge for Large Multimodal Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for Large Multimodal Models (LMMs) are constrained by static representations, inadequately evaluating their ability to understand time-sensitive knowledge.
Approach: They propose a benchmark containing 2,104 time-sensitive knowledge samples spanning six knowledge types to evaluate temporal awareness along 6 key dimensions and 11 challenging tasks.
Outcome: The proposed benchmark measures temporal awareness along 6 key dimensions and 11 tasks, while most open-source LMMs still lack time understanding ability.
Distilling Large Embeddings via Hyperspherical Householder Quantization (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for quantizing large embeddings rely on Euclidean quantization, which is poorly aligned with the angular geometry induced by contrastive embeddment training.
Approach: They propose a geometry-aware distillation method that compresses large embeddings into short discrete representations via iterative Householder transformations on the unit hypersphere.
Outcome: The proposed method reduces decoding cost and maintains strong semantic retrieval accuracy.
MedForge: Interpretable Medical Deepfake Detection via Forgery-aware Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Existing defenses against forgery are inadequate for healthcare.
Approach: They propose a large-scale benchmark for pre-hoc, evidence-grounded medical forgery detection using a doctor inspection guideline and gold edit locations.
Outcome: Experiments show that the proposed solution can detect and explain medical scans with high fidelity and accuracy.
MixTEA: Semi-supervised Entity Alignment with Mixture Teaching (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to learn informative entity embeddings are insufficient for semi-supervised entity alignment.
Approach: They propose a semi-supervised method which guides the model learning with an end-to-end mixture teaching of manually labeled mappings and probabilistic pseudo mappings.
Outcome: The proposed method is superior to existing methods on benchmark datasets and further analyses.
COPR: Continual Human Preference Learning via Optimal Policy Regularization (2025.findings-acl)

Copied to clipboard

Challenge: Reinforcement Learning from Human Feedback (RLHF) is effective for aligning Large Language Models with human preferences, but its complex process limits its ability to continually learn human feedback.
Approach: They propose a non-RL offline method to convert historical optimal policies into optimization constraints when continually learning new preferences.
Outcome: The proposed method outperforms strong CL baselines in terms of reward-based evaluations and human assessment.
Be Careful about Poisoned Word Embeddings: Exploring the Vulnerability of the Embedding Layers in NLP Models (2021.naacl-main)

Copied to clipboard

Challenge: Recent studies reveal a security threat to natural language processing models, called the Backdoor Attack.
Approach: They propose to hack a model by modifying one single word embedding vector without sacrificing accuracy on clean samples.
Outcome: The proposed method is more efficient and stealthier on sentiment analysis and sentence-pair classification tasks.
VerIF: Verification Engineering for Reinforcement Learning in Instruction Following (2025.emnlp-main)

Copied to clipboard

Challenge: Best practices for RL in instruction following remain underexplored.
Approach: They propose a verification method that combines rule-based code verification with LLM-based verification from a large reasoning model.
Outcome: The proposed method achieves state-of-the-art performance among models of comparable size and generalizes well to unseen constraints.
SimPBL: A Multi-Agent Framework for Project-Based Learning (2026.acl-long)

Copied to clipboard

Challenge: Existing LLMs provide partial assistance without modeling these roles, and overly comprehensive help can reduce learner autonomy.
Approach: They propose a multi-agent framework with an orchestrator agent that provides adaptive scaffolding from interaction logs and collaborator agents that support project work through boundary-aware collaboration.
Outcome: The proposed framework improves learner examination scores by 14% . it is based on a multi-agent framework with an orchestrator agent .
SURVEYFORGE : On the Outline Heuristics, Memory-Driven Generation, and Multi-dimensional Evaluation for Automated Survey Writing (2025.acl-long)

Copied to clipboard

Challenge: SURVEYFORGE automates survey paper writing, but quality gap between LLM-generated and human-written surveys remains significant.
Approach: They propose a survey tool that automatically generates and refines human-written surveys.
Outcome: Experiments show that SURVEYFORGE outperforms previous work such as AutoSurvey in outline quality and content quality.
ADELIE: Aligning Large Language Models on Information Extraction (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) struggle to follow complex instructions of IE tasks due to not being aligned with humans.
Approach: They propose an aligned large language moDEL that effectively solves various IE tasks including closed IE, open IE and on-demand IE.
Outcome: The proposed model achieves state-of-the-art (SoTA) performance among open-source models.
PACE: Predictive Adaptive Context Extraction for Long-Horizon LLM Agents (2026.acl-long)

Copied to clipboard

Challenge: Large Language Model (LLM) agents struggle with ultra-long-horizon tasks requiring hundreds or thousands of interaction steps.
Approach: They propose a framework that reconceptualizes context management as a Next Step Prediction problem.
Outcome: The proposed framework improves task success rates and robust cross-lingual performance.
Non-Autoregressive Math Word Problem Solver with Unified Tree Structure (2023.emnlp-main)

Copied to clipboard

Challenge: Existing MWP solvers do not handle variants that can be derived via mathematical manipulation.
Approach: They propose a non-autoregressive solver to present a solution expression and decode it from a given problem description.
Outcome: The proposed solver is able to decode multiple expression variants and correct them . it is based on a unified tree structure and is available on Math23K and MAWPS.
ProActor: Timing-Aware Reinforcement Learning for Proactive Task Scheduling Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to measuring and optimizing proactive task-oriented agents lack generalizable end-to-end solutions.
Approach: They propose a framework for conversational task scheduling that integrates proactiveness reinforcement learning with a domain-agnostic annotation methodology.
Outcome: The proposed framework enables scalable proactiveness reinforcement learning (RL) Experiments on two newly auto-annotated datasets demonstrate significant improvements in proactive timing while maintaining action consistency comparable to state-of-the-art baselines.
DocEE: A Large-Scale and Fine-grained Benchmark for Document-level Event Extraction (2022.naacl-main)

Copied to clipboard

Challenge: Existing datasets focus on sentence-level event extraction, but document-level EE is limited due to the lack of large-scale and practical training and evaluation datasets.
Approach: They propose a document-level event extraction dataset with 27,000+ events and 180,000+ arguments.
Outcome: The proposed dataset includes 27,000+ events, 180,000+ arguments and large-scale manual annotations, fine-grained argument types and application-oriented settings.
Beyond Code Pairs: Dialogue-Based Data Generation for LLM Code Translation (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have shown remarkable capabilities in code translation, yet their performance deteriorates in low-resource programming domains such as Fortran and emerging frameworks like CUDA .
Approach: They propose a dual-LLM Questioner–Solver pipeline that integrates external knowledge from compilers and runtime feedback to generate verified translations and multi-turn dialogues.
Outcome: The proposed model outperforms proprietary models on key metrics like compilation success and accuracy.
DocEE-zh: A Fine-grained Benchmark for Chinese Document-level Event Extraction (2024.findings-emnlp)

Copied to clipboard

Challenge: Chinese document-level event extraction is still largely unexplored.
Approach: They propose a Chinese document-level event extraction dataset with over 36,000 events and 210,000 arguments.
Outcome: The proposed dataset includes over 36,000 events and more than 210,000 arguments . it is an extension of the DocEE dataset, utilizing the same event schema and annotated by human experts.
A Split-and-Recombine Approach for Follow-up Query Analysis (D19-1)

Copied to clipboard

Challenge: Context-dependent semantic parsing has proved to be an important but challenging task.
Approach: They propose to perform follow-up query analysis to restate context-dependent queries with contextual information.
Outcome: The proposed approach outperforms the state-of-the-art by nearly 8% on the FollowUp dataset . the extensibility of STAR on the SQA dataset is also promising .
GATE: Graph-based Adaptive Tool Evolution Across Diverse Tasks (2026.acl-long)

Copied to clipboard

Challenge: Existing toolsets that use large language models are limited to single-task settings.
Approach: They propose a framework that dynamically constructs and evolves a hierarchical graph of reusable tools across multiple scenarios.
Outcome: The proposed framework achieves up to 4.3 faster milestone completion in Minecraft compared to the previous state-of-the-art method and provides an average improvement of 9.23% over existing tool-making methods in code generation tasks and 10.03% in agent tasks.
Graph-to-Tree Learning for Solving Math Word Problems (2020.acl-main)

Copied to clipboard

Challenge: Existing tree-based neural models do not capture the relationships and order information among the quantities well.
Approach: They propose a novel deep learning architecture that combines the merits of the graph-based encoder and tree-based decoder to generate better solution expressions.
Outcome: The proposed framework outperforms the state-of-the-art on two available datasets significantly.
Syntactically Robust Training on Partially-Observed Data for Open Information Extraction (2022.findings-emnlp)

Copied to clipboard

Challenge: Open Information Extraction models have shown promising results with sufficient supervision, but the syntactic distribution of training data is partially observable in comparison to the real world.
Approach: They propose a syntactically robust training framework that enables models to be trained on a multi-paraphrase distribution based on diverse paraphrase generation.
Outcome: The proposed framework can be applied to other syntactic partial observable domains.
Learning from Miscellaneous Other-Class Words for Few-shot Named Entity Recognition (2021.acl-long)

Copied to clipboard

Challenge: Existing methods to classify named entity mentions with fewshots fail to differentiate rich semantics in other-class words, which will aggravate overfitting under few shot scenario.
Approach: They propose a model that can automatically induce different unde- fined classes from the other class to improve few-shot Named Entity Recognition (NER) .
Outcome: The proposed model outperforms five state-of-the-art models in 1- shot and 5-shots settings on four NER bench marks.
From Knowing to Teaching: Scaffolding Pedagogical Decisions for LLM Agent (2026.acl-long)

Copied to clipboard

Challenge: Large language models produce content lacking pedagogical depth when asked to generate lessons .
Approach: They propose a framework that allows teachers to select content according to pedagogical intent and sequence topics so foundations precede applications.
Outcome: The framework achieves 67.8% win rate in human evaluation and 79.6% in LLM-based evaluation against eight baselines.
MAVEN-FACT: A Large-scale Event Factuality Detection Dataset (2024.findings-emnlp)

Copied to clipboard

Challenge: Event factuality detection is under-explored due to the lack of high-quality large-scale data . efd is a subfield of event understanding, which aims to determine the factuity of textual events.
Approach: They propose a large-scale EFD dataset with factuality annotations of 112,276 events . they find that adopting event arguments and relations helps in event factuity detection .
Outcome: The proposed dataset includes factuality annotations of 112,276 events . it is the largest EFD dataset and is challenging for fine-tuned models and large language models .
KQA Pro: A Dataset with Explicit Compositional Programs for Complex Question Answering over Knowledge Base (2022.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for Complex KBQA lack compositional reasoning capabilities . Existing methods for Complex questions are poor in diversity or scale .
Approach: They propose a compositional programming language to represent the reasoning process of complex questions.
Outcome: The proposed dataset includes around 120K diverse natural language questions . it provides a compositional and interpretable programming language to represent the reasoning process of complex questions based on the proposed model .
Agentic Reward Modeling: Integrating Human Preferences with Verifiable Correctness Signals for Reliable Reward Systems (2025.acl-long)

Copied to clipboard

Challenge: Existing reward models focus on human preferences, neglecting verifiable correctness signals.
Approach: They propose a reward system that combines human preference rewards with verifiable correctness signals to provide reliable rewards.
Outcome: The proposed reward agent significantly outperforms vanilla reward models on benchmarks and inference-time best-of-n searches on real-world tasks.
A.S.E: A Repository-Level Benchmark for Evaluating Security in AI-Generated Code (2026.findings-acl)

Copied to clipboard

Challenge: Existing security evaluation benchmarks lack relevance to real-world AI programming tasks . current LLMs struggle with secure coding, research shows .
Approach: They propose a repository-level evaluation benchmark to assess security of AI-generated code.
Outcome: The proposed framework mirrors real-world AI programming tasks and offers valuable insights into the state of AI code generation.

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