IP Library Granted Patent US 12,380,285
Granted Patent B2
US 12,380,285 · App. 17/900,806 · Granted Aug 5, 2025

Grounded dialogue generation with cross-encoding re-ranker, grounding span prediction, and passage dropout

Inventors: Mei Ling Helen Meng (Hong Kong, CN); Xixin Wu (Hong Kong, CN); Kun Li (Hong Kong, CN); Tianhua Zhang (Hong Kong, CN); Liping Tang (Hong Kong, CN); Junan Li (Hong Kong, CN); Hongyuan Lu (Shanghai, CN)
Assignee: Centre for Perceptual and Interactive Intelligence (CPII) Limited
G06F40/51G06F16/3329
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,380,285
App. No.
17/900,806
Granted
Aug 5, 2025
Kind
B2
Abstract

An information-seeking dialogue system can be trained using a pipeline process having stages, or components, of passage retrieval (selecting passages relevant to a query from a corpus or knowledge base), re-ranking, and generating a response to the query based on one or more of the re-ranked passages. Each stage, or component, of the pipeline can be individually optimized based on ground truth data.

Claims (54)

1. A computer-implemented method for responding to user queries, the method comprising:

obtaining a training set, the training set including a plurality of passages, a plurality of queries, and a plurality of responses, the training set further including association data associating particular queries of the plurality of queries with particular passages of the plurality of passages and particular responses of the plurality of responses;

performing a training process using the training set, wherein the training process includes:

training a retriever model to identify similarities between a query and a passage;

training a re-ranking model to rank a plurality of passages based on a distance metric defining a distance between a passage and a query, wherein the re-ranking model uses an ensemble of transformer language models that each output a distance function between a passage and a query, and wherein the re-ranking model ranks the plurality of passages based on a weighted sum of the distance functions of the transformer language models; and

training a generator model to generate a response to a query based on a passage; and

performing a testing process, wherein the testing process includes:

receiving a testing query;

using the retriever model to retrieve a plurality of passages responsive to the testing query;

using the re-ranking model to rank the retrieved passages based on the testing query; and

using the generator model to generate a response based on a highest-ranking one of the retrieved passages.

2. The method of claim 1 wherein the retriever model is a Dense Passage Retriever (DPR) model having a first encoder for a query and a second encoder for a passage.

3. The method of claim 2 wherein the retriever model defines similarity based on a dot product of an encoding of the query using the first encoder and an encoding of the passage using the second encoder.

4. The method of claim 1 wherein the ensemble of transformer language models includes at least three transformer language models.

5. The method of claim 1 wherein training the re-ranking model includes training one or more weights for the weighted sum.

6. The method of claim 1 wherein training the generator model includes training grounding span prediction as an auxiliary task.

7. The method of claim 1 wherein training the generator model includes applying passage dropout.

8. The method of claim 1 wherein each query in the training set includes a query history and wherein the testing query also includes a query history.

9. A system comprising:

a memory; and

a processor coupled to the memory and configured to:

obtain a training set, the training set including a plurality of passages, a plurality of queries, and a plurality of responses, the training set further including association data associating particular queries of the plurality of queries with particular passages of the plurality of passages and particular responses of the plurality of responses;

perform a training process using the training set, wherein performing the training process includes:

training a retriever model to identify similarities between a query and a passage;

training a re-ranking model to rank a plurality of passages based on a distance metric defining a distance between a passage and a query, wherein the re-ranking model uses an ensemble of transformer language models that each output a distance function between a passage and a query, and wherein the re-ranking model ranks the plurality of passages based on a weighted sum of the distance functions of the transformer language models; and

training a generator model to generate a response to a query based on a passage; and

perform a testing process, wherein the testing process includes:

receiving a testing query;

using the retriever model to retrieve a plurality of passages responsive to the testing query;

using the re-ranking model to rank the retrieved passages based on the testing query; and

using the generator model to generate a response based on a highest-ranking one of the retrieved passages.

