Papers by Jian Luo

26 papers
ReCreate: Reasoning and Creating Domain Agents Driven by Experience (2026.acl-long)

Copied to clipboard

Challenge: Large Language Model (LLM) agents are reshaping the industrial landscape, but tasks differ widely, making them labor-intensive to build.
Approach: They propose an experience-driven framework for the automatic creation of domain agents . they leverage agent interaction histories to provide rich concrete signals on success or failure .
Outcome: The proposed framework outperforms human-designed agents and existing methods in experiments across diverse domains.
Doc2Bot: Accessing Heterogeneous Documents via Conversational Bots (2022.findings-emnlp)

Copied to clipboard

Challenge: Documents contain various structures that hinder the ability of machines to comprehend . user information needs are often underspecified, and the nature of heterogeneous documents poses challenges.
Approach: They propose a dataset for building machines that help users seek information via conversations . their dataset contains over 100,000 turns based on Chinese documents from five domains .
Outcome: The proposed tasks are challenging and worthy of further research.
Preview, Attend and Review: Schema-Aware Curriculum Learning for Multi-Domain Dialogue State Tracking (2021.acl-short)

Copied to clipboard

Challenge: Existing dialog state tracking models neglect rich structural information in a dataset.
Approach: They propose to use curriculum learning to leverage dialog state tracking data . they propose a model-agnostic framework that pre-trains a DST model with schema information .
Outcome: The proposed framework improves performance over a transformer-based and RNN-based model on WOZ2.0 and MultiWOZ2.1.
AGSC: Adaptive Granularity and Semantic Clustering for Uncertainty Quantification in Long-text Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for aggregating large-form outputs overlook the nuance of neutral information and suffer from the high computational cost of fine-grained decomposition.
Approach: They propose a UQ framework that uses NLI neutral probabilities as triggers to distinguish irrelevance from uncertainty, reducing computation costs.
Outcome: Experiments on BIO and LongFact show that the proposed framework reduces inference time by 60% compared to full atomic decomposition.
KGE-CL: Contrastive Learning of Tensor Decomposition Based Knowledge Graph Embeddings (2022.coling-1)

Copied to clipboard

