Challenge: Task oriented dialog systems often rely on static exploration strategies that do not adapt to dynamic dialog contexts.
Approach: They propose a dialog policy learning framework that formalizes the exploration challenge through a structured cognitive state space C.
Outcome: The proposed framework achieves SOTA performance in success rate, efficiency, and generalization.

Similar Papers

Guided Dialog Policy Learning: Reward Estimation for Multi-Domain Task-Oriented Dialog (D19-1)

Copied to clipboard

Challenge: Existing methods to learn dialog policy require elaborate design and user goals.
Approach: They propose an algorithm that estimates the reward signal and infers the user goal in dialog sessions.
Outcome: The proposed algorithm achieves higher task success than state-of-the-art models on a multi-domain task-oriented dialog dataset.
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.
Learning Low-Resource End-To-End Goal-Oriented Dialog for Fast and Reliable System Deployment (2020.acl-main)

Copied to clipboard

Challenge: Existing end-to-end dialog systems perform less effectively when data is scarce.
Approach: They propose a Meta-Dialog System which combines meta-learning and human-machine collaboration to improve dialog learning by a new extended-bAbI dataset and a transformed MultiWOZ dataset.
Outcome: The proposed system outperforms non-meta-learning baselines on a new extended-bAbI dataset and a transformed MultiWOZ dataset for low-resource goal-oriented dialog learning.
Constrained Policy Optimization for Controlled Self-Learning in Conversational AI Systems (2023.acl-industry)

Copied to clipboard

Challenge: Recent self-learning methods based on user satisfaction metrics and contextual bandits have shown promising results to enable consistent improvements in conversational AI systems.
Approach: They propose a meta-gradient learning approach that adjusts constraint violation penalty terms adaptively through a user-defined meta objective that encourages balanced constraint satisfaction across domains.
Outcome: The proposed framework supports fine-grained exploration targets for individual domains via user-defined constraints.
Meta-Reasoner: Dynamic Guidance for Optimized Inference-time Reasoning in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances on prompting and post-training have enabled LLMs to perform step-wise reasoning tasks, but they tend to explore unproductive solution paths without effective backtracking or strategy adjustment.
Approach: They propose a framework that empowers LLMs to “think about how to think” and dynamically adapts reasoning strategies in real-time.
Outcome: The proposed framework outperforms previous SOTA methods by 9-12% in accuracy while reducing inference time by 28-35% under the same compute budget.
A Collaborative Multi-agent Reinforcement Learning Framework for Dialog Action Decomposition (2021.emnlp-main)

Copied to clipboard

Challenge: Currently, most reinforcement learning methods for dialog policy learning train a centralized agent that selects a predefined joint action concatenating domain name, intent type, and slot name.
Approach: They propose a hierarchical multi-agent framework in which each part of the action is led by a different agent and a joint optimization process that makes agents can exchange their policy information.
Outcome: The proposed framework reduces labor costs for action templates and decreases the size of the action space for each agent.
Multi-Agent Task-Oriented Dialog Policy Learning with Role-Aware Reward Decomposition (2020.acl-main)

Copied to clipboard

Challenge: Many studies have applied reinforcement learning to train a dialog policy . but modeling a real-world user simulator is challenging and requires domain expertise .
Approach: They propose to build dialog policies with two agents as dialog agents to avoid building a user simulator beforehand.
Outcome: The proposed method can build a system policy and a user policy simultaneously . it can achieve high task success rate through conversational interaction .
EDC: Effective and Efficient Dialog Comprehension For Dialog State Tracking (2024.naacl-long)

Copied to clipboard

Challenge: Existing methods for dialog state tracking face trade-offs between accuracy and efficiency . effective and efficient dialog comprehension (EDC) predicts domains, slot names and slot values of dialog state step-by-step for better accuracy .
Approach: They propose an alternative method that leverages the tree structure of the dialog state.
Outcome: The proposed approach achieves state-of-the-art JGA accuracy and is more efficient than previous models.
DKAF: KB Arbitration for Learning Task-Oriented Dialog Systems with Dialog-KB Inconsistencies (2023.findings-acl)

Copied to clipboard

Challenge: Existing approaches for learning task-oriented dialog agents assume the KB snapshot is current during training.
Approach: They propose a dialog-KB arbitration framework which predicts the contemporary KB snapshot for each train dialog.
Outcome: The proposed model performs better on two publicly available dialog datasets than baselines on both datasets.
Budgeted Policy Learning for Task-Oriented Dialogue Systems (P19-1)

Copied to clipboard

Challenge: Existing approaches to integrating reinforcement learning into task-oriented dialogue systems require a fixed, small amount of user interactions to learn.
Approach: They propose a budget-conscious scheduling approach that optimizes a fixed, small amount of user interactions for dialogue agent learning.
Outcome: The proposed approach improves on a movie-ticket booking task with simulated and real users.

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