10. The system of claim 9 wherein the retriever model is a Dense Passage Retriever (DPR) model having a first encoder for a query and a second encoder for a passage and wherein the retriever model defines similarity based on a dot product of an encoding of the query using the first encoder and an encoding of the passage using the second encoder.

11. The system of claim 10 wherein:

training the re-ranking model includes training one or more weights for the weighted sum.

12. The system of claim 9 wherein training the generator model includes training grounding span prediction as an auxiliary task.

13. The system of claim 9 wherein training the generator model includes applying passage dropout.

14. A non-transitory computer readable storage medium having stored therein program code instructions that, when executed by a processor of a computer system, cause the processor to perform a method comprising:

obtaining a training set, the training set including a plurality of passages, a plurality of queries, and a plurality of responses, the training set further including association data associating particular queries of the plurality of queries with particular passages of the plurality of passages and particular responses of the plurality of responses;

performing a training process using the training set, wherein the training process includes:

training a retriever model to identify similarities between a query and a passage;

training a re-ranking model to rank a plurality of passages based on a distance metric defining a distance between a passage and a query, wherein the re-ranking model uses an ensemble of transformer language models that each output a distance function between a passage and a query, and wherein the re-ranking model ranks the plurality of passages based on a weighted sum of the distance functions of the transformer language models; and

training a generator model to generate a response to a query based on a passage; and

performing a testing process, wherein the testing process includes:

receiving a testing query;

using the retriever model to retrieve a plurality of passages responsive to the testing query;

using the re-ranking model to rank the retrieved passages based on the testing query; and

using the generator model to generate a response based on a highest-ranking one of the retrieved passages.

15. The computer readable storage medium of claim 14 wherein the retriever model is a Dense Passage Retriever (DPR) model having a first encoder for a query and a second encoder for a passage.

16. The computer readable storage medium of claim 15 wherein the retriever model defines similarity based on a dot product of an encoding of the query using the first encoder and an encoding of the passage using the second encoder.

17. The computer readable storage medium of claim 14 wherein the ensemble of transformer language models includes at least three transformer language models.

18. The computer readable storage medium of claim 14 wherein training the re-ranking model includes training one or more weights for the weighted sum.

19. The computer readable storage medium of claim 14 wherein training the generator model includes training grounding span prediction as an auxiliary task.

20. The computer readable storage medium of claim 14 wherein training the generator model includes applying passage dropout.

