Constrained Policy Optimization for Controlled Self-Learning in Conversational AI Systems
Not on the map. Why?
Abstract (arXiv)
Recently, self-learning methods based on user satisfaction metrics and contextual bandits have shown promising results to enable consistent improvements in conversational AI systems. However, directly targeting such metrics by off-policy bandit learning objectives often increases the risk of making abrupt policy changes that break the current user experience. In this study, we introduce a scalable framework for supporting fine-grained exploration targets for individual domains via user-defined constraints. For example, we may want to ensure fewer policy deviations in business-critical domains such as shopping, while allocating more exploration budget to domains such as music. Furthermore, we present a novel meta-gradient learning approach that is scalable and practical to address this problem. The proposed method adjusts constraint violation penalty terms adaptively through a meta objective that encourages balanced constraint satisfaction across domains. We conduct extensive experiments using data from a real-world conversational AI on a set of realistic constraint benchmarks. Based on the experimental results, we demonstrate that the proposed approach is capable of achieving the best balance between the policy value and constraint satisfaction rate.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 13 of its 22 references that are in the map. First posted on arXiv 17 Sep 2022.
Builds on
13 of 22 references.
References · 13
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018Meta-Gradient Reinforcement Learningcited by 159
- 2016Off-policy evaluation for slate recommendationcited by 103
- 2019Linear Stochastic Bandits Under Safety Constraintscited by 90
- 2019What is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?cited by 20
- 2020Learning from eXtreme Bandit Feedbackcited by 17
- 2020Safe Exploration for Optimizing Contextual Banditscited by 14
- 2020Self-Supervised Contrastive Learning for Efficient User Satisfaction Prediction in Conversational Agentscited by 13
- 2019Thompson Sampling for Contextual Bandit Problems with Auxiliary Safety Constraintscited by 10
- 2020A scalable framework for learning from implicit user feedback to improve natural language understanding in large-scale conversational AI systemscited by 8
- 2021Neural model robustness for skill routing in large-scale conversational AI systems: A design choice explorationcited by 8
- 2019Lessons from Contextual Bandit Learning in a Customer Support Botcited by 5
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2023From Google Gemini to OpenAI Q* (Q-Star): A Survey of Reshaping the Generative Artificial Intelligence (AI) Research Landscapecited by 18
- 2023Scalable and Safe Remediation of Defective Actions in Self-Learning Conversational Systemscited by 0
- 2023Data Augmentation for Improving Tail-traffic Robustness in Skill-routing for Dialogue Systemscited by 0
- 2026CONDESION-BENCH: Conditional Decision-Making of Large Language Models in Compositional Action Spacecited by 0
- 2026CONDESION-BENCH: Conditional Decision-Making of Large Language Models in Compositional Action Space10 Apr 2026
- 2023From Google Gemini to OpenAI Q* (Q-Star): A Survey of Reshaping the Generative Artificial Intelligence (AI) Research Landscape18 Dec 2023
- 2023Data Augmentation for Improving Tail-traffic Robustness in Skill-routing for Dialogue Systems7 Jun 2023
- 2023Scalable and Safe Remediation of Defective Actions in Self-Learning Conversational Systems17 May 2023