Parallel decoding using autoregressive machine learning models

US10521701B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10521701-B2
Application numberUS-201916417190-A
CountryUS
Kind codeB2
Filing dateMay 20, 2019
Priority dateMay 18, 2018
Publication dateDec 31, 2019
Grant dateDec 31, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing parallel generation of output from an autoregressive sequence to sequence model. In one aspect, a blockwise parallel decoding method takes advantage of the fact that some architectures can score sequences in sublinear time. By generating predictions for multiple time steps at once then backing off to a longest prefix validated by the scoring model, the methods can substantially improve the speed of greedy decoding without compromising performance.

First claim

Opening claim text (preview).

What is claimed is: 1. A method for generating output from an autoregressive model p 1 , comprising: obtaining k−1 auxiliary models p i for i=2, . . . , k, the auxiliary models p i each configured to predict a single i-th output from the model p 1 for a given prefix input; and performing the following operations for a current input until a termination condition is met: generating a respective independent prediction from each of the models p 1 through p k for the current input, each independent prediction being a prediction of a single token; finding a largest n such that (i) a prediction from model p 1 of a next token for an input of the current input concatenated with the first through the (n−1)st tokens independently predicted by models p 1 through p (n−1) matches (ii) the independent prediction of the n-th token by model p n ; and extending a generated output by appending the independent predictions from models p 1 through p n , to the generated output. 2. The method of claim 1 , wherein a respective prediction matches an output of p 1 only if the two are identical. 3. The method of claim 1 , wherein a respective prediction matches an output of p 1 only if it is one of a predetermined number of closest predictions to that output of p 1 . 4. The method of claim 1 , wherein a respective prediction matches an output of p 1 only if the two are within a predetermined distance from each other. 5. The method of claim 1 , wherein k is an integer in a range of 2-20, or 2-10, or 4-6. 6. The method of claim 1 , wherein the autoregressive model is a deep neural autoregressive model. 7. The method of claim 1 , wherein the one-token predictions from each of the models p 1 through p k are generated in parallel. 8. A system implemented by one or more computers, the system comprising: an autoregressive model p 1 ; and k−1 auxiliary models p i for i=2, . . . , k, the auxiliary model p i each configured to predict a single i-th output from the model p 1 for a given prefix input; wherein the system is configured to perform the following operations for a current input until a termination condition is met: generating independent predictions from each of the models p 1 through p k for the current input, each independent prediction being a prediction of a single token; finding a largest n such that (i) a prediction from model p 1 of a next token for an input of the current input concatenated with the first through the (n−1)st tokens independently predicted by models p 1 through p (n−1) matches (ii) the independent prediction of the n-th token by model p n ; and extending a generated output by appending the independent predictions from models p 1 through p n , to the generated output. 9. The system of claim 8 , wherein a respective prediction matches an output of p1 only if the two are identical. 10. The system of claim 8 , wherein a respective prediction matches an output of p1 only if it is one of a predetermined number of closest predictions to that output of p1. 11. The system of claim 8 , wherein a respective prediction matches an output of p1 only if the two are within a predetermined distance from each other. 12. The system of claim 8 , wherein k is an integer in a range of 2-20, or 2-10, or 4-6. 13. The system of claim 8 , wherein the autoregressive model is a deep neural autoregressive model. 14. The system of claim 8 , wherein the one-token predictions from each of the models p 1 through p k are generated in parallel. 15. One or more computer-readable storage media encoded with instructions that, when executed by one or more computers, cause the one or more computers to perform operations comprising: obtaining an autoregressive model p 1 and k−1 auxiliary models p i for i=2, . . . , k, the auxiliary models p i each configured to predict a single i-th output from the model p 1 for a given prefix input; and performing the following operations for a current input until a termination condition is met: generating a respective independent prediction from each of the models p 1 through p k for the current input, each independent prediction being a prediction of a single token; finding a largest n such that (i) a prediction from model p 1 of a next token for an input of the current input concatenated with the first through the (n−1)st tokens independently predicted by models p 1 through p (n−1) matches (ii) the independent prediction of the n-th token by model p n ; and extending a generated output by appending the independent predictions from models p 1 through p n , to the generated output. 16. The one or more computer-readable storage media of claim 15 , wherein a respective prediction matches an output of p 1 only if the two are identical. 17. The one or more computer-readable storage media of claim 15 , wherein a respective prediction matches an output of p 1 only if it is one of a predetermined number of closest predictions to that output of p 1 . 18. The one or more computer-readable storage media of claim 15 , wherein a respective prediction matches an output of p 1 only if the two are within a predetermined distance from each other. 19. The one or more computer-readable storage media of claim 15 , wherein k is an integer in a range of 2-20, or 2-10, or 4-6. 20. The one or more computer-readable storage media of claim 15 , wherein the autoregressive model is a deep neural autoregressive model. 21. The one or more computer-readable storage media of claim 15 , wherein the one-token predictions from each of the models p 1 through p k are generated in parallel.

Assignees

Inventors

Classifications

  • G06N20/20Primary

    Ensemble learning · CPC title

  • using neural networks · CPC title

  • using classification, e.g. of video objects · CPC title

  • the supervisor being an automated module, e.g. intelligent oracle · CPC title

  • Machine learning · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10521701B2 cover?
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing parallel generation of output from an autoregressive sequence to sequence model. In one aspect, a blockwise parallel decoding method takes advantage of the fact that some architectures can score sequences in sublinear time. By generating predictions for multiple time steps at once then…
Who is the assignee on this patent?
Google Llc
What technology area does this patent fall under?
Primary CPC classification G06N20/20. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Dec 31 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).