activity
20122023
most citedOn the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures

17 citations · 28 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CL2023

Multi-User MultiWOZ: Task-Oriented Dialogues among Multiple Users

Yohan Jo, Xinyan Zhao, Arijit Biswas +5

While most task-oriented dialogues assume conversations between the agent and one user at a time, dialogue systems are increasingly expected to communicate with multiple users simu…

cs.CL2021★ 3 cited

Alexa Conversations: An Extensible Data-driven Approach for Building Task-oriented Dialogue Systems

Anish Acharya, Suranjit Adhikari, Sanchit Agarwal +28

Traditional goal-oriented dialogue systems rely on various components such as natural language understanding, dialogue state tracking, policy learning and response generation. Trai…

cs.CL2021

OodGAN: Generative Adversarial Network for Out-of-Domain Data Generation

Petr Marek, Vishal Ishwar Naik, Vincent Auvray +1

Detecting an Out-of-Domain (OOD) utterance is crucial for a robust dialog system. Most dialog systems are trained on a pool of annotated OOD data to achieve this goal. However, col…

cs.CL2020★ 3 cited

Dialog Simulation with Realistic Variations for Training Goal-Oriented Conversational Systems

Chien-Wei Lin, Vincent Auvray, Daniel Elkind +10

Goal-oriented dialog systems enable users to complete specific goals like requesting information about a movie or booking a ticket. Typically the dialog system pipeline contains mu…

cs.AI2012★ 17 cited

On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures

Vincent Auvray, Louis Wehenkel

The problem of learning Markov equivalence classes of Bayesian network structures may be solved by searching for the maximum of a scoring metric in a space of these classes. This p…

cs.LG2012★ 5 cited

Learning Inclusion-Optimal Chordal Graphs

Vincent Auvray, Louis Wehenkel

Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algor…