21. The computer readable storage medium of claim 14 wherein each query in the training set includes a query history and wherein the testing query also includes a query history.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 15, 2022
From: MENG, MEI LING HELEN; WU, XIXIN; LI, KUN; ZHANG, TIANHUA; TANG, LIPING; LI, JUNAN; LU, HONGYUAN
To: CENTRE FOR PERCEPTUAL AND INTERACTIVE INTELLIGENCE (CPII) LIMITED
Reel/Frame 061113/0068 →
Continuity (1)
Related Publication 20240070403A1 · Feb 29, 2024
References Cited (33)
US 11803401B1 · Ferrucci · 2023 [cited by examiner]
US 12106056B2 · Lam · 2024 [cited by examiner]
US 20220277135A1 · Kryscinski · 2022 [cited by examiner]
US 20220374459A1 · Liu · 2022 [cited by examiner]
US 20220383159A1 · Yavuz · 2022 [cited by examiner]
US 20220398384A1 · Wang · 2022 [cited by examiner]
US 20230119109A1 · Choubey · 2023 [cited by examiner]
US 20230267126A1 · Frieder · 2023 [cited by examiner]
US 20230267267A1 · Sukla · 2023 [cited by examiner]
US 20230367965A1 · Hoshi · 2023 [cited by examiner]
US 20230418868A1 · Seonwoo · 2023 [cited by examiner]
US 20240070403A1 · Meng · 2024 [cited by examiner]
Leonhardt (Leonhardt J, Beringer F, Anand A. Exploiting Sentence-Level Representations for Passage Ranking. arXiv preprint arXiv:2106.07316. Jun. 14, 2021.) (Year: 2021). [cited by examiner]
Feng (Feng S, Patel SS, Wan H, Joshi S. MultiDoc2Dial: Modeling dialogues grounded in multiple documents. arXiv preprint arXiv: 2109.12595. Sep. 26, 2021.) (Year: 2021). [cited by examiner]
Liang (Wu L, Li J, Wang Y, Meng Q, Qin T, Chen W, Zhang M, Liu TY. R-drop: Regularized dropout for neural networks. Advances in Neural Information Processing Systems. Dec. 6, 2021;34:10890-905.) (Year: 2021). [cited by examiner]
Pranesh RR, Shekhar A, Pallavi S. Quesbelm: A bert based ensemble language model for natural questions. In2020 5th International Conference on Computing, Communication and Security (ICCCS) Oct. 14, 2020 (pp. 1-5). IEEE.… [cited by examiner]
Baradaran R, Amirkhani H. Zero-shot estimation of base models'weights in ensemble of machine reading comprehension systems for robust generalization. In2021 26th International Computer Conference, Computer Society of Ir… [cited by examiner]
Gao L, Dai Z, Callan J. Rethink training of BERT rerankers in multi-stage retrieval pipline. InAdvances in Information Retrieval: 43rd European Conference on IR Research, ECIR 2021, Virtual Event, Mar. 28,-Apr. 1, 2021,… [cited by examiner]
Choi, et al., “Quac: Question answering in context,” Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, pp. 2174-2184, Association for Computational Linguistics (O… [cited by applicant]
Clark, et al., Electra: Pre-training text encoders as discriminators rather than generators, Published as a conference paper at ICLR 2020, 18 pages (2020). [cited by applicant]
Devlin, et al., “BERT: Pre-training of deep bidirectional transformers for language understanding,” Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Huma… [cited by applicant]
Feng, et al., “MultiDoc2Dial: Modeling dialogues grounded in multiple documents,” Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pp. 6162-6176, Online and Punta Cana, Dominican R… [cited by applicant]
Gao, et al., “Rethink training of BERT rerankers in multi-stage retrieval pipeline,” Advances in Information Retrieval—43rd European Conference on IR Research, ECIR 2021, Virtual Event, Mar. 28,-Apr. 1, 2021, Proceeding… [cited by applicant]
Guu, et al., “REALM: retrieval augmented language model pre-training,” CoRR, abs/2002.08909, 10 pages (2020). [cited by applicant]
Izacard, et al., “Leveraging passage retrieval with generative models for open domain question answering,” Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Mai… [cited by applicant]
Karpukhin, et al., “Dense passage retrieval for opendomain question answering,” Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 6769-6781, Online. Association for Comp… [cited by applicant]
Lee, et al., “Latent retrieval for weakly supervised open domain question answering,” CoRR, abs/1906.00300, 11 pages (2019). [cited by applicant]
Lewis, et al., “Retrieval-augmented generation for knowledge-intensive NLP tasks,” Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, Dec… [cited by applicant]
Liu, et al., “RoBERTa: A Robustly Optimized BERT Pretraining Approach,” arXiv e-prints, arXiv:1907.11692, 13 pages (2019). [cited by applicant]
Reddy, et al., “CoQa: A conversational question answering challenge,” Trans. Assoc. Comput. Linguistics, vol. 7, pp. 249-266 (2019). [cited by applicant]
Saeidi, et al., “Interpretation of natural language rules in conversational machine reading,” Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, Oct. 31,-Nov. 4, 2… [cited by applicant]
Wolf, et al., “Transformers: State-of-the-art natural language processing,” CoRR, abs/1910.03771, 8 pages (2019). [cited by applicant]
Li, et al., “Grounded Dialogue Generation with Cross-encoding Re-ranker, Grounding Span Prediction, and Passage Dropout,” Proceedings of the Second DialDoc Workshop on Document-grounded Dialogue and Conversational Quest… [cited by applicant]