Hierarchical Embedding Tree for Efficiently Caching Large Contexts
AssigneeDeepMind Technologies Limited
InventorsFlorian Nils Hartmann, Duc-Hieu Tran
Life of this patent
Estimating the term…
Loading patent…
AssigneeDeepMind Technologies Limited
InventorsFlorian Nils Hartmann, Duc-Hieu Tran
Estimating the term…
An example method includes obtaining a hierarchical embedding tree that embeds context data in a plurality of embedded representations respectively associated with a plurality of nodes. In the example method, each respective embedded representation associated with each respective terminal node of a plurality of terminal nodes of the plurality of nodes is generated based on a respective chunk of the context data. In the example method, each respective embedded representation associated with each respective non-terminal node of a plurality of non-terminal nodes of the plurality of nodes is generated based on the embedded representations associated with two or more of the plurality of nodes that are child nodes of the respective non-terminal node. The example method includes generating, based on an update to a chunk of the context data, updated embedded representations respectively for a plurality of nodes that are intersected by a path from a terminal node associated with the updated chunk to an ancestor node for the terminal node. The example method includes updating the hierarchical embedding tree using the updated embedded representations. The example method includes caching the updated hierarchical embedding tree for providing inputs to a machine-learned decoder model to generate responses to queries based on the updated context data.
A computer-implemented method comprising:
A computer-implemented method for training one or more machine-learned encoders for generating a hierarchical embedding tree, comprising:
A computing system comprising:
Dependencies are inferred from the claim text.