Papers by Dan Guo

10 papers
Task-Oriented Dialogue as Dataflow Synthesis (2020.tacl-1)

Copied to clipboard

Challenge: Existing approaches to task-oriented dialogue represent dialogue state as a dataflow graph . microsoft's SMCalFlow dataset features complex dialogues about events, weather, places, and people .
Approach: They propose a dataflow graph-based dialogue agent that maps each user utterance to a program that extends this graph.
Outcome: The proposed framework improves representability and predictability in natural dialogues . it uses dataflow graphs and metacomputation to map user intents to a program .
Beyond Tokens: Concept-Level Training Objectives for LLMs (2026.eacl-short)

Copied to clipboard

Challenge: Large language models (LLMs) are trained with a surprisingly narrow objective: predicting the next token in a sequence.
Approach: They propose a shift from token-level to concept-level prediction where concepts group multiple surface forms of the same idea.
Outcome: The proposed model improves on human-level models on diverse NLP benchmarks.
Value-Agnostic Conversational Semantic Parsing (2021.acl-long)

Copied to clipboard

Challenge: Existing models rely on rich representations of dialogue history that include all previously generated components of the output.
Approach: They propose a model that abstracts over values to focus prediction on type- and function-level context.
Outcome: The proposed model outperforms baseline models by 7.3% and 10.6% on SMCalFlow and TreeDST datasets.
A Label-Aware Autoregressive Framework for Cross-Domain NER (2022.findings-naacl)

Copied to clipboard

Challenge: Existing approaches to named entity recognition (NER) focus on reducing discrepancy between tokens and tokens, but transfer of valuable label information is often not considered or ignored.
Approach: They propose a framework that borrows entity information from the source domain to enhance NER in the target domain.
Outcome: The proposed model improves over the state-of-the-art model on several datasets.
HIGGS: Pushing the Limits of Large Language Model Quantization via the Linearity Theorem (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for quantizing large language models focus on breaking down the problem into layer-wise sub-problems and minimizing per-layer error, but this approach lacks theoretical justification and the metrics employed may be sub-optimal.
Approach: They propose a "linearity theorem" establishing a direct relationship between the layer-wise reconstruction error and the model perplexity increase due to quantization.
Outcome: The proposed method outperforms previous data-free methods and improves accuracy-compression trade-offs on Llama-family models.
LAD-RAG: Layout-aware Dynamic RAG for Visually-Rich Document Understanding (2026.acl-long)

Copied to clipboard

Challenge: Conventional retrieval-augmented generation (RAG) methods encode content in isolated chunks during ingestion, losing structural and cross-page dependencies, and retrieve a fixed number of pages at inference.
Approach: They propose a Layout-Aware Dynamic RAG framework that encodes content in isolated chunks during ingestion and retrieves a fixed number of pages at inference.
Outcome: Experiments on MMLongBench-Doc, LongDocURL, DUDE, and MP-DoxVQA show that LAD-RAG improves retrieval, achieving over 90% perfect recall on average without any top-k tuning, and outperforming baseline retrievers by up to 20% in recall at comparable noise levels.
A Survey of Inductive Reasoning for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Inductive reasoning is an important task for large language models (LLMs).
Approach: They propose a survey of inductive reasoning for large language models . they categorize methods into three main areas: post-training enhancement, test-time exploration, and data augmentation.
Outcome: The proposed method improves inductive reasoning in large language models.
PAR2-RAG: Planned Active Retrieval and Reasoning for Multi-Hop Question Answering (2026.acl-industry)

Copied to clipboard

Challenge: Multi-hop question answering is a practical bottleneck in industry applications . large language models (LLMs) fail frequently when evidence coverage is incomplete or reasoning trajectories drift .
Approach: They propose a training-free two-stage framework that separates coverage from commitment . it performs breadth-first anchoring to build a high-recall evidence frontier . compared with IRCoT, it achieves 23.5% higher answer accuracy .
Outcome: The proposed framework outperforms strong baselines in MHQA benchmarks and achieves 23.5% higher answer accuracy and 10.5% NDCG gains in retrieval quality.
Constrained Labeled Data Generation for Low-Resource Named Entity Recognition (2021.findings-acl)

Copied to clipboard

Challenge: Named Entity Recognition (NER) in lowresource languages has been a challenge for years . Existing methods suffer from low quality of annotated data in target language .
Approach: They propose a method that uses projected annotations to generate pseudo supervised data with a transformer language model and a constrained beam search.
Outcome: The proposed method achieves state-of-the-art or competitive performance in low-resource languages.
Psyche-R1: Towards Reliable Psychological LLMs through Unified Empathy, Expertise, and Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Recent reasoning-augmented LLMs have demonstrated impressive capabilities across a wide range of domains owing to their exceptional text understanding capabilities.
Approach: They propose a Chinese psychological LLM that integrates empathy, psychological expertise, and reasoning.
Outcome: The proposed model produces over 75k high-quality psychological questions paired with detailed rationales, generated through and iterative prompt-rationale optimization procedure, along with 73k empathetic dialogues.

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