Challenge: Existing methods to learn matching models for retrieval-based chatbots are lacking.
Approach: They propose a method that uses a sequence-to-sequence architecture model as a weak annotator to judge the matching degree of unlabeled pairs and performs learning with both the weak signals and the unlabed data.
Outcome: The proposed method improves on two public data sets on matching models on retrieval-based chatbots.

Similar Papers

Learning a Matching Model with Co-teaching for Multi-turn Response Selection in Retrieval-based Dialogue Systems (P19-1)

Copied to clipboard

Challenge: Existing methods for learning a robust matching model from noisy training data are retrieval-based or generation-based.
Approach: They propose a general co-teaching framework that learns matching models from noisy training data.
Outcome: The proposed learning framework can improve existing models on two public data sets.
Retrieve, Discriminate and Rewrite: A Simple and Effective Framework for Obtaining Affective Response in Retrieval-Based Chatbots (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing work on retrieval-based chatbots has low-quality affect response . Existing frameworks for obtaining affective response are based on Retrieve-and-Rerank .
Approach: They propose a retrieval-based framework which provides affective response for retrieval chatbots by using a new discriminate-and-rewrite mechanism.
Outcome: The proposed framework outperforms existing baselines and can guarantee the quality of the response and satisfy the affect label.
Sampling Matters! An Empirical Study of Negative Sampling Strategies for Learning of Matching Models in Retrieval-based Dialogue Systems (D19-1)

Copied to clipboard

Challenge: Existing studies focus on constructing a matching model with sophisticated neural architectures, but do little to how to effectively learn such architectures from data.
Approach: They propose to sample negative examples to automatically construct a training set for effective model learning in retrieval-based dialogue systems by using four sampling strategies.
Outcome: The proposed learning method improves the performance of matching models on two benchmarks with three matching models.
A Pre-training Strategy for Zero-Resource Response Selection in Knowledge-Grounded Conversations (2021.acl-long)

Copied to clipboard

Challenge: Existing methods to train retrieval-based dialogue systems rely on crowd-sourced data . however, it is difficult to collect large-scale dialogues that are grounded on background knowledge .
Approach: They propose to decompose training of knowledge-grounded response selection into three tasks . they propose to combine query-passage matching task with query-dialogue history matching task .
Outcome: Experimental results show that the proposed model can perform comparable to existing methods . the retrieval-based system can leverage background knowledge when conversing with humans .
CORE: Cooperative Training of Retriever-Reranker for Effective Dialogue Response Selection (2023.acl-long)

Copied to clipboard

Challenge: Existing methods to train retrieval-based dialogue systems are suboptimal . existing methods to optimize retrieval and rerank modules are sub-optimal, causing sub-optimum performance.
Approach: They propose a retrieval-based dialogue system with a fast retriever and a smart response reranker that combine the best of both worlds.
Outcome: The proposed method can learn from each other and evolve together . it can be used in industrial applications and has powered industrial applications.
Training Neural Response Selection for Task-Oriented Dialogue Systems (P19-1)

Copied to clipboard

Challenge: Despite their popularity, retrieval-based models have had modest impact on task-oriented dialogue systems . main obstacle to their application is the low-data regime of most task-orientated dialogue tasks . e-commerce, banking, and other domains are applications of retrieval models .
Approach: They propose a method which pretrains a retrieval-based model on large general-domain conversational corpora and fine-tunes it for the target dialogue domain.
Outcome: The proposed method is evaluated on five diverse domains, ranging from e-commerce to banking.
Ad-hoc Document Retrieval using Weak-Supervision with BERT and GPT2 (2020.emnlp-main)

Copied to clipboard

Challenge: a weakly-supervised method is used for document retrieval tasks . traditional methods are used for ad-hoc querying, but they require large amounts of labeled data .
Approach: They propose a weakly-supervised method for training deep learning models for ad-hoc document retrieval using weak-supervision from the documents in the corpus.
Outcome: The proposed method outperforms state-of-the-art methods on a COVID-19 dataset and two news datasets without the need for labeling data.
Dually Interactive Matching Network for Personalized Response Selection in Retrieval-Based Chatbots (D19-1)

Copied to clipboard

Challenge: Existing models for personalized dialogues rank responses according to their semantic relevance with the given context.
Approach: They propose a dually interactive matching network (DIM) for presenting personalities of dialogue agents in retrieval-based chatbots.
Outcome: The proposed model outperforms the existing model by 14.5% and 27.7% on a PERSONA-CHAT dataset.
Filtering before Iteratively Referring for Knowledge-Grounded Response Selection in Retrieval-Based Chatbots (2020.findings-emnlp)

Copied to clipboard

Challenge: Experimental results show that FIRE outperforms previous methods for building knowledge-grounded retrieval-based chatbots . a method called Filtering before iteratively referring is used to ground a conversation on background knowledge .
Approach: They propose a method for grounding conversation on background knowledge . they use context filter and knowledge filter to make context and knowledge aware . experimental results show that FIRE outperforms previous methods .
Outcome: The proposed method outperforms previous methods on two datasets.
Neural Ranking with Weak Supervision for Open-Domain Question Answering : A Survey (2023.findings-eacl)

Copied to clipboard

Challenge: Neural ranking models require substantial amounts of relevance annotations, which is costly to scale.
Approach: They propose to train a NR model with weak supervision instead of annotations . they use a structured overview of standard WS signals used for training a model .
Outcome: The proposed approach reduces the cost of annotations by using weak supervision instead of a parametric model.

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