Challenge: Existing knowledge graph embedding methods ignore semantic similarity between related entities and entity-relation couples in different triples .
Approach: They propose a contrastive learning framework for tensor decomposition based (TDB) KGE that can shorten the semantic distance of related entities and entity-relation couples in different triples and thus improve the performance of KGE.
Outcome: The proposed method achieves 51.2% MRR, 46.8% Hits@1 on three standard KGE datasets, 37.8% MRR and 28.6% Hits @1 on FB15k-237 datasets and 59.1% MRR .
PRP-Graph: Pairwise Ranking Prompting to LLMs with Graph Aggregation for Effective Text Re-ranking (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for pairing ranking prompting only output the same label for comparison results of different confidence intervals without considering the uncertainty of pairwise comparison.
Approach: They propose a pairwise ranking prompting approach that exploits the output probabilities of target labels to capture the degree of certainty of comparison results.
Outcome: The proposed method shows strong robustness and acceptable efficiency on the BEIR benchmark.
Prototype Tuning: A Meta-Learning Approach for Few-Shot Document-Level Relation Extraction with Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Few-Shot Document-Level Relation Extraction (FSDLRE) aims to develop models capable of generalizing to new categories with minimal support examples.
Approach: They propose a meta-training approach to train Large Language Models to improve their ICL capabilities . they construct simulated episodes using relation types that do not overlap with test corpus .
Outcome: Experimental results show that the proposed approach outperforms baseline models on few-shot tasks.
MUR: Momentum Uncertainty guided Reasoning for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for optimizing reasoning quality are limited by overthinking.
Approach: They propose a method that allocates thinking budgets to critical reasoning steps by tracking and aggregating step-wise uncertainty over time.
Outcome: The proposed method reduces computation by over 45% on average while improving accuracy by 0.33–3.46%.
DTCRS: Dynamic Tree Construction for Recursive Summarization (2025.acl-long)

Copied to clipboard

Challenge: Recursive summarization (RAG) is an important method for mitigating large model hallucinations and enhancing answer interpretability.
Approach: They propose a method that dynamically generates summary trees based on document structure and query semantics.
Outcome: The proposed method significantly reduces summary tree construction time and achieves substantial improvements across three QA tasks.
CodeTool: Enhancing Programmatic Tool Invocation of LLMs via Process Supervision (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to tool invocation are often unnecessarily long and require lengthy reasoning paths.
Approach: They propose a framework for stepwise code generation that improves LLM tool invocation . they incorporate two distinct process rewards: the On-the-spot and the Latent Reward .
Outcome: The proposed framework improves LLM tool invocation by leveraging the concise nature of code.
Meet Changes with Constancy: Learning Invariance in Multi-Source Translation (2020.coling-main)

Copied to clipboard

Challenge: Existing approaches to multi-source neural machine translation neglect inconsistencies between sources of information.
Approach: They propose a source invariance network to learn invariant information of parallel sources . they propose to integrate such network with multi-encoder based multi-source NMT methods .
Outcome: The proposed approach achieves clear gains in translation quality and captures implicit invariance between different sources.
GCoT-Decoding: Unlocking Deep Reasoning Paths for Universal Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Recent work on Chain-of-Thought reasoning requires manual prompts to guide the model.
Approach: They propose a general decoding strategy that generates CoT-style reasoning paths without prompts.
Outcome: The proposed method maintains strong performance on fixed and free QA tasks and achieves significant improvements on free qa.
DialogueCSE: Dialogue-based Contrastive Learning of Sentence Embeddings (2021.emnlp-main)

Copied to clipboard

Challenge: Conventional approaches to learning sentence embeddings from dialogues employ the siamese-network for this task, but such architecture yields a large gap between training and evaluating.
Approach: They propose a dialogue-based contrastive learning approach to learn sentence embeddings from dialogues using a siamese-network.
Outcome: The proposed model outperforms baseline methods on three multi-turn dialogue datasets in terms of MAP and Spearman’s correlation measures.
DeKeyNLU: Enhancing Natural Language to SQL Generation through Task Decomposition and Keyword Extraction (2025.findings-emnlp)

Copied to clipboard

Challenge: NL2SQL provides a model-centric paradigm that simplifies database access for non-technical users . challenges such as inaccurate task decomposition and keyword extraction remain major bottlenecks .
Approach: They propose a RAG-based NL2SQL pipeline that employs three modules for query understanding, entity retrieval, and generation to improve SQL generation accuracy.
Outcome: The proposed pipeline improves the accuracy of query generation on BIRD and Spider datasets.
From Parse-Execute to Parse-Execute-Refine: Improving Semantic Parser for Complex Question Answering over Knowledge Base (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for parsing knowledge-base questions into executable logical forms have not been successful on complex KBQA.
Approach: They propose a new semantic parser called KoPL to model the reasoning processes . they propose 'parse-execute-refine' paradigm to unlock reasoning ability .
Outcome: The proposed parser performs better than the state-of-the-art on complex KBQA . the proposed parsed-execute-refine paradigm can model complex reasoning steps .
Act as you think: Reinforcing Consistent Reasoning in Medical Visual Question Answering (2026.acl-long)

Copied to clipboard

Challenge: Recent advances have improved the accuracy of medical visual question answering (Med-VQA) however, the high stakes nature of the medical domain has precipitated a shift towards interpretability and transparency of reasoning processes.
Approach: They propose a reinforcement learning from verifiable rewards framework that rewards internal consistency and logical coherence.
Outcome: The proposed framework rewards internal consistency and logical coherence, and is highly versatile, the authors show.
Attention Basin: Why Contextual Position Matters in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are sensitive to the contextual position of information in input.
Approach: They introduce Attention-Driven Reranking (AttnRank) which estimates a model’s intrinsic positional attention preferences using a small calibration set and reorders retrieved documents or few-shot examples to align the most salient content with these high-attention positions.
Outcome: Experiments on multi-hop QA and few-shot in-context learning tasks show that AttnRank achieves substantial improvements across 10 large language models of varying architectures and scales, without modifying model parameters or training procedures.
Rethinking Entropy Interventions in RLVR: An Entropy Change Perspective (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have remarkable reasoning capabilities in complex tasks such as mathematics and coding.
Approach: They propose an entropy-modulation method that adaptively reweighs tokens based on theoretically-estimated entropic variations.
Outcome: The proposed method outperforms state-of-the-art methods in six mathematical reasoning and three coding benchmarks.
Enhancing Chain-of-Thoughts Prompting with Iterative Bootstrapping in Large Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Chain-of-thought (CoT) prompting is a technique to enhance the reasoning abilities of Large language models (LLMs) however, the reasoning chains of demonstrations are observed to be prone to errors, which can lead to incorrect reasoning during inference.
Approach: They propose an iterative bootstrapping technique to enhance the reasoning abilities of Large language models (LLMs) by generating a series of reasoning steps to obtain the answer, and using the reasoning chains as exemplars to demonstrate the task.
Outcome: The proposed method improves the performance of Large language models (LLMs) on three reasoning tasks on ten datasets.
Estimating Soft Labels for Out-of-Domain Intent Detection (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to detect out-of-dominance (OOD) intents are limited by the lack of OOD samples.
Approach: They propose an adaptive soft pseudo labeling method that can estimate soft labels for pseudo OOD samples when training OOD detectors.
Outcome: The proposed method outperforms competing methods on three benchmark datasets and consistently outperformed previous methods.
Doc-V*: Coarse-to-Fine Interactive Visual Reasoning for Multi-Page Document VQA (2026.acl-long)

Copied to clipboard

Challenge: Existing OCR-free approaches to document visual question answering are brittle and passive.
Approach: They propose an OCR-free agentic framework that casts multi-page DocVQA as sequential evidence aggregation.
Outcome: The proposed framework outperforms open-source and proprietary models in five benchmarks and improves out-of-domain performance by 47.9% over baseline.
OpenCoder: The Open Cookbook for Top-Tier Code Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence.
Approach: They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included .
Outcome: The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model.
MAXS: Meta-Adaptive Exploration with LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for inference are often myopic and have divergent reasoning paths . a meta-adaptive reasoning framework is proposed to improve the efficiency of LLM agents .
Approach: They propose a meta-adaptive reasoning framework that integrates tool execution and reasoning planning.
Outcome: The proposed framework outperforms existing methods in performance and inference efficiency.
CBLUE: A Chinese Biomedical Language Understanding Evaluation Benchmark (2022.acl-long)

Copied to clipboard

Challenge: a new benchmark for biomedical language understanding is being developed in Chinese . most benchmarks are limited to English, which makes it difficult to replicate success in other languages.
Approach: They propose to use Chinese biomedical language understanding evaluation benchmarks to evaluate Chinese models.
Outcome: The proposed benchmarks show that the current models perform worse than the human ceiling.
Browsing Like Human: A Multimodal Web Agent with Experiential Fast-and-Slow Thinking (2025.acl-long)

Copied to clipboard

Challenge: Existing web agents lack visual perception, planning, and memory abilities, but their reasoning process is deviate from human cognition.
Approach: They propose a multimodal web agent framework that emulates human planning process to decompose complex user instructions.
Outcome: The proposed framework emulates human planning process to decompose complex user instructions.
Ensuring Safe and High-Quality Outputs: A Guideline Library Approach for Language Models (2024.naacl-long)

Copied to clipboard

Challenge: Guide-Align is a guideline-oriented approach to augment the safety and quality of Large Language Models.
Approach: They propose a guideline-oriented method to augment the safety and quality of large language models.
Outcome: The proposed method outperforms existing methods on three benchmarks and shows significant improvements in security and quality.

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