Papers by Kun Fu

12 papers
Don’t Change Me! User-Controllable Selective Paraphrase Generation (2021.eacl-main)

Copied to clipboard

Challenge: a new technique allows paraphrase generation to be user-controlled . a user looking for cheap hotels in New York would not find the other answer helpful .
Approach: They propose a method that provides a user with explicit tags that can be placed around any arbitrary segment of text to mean "don't change me!" they propose allowing user-controllable paraphrase generation by fine-tuning model that exhibits this behavior .
Outcome: The proposed technique is language agnostic and tested in English and Chinese.
DeepSynth-Eval: Objectively Evaluating Information Consolidation in Deep Survey Writing (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are evolving towards autonomous agents . retrieval capabilities are well-benchmarked, but post-retrieval synthesis is under-evaluated due to open-ended writing.
Approach: They propose a benchmark to evaluate information consolidation capabilities using survey papers as gold standards.
Outcome: The proposed benchmark analyzes the post-retrieval synthesis stage of large language models . it leverages high-quality survey papers as gold standards and reverse-engineers research requests . the proposed benchmark outperforms single-turn generation and reduces hallucinations .
Sparse Black-Box Multimodal Attack for Vision-Language Adversary Generation (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing adversarial attacks using imperceptible perturbations are challenging to simulate . e-commerce product restrictions and hate speech monitoring are examples of such attacks .
Approach: They propose a black-box adversarial attack that leverages sparse perturbations to simulate adversarials exhibited by illegal merchants in the black- box scenario.
Outcome: The proposed method outperforms existing attacks and unimodal attacks by treating images and text in discrete space and outperforming existing models.
LaTeX2Solver: a Hierarchical Semantic Parsing of LaTeX Document into Code for an Assistive Optimization Modeling Application (2023.acl-demo)

Copied to clipboard

Challenge: Existing systems that translate optimization formulas manually are cumbersome and time-consuming.
Approach: They propose a system that converts optimization formulas from TeX document to solver language.
Outcome: The proposed system helps operations research practitioners convert optimization formulations into solver modeling languages.
AgentThink: A Unified Framework for Tool-Augmented Chain-of-Thought Reasoning in Vision-Language Models for Autonomous Driving (2025.findings-emnlp)

Copied to clipboard

Challenge: Vision-Language Models struggle with hallucinations, inefficient reasoning, and limited real-world validation hinders accurate perception and robust step-by-step reasoning.
Approach: AgentThink integrates Chain-of-Thought reasoning with dynamic, agent-style tool invocation for autonomous driving tasks.
Outcome: Experiments on the DriveLMM-o1 benchmark show AgentThink significantly boosts overall reasoning scores by 53.91% and enhances answer accuracy by 33.54% .
Calibrating Inference Time Alignment with Sequence-level Risk Accumulation (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to decode large language models (LLMs) often over-reject benign information, limiting their generalizability in real-world scenarios where harmful and benign information coexist.
Approach: They propose a framework to regulate decoding alignments for Large Language Models (LLMs) they employ a reward-guided branch decoding paradigm to incorporate safety awareness during generation.
Outcome: The proposed framework achieves superior performance on four attack benchmarks and two neutral datasets.
Just Ask One More Time! Self-Agreement Improves Reasoning of Language Models in (Almost) All Scenarios (2024.findings-acl)

Copied to clipboard

Challenge: chain-of-thought (CoT) prompting has been shown to be effective on complex reasoning tasks, but the naive greedy decoding used in CoT prompting causes the repetitiveness and local optimality.
Approach: They propose a generalizable ensemble-optimization method that uses a set of reasoning paths to prompt a language model one more time to determine the optimal answer.
Outcome: The proposed method can be generalized to almost all scenarios where the type of input questions and answer format of reasoning paths may be unknown.
TokenSelect: Efficient Long-Context Inference and Length Extrapolation for LLMs via Dynamic Token-Level KV Cache Selection (2025.emnlp-main)

Copied to clipboard

Challenge: Rapid advances in Large Language Models have spurred demand for processing extended context sequences . however, performance degradation due to sequence lengths out-of-distribution and excessively long inference times are limiting LLMs in long-context scenarios.
Approach: They propose a training-free method for efficient and accurate long-context inference . they selectively involves a few critical KV cache tokens in attention calculation .
Outcome: The proposed method speeds up attention computation and accelerates inference time while reducing selection overhead.
Knowledge Graph-Driven Memory Editing with Directional Interventions (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) are hampered by inaccuracies and outdated information.
Approach: They propose a framework that constructs knowledge graphs using available information to guide the direction of knowledge editing.
Outcome: The proposed framework allows consistent, aligned, and stable information during large-scale editing scenarios.
Noisy-Labeled NER with Confidence Estimation (2021.naacl-main)

Copied to clipboard

Challenge: Recent studies in deep learning have shown significant progress in named entity recognition (NER) . however, most existing works assume clean data annotation, while real-world data typically involve a large amount of noises.
Approach: They propose a confidence estimation approach for named entity recognition using noisy labels using local and global independence assumptions.
Outcome: The proposed method marginalizes out labels of low confidence with a CRF model and integrates it into a self-training framework for boosting performance.
A Survey of Mathematical Reasoning in the Era of Multimodal Large Language Model: Benchmark, Method & Challenges (2025.findings-acl)

Copied to clipboard

Challenge: This survey provides **the first comprehensive analysis of mathematical reasoning in the era of multimodal large language models** . integrating large language model with mathematical reasoning tasks is becoming significant as AI advances .
Approach: They review over 200 studies published since 2021 and examine the state-of-the-art developments in Math-LLMs . they identify five major challenges hindering the realization of AGI in this domain .
Outcome: The authors examine the state-of-the-art developments in Math-LLMs with a focus on multimodal settings.
Scaling Law for Multimodal Large Language Model Supervised Fine-Tuning (2026.acl-long)

Copied to clipboard

Challenge: supervised fine-tuning (SFT) is crucial for multimodal large language models, yet a comprehensive scaling law is lacking . et al.: scaling laws focus on model size, pre-training tokens, and MLLM SFT data volumes .
Approach: They propose two scaling laws to guide optimal model-data configuration . they propose one applicable when training data volumes are well defined by researchers .
Outcome: The proposed scaling laws provide valuable recommendations for optimal resource allocation . they show that the proposed laws are more accurate than existing models .

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