mlsanityData to 7 Oct 2026

Dialog Flow Induction for Constrainable LLM-Based Chatbots

arXiv 2408.01623 ↗First posted 3 Aug 2024cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

LLM-driven dialog systems are used in a diverse set of applications, ranging from healthcare to customer service. However, given their generalization capability, it is difficult to ensure that these chatbots stay within the boundaries of the specialized domains, potentially resulting in inaccurate information and irrelevant responses. This paper introduces an unsupervised approach for automatically inducing domain-specific dialog flows that can be used to constrain LLM-based chatbots. We introduce two variants of dialog flow based on the availability of in-domain conversation instances. Through human and automatic evaluation over various dialog domains, we demonstrate that our high-quality data-guided dialog flows achieve better domain coverage, thereby overcoming the need for extensive manual crafting of such flows.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 9 of its 11 references that are in the map. First posted on arXiv 3 Aug 2024.

Builds on

9 of 11 references.

References · 9

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  2. 2022Constitutional AI: Harmlessness from AI Feedbackcited by 2,950
  3. 2018MultiWOZ -- A Large-Scale Multi-Domain Wizard-of-Oz Dataset for Task-Oriented Dialogue Modellingcited by 760
  4. 2019Challenges in Building Intelligent Open-domain Dialog Systemscited by 147
  5. 2020Recent Advances and Challenges in Task-oriented Dialog Systemcited by 78
  6. 2020STAR: A Schema-Guided Dialog Dataset for Transfer Learningcited by 43
  7. 2021Schema-Guided Paradigm for Zero-Shot Dialogcited by 13
  8. 2022AnyTOD: A Programmable Task-Oriented Dialog Systemcited by 10
  9. 2019Few-Shot Dialogue Generation Without Annotated Data: A Transfer Learning Approachcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.