Papers by Bin Fan

18 papers
FB-Bench: A Fine-Grained Multi-Task Benchmark for Evaluating LLMs’ Responsiveness to Human Feedback (2025.emnlp-main)

Copied to clipboard

Challenge: Existing research focuses on benchmarking LLMs in single-turn dialogues, neglecting the nuanced nature of human feedback within real-world usage scenarios.
Approach: They propose a fine-grained, multi-task benchmark designed to evaluate LLMs’ responsiveness to human feedback under real-world usage scenarios in Chinese.
Outcome: The proposed benchmarks show that human feedback can significantly impact LLMs’ responsiveness in real-world usage scenarios.
Task-adaptive Label Dependency Transfer for Few-shot Named Entity Recognition (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for Named Entity Recognition (NER) ignore label dependency, resulting in suboptimal performance.
Approach: They propose a meta-learning method to make label dependency transferable by learning general initialization and individual parameter update rule for label dependency.
Outcome: The proposed method improves existing methods by learning general initialization and individual parameter update rule for label dependency.
Benchmarking Vision-Language Models on Chinese Ancient Documents: From OCR to Knowledge Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing document benchmarks focus on English printed texts or simplified Chinese . current vision-language models struggle with visual complexity and poor adaptability .
Approach: They propose a benchmark to evaluate Chinese ancient documents' visual/linguistic complexity . ancient documents are valuable cultural heritage, but they face challenges in digitization and understanding .
Outcome: the first benchmark for Chinese ancient documents evaluates VLMs from OCR to knowledge reasoning . ancient documents carry thousands of years of Chinese history and culture . traditional methods only scan images, while current models struggle with visual complexity .
Structure-Unified M-Tree Coding Solver for Math Word Problem (2022.emnlp-main)

Copied to clipboard

Challenge: Existing models that take into account the binary tree structure of mathematical expressions have achieved better performance, but the output space is non-deterministic.
Approach: They propose a Structure-Unified M-Tree Coding Solver which applies a tree with any M branches to unify the output structures.
Outcome: The proposed model outperforms several state-of-the-art models under similar experimental conditions and performs much better under low-resource conditions.
Guiding the Flowing of Semantics: Interpretable Video Captioning via POS Tag (D19-1)

Copied to clipboard

Challenge: Existing models of video captioning use a network and semantics are mixed into one feature.
Approach: They propose an Adaptive Semantic Guidance Network which instantiates whole video semantics to different POS-aware semantics with supervision of part of speech (POS) tag.
Outcome: Extensive experiments show that the proposed model is more efficient than state-of-the-art models.
WikiSeeker: Rethinking the Role of Vision-Language Models in Knowledge-Based Visual Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for Knowledge-Based Visual Question Answering rely on images as the retrieval key, and often overlook or misplace the role of Vision-Language Models (VLMs)
Approach: They propose a multi-modal RAG framework that assigns VLMs two specialized agents: a Refiner and an Inspector.
Outcome: Experiments on EVQA, InfoSeek, and M2KR show that the proposed framework achieves state-of-the-art performance with significant improvements in both retrieval accuracy and answer quality.
CFBench: A Comprehensive Constraints-Following Benchmark for LLMs (2025.acl-long)

Copied to clipboard

Challenge: Existing evaluations of Large Language Models (LLMs) focus on fragmented constraints or narrow scenarios, but they overlook the comprehensiveness and authenticity of constraints from the user’s perspective.
Approach: They propose a Chinese Comprehensive Constraints Following Benchmark for LLMs that compiles constraints from real-world instructions and constructs a systematic framework for constraint types.
Outcome: The proposed framework integrates multi-dimensional assessment criteria with requirement prioritization, covering various perspectives of constraints, instructions, and requirement fulfillment.
GrandGuard: Taxonomy, Benchmark, and Safeguards for Elderly-Chatbot Interaction Safety (2026.findings-acl)

Copied to clipboard

Challenge: a survey of older adults shows that many LLMs mishandle elderly-specific contextual risks.
Approach: They propose a framework to assess elderly-specific contextual risks in LLM interactions . they use a taxonomy to identify 50 fine-grained risk types across mental well-being, financial, medical, toxicity, and privacy domains .
Outcome: a new framework assesses elderly-specific contextual risks in LLM interactions . it achieves 96.2% and 90.9% unsafe-prompt detection accuracy, respectively .
Few-Shot Semantic Dependency Parsing via Graph Contrastive Learning (2024.lrec-main)

Copied to clipboard

Challenge: Existing graph neural networks (GNNs) have shown promising performance on semantic dependency parsing (SDP) training a high-performing model requires a large amount of labeled data and it is prone to over-fitting in the absence of sufficient labele .
Approach: They propose a syntax-guided graph contrastive learning framework to train GNNs with unlabeled data and fine-tune pre-trained GNN models with few-shot labeled SDP data.
Outcome: The proposed framework achieves promising results when few-shot training samples are available.
Business as Rulesual: A Benchmark and Framework for Business Rule Flow Modeling with LLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for extracting structured procedural knowledge from unstructured business documents are limited by simplistic schemas and shallow logical dependencies.
Approach: They propose a framework for extracting structured procedural knowledge from unstructured business documents . they propose BREX, a carefully curated benchmark comprising 409 real-world business documents and 2,855 expert-annotated rules .
Outcome: The proposed framework outperforms standard prompts in rule extraction and execution.
KCL: Few-shot Named Entity Recognition with Knowledge Graph and Contrastive Learning (2024.lrec-main)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is a key subtask in natural language processing but is limited to a few labeled samples.
Approach: They propose a few-shot method that harnesses the power of Knowledge Graph and Contrastive Learning to improve the prototypical semantic space learning.
Outcome: The proposed method improves the prototypical semantic space learning by using knowledge graphs and contrastive learning to learn the label semantic representation.
HS-GC: Holistic Semantic Embedding and Global Contrast for Effective Text Clustering (2024.lrec-main)

Copied to clipboard

Challenge: In this paper, we introduce Holistic Semantic Embedding and Global Contrast (HS-GC) to learn the instance- and cluster-level representations.
Approach: They propose a novel loss function that exploits different layers of semantic information in a deep neural network to provide a more holistic semantic text representation.
Outcome: The proposed model outperforms the state-of-the-art model on five text datasets and improves clustering accuracy of 5.9% and 3.2% on the StackOverflow and TREC datasets.
Infinite Babble: Inflating 3D Vision-Language Model Inference Overhead via Adversarial Geometric Perturbation (2026.findings-acl)

Copied to clipboard

Challenge: 3D Vision-Language Models (VLMs) are critical cognitive backbone for spatial intelligence, but their reliance on autoregressive decoding introduces a fundamental vulnerability regarding inference efficiency.
Approach: They propose a framework that triggers computational and economic exhaustion in 3D-VLMs by injecting imperceptible noise that forces the model into a state of pathological verbosity.
Outcome: The proposed framework amplifies output length and energy consumption by up to 6.45, demonstrating a potent capability to drain system resources.
DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing (2022.coling-1)

Copied to clipboard

Challenge: Existing parsers that learn graph representations based on static graphs are error-prone and disjointed . Graph-based parser can parse sentences efficiently but suffer from error propagation .
Approach: They propose a dynamic graph learning framework to learn graph representations based on a static graph constructed by an existing parser.
Outcome: The proposed parser outperforms the previous parsers on the SemEval-2015 task 18 dataset in three languages.
Improving Grammatical Error Correction by Correction Acceptability Discrimination (2024.lrec-main)

Copied to clipboard

Challenge: Existing Grammatical Error Correction (GEC) methods overlook the assessment of sentence-level syntax and semantics in the corrected sentence.
Approach: They propose a correction acceptance discrimination task to assess sentence-level syntax and semantics in corrected sentences and a pipeline method to remove invalid corrections.
Outcome: The proposed method improves F0.5 score by 1.01% over 13 GEC systems in the BEA-2019 test set.
Why Can Distillation Work with Limited Resources? A Systematic Study (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances in large language models have driven reasoning performance . low-resource distillation can boost models' performance, but a framework is missing .
Approach: They conduct a controlled experiment to find out why low-resource distillation can boost model performance . they find that distillation enhances the presence of advanced cognitive behaviors .
Outcome: The proposed model shows more flexible reasoning, the authors show . they show that distillation enhances the presence of advanced cognitive behaviors .
Natural Evolution-based Dual-Level Aggregation for Temporal Knowledge Graph Reasoning (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing models ignore asynchronous characteristics of event evolution, resulting in suboptimal performance.
Approach: They propose a Natural Evolution-based Dual-level Aggregation framework for TKG reasoning that incorporates asynchronous characteristics of event evolution into the model.
Outcome: The proposed model incorporates the asynchronous characteristics of event evolution for representation computation, thus improving prediction performance.

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