IP Library Granted Patent US 12,572,749
Granted Patent B2
US 12,572,749 · App. 18/232,485 · Granted Mar 10, 2026

Compressing information provided to a machine-trained model using abstract tokens

Inventors: Mohsen Fayyaz (Berlin, DE); Eric Chris Wolfgang Sommerlade (Oxford, GB); Justin James Wagle (Pacifica, CA); Vivek Pradeep (Bellevue, WA)
Assignee: Microsoft Technology Licensing, LLC
G06F40/35G06F40/284G06N20/00
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,572,749
App. No.
18/232,485
Granted
Mar 10, 2026
Kind
B2
Abstract

A technique uses a machine-trained model to generate a response based on a prompt which expresses current input information and abstract token information. The abstract token information summarizes a full dialogue history of a dialogue, and is generated by the model itself. The technique reduces the size of the prompt by incorporating the abstract summary information in lieu of the full dialogue history. A training system trains the machine-trained model by successively improving the predictive accuracy of the machine-trained model, while rewarding the machine-trained model based on an extent to which the machine-trained model compresses instances of abstract token information.

Claims (60)

1 . A method for interacting with a machine-trained model over plural dialogue turns of a dialogue using resources of one or more computing systems, comprising:

receiving input information for a current dialogue turn of a dialogue;

generating a first prompt that includes the input information and first abstract token information that has been generated by the machine-trained model in one or more prior dialogue turns;

using the machine-trained model to map the first prompt to a response;

generating a second prompt that includes at least the input information and the response; and

using the machine-trained model to map the second prompt to second abstract token information for use in a subsequent dialogue turn,

the receiving, generating a first prompt, using the machine-trained model to map the first prompt, generating a second prompt, and using the machine-trained model to map the second prompt being repeated at least one time, wherein the method interleaves generating of responses with generating of abstract token information,

each instance of abstract token information expressing a current state of a dialogue history of the dialogue with fewer tokens than a full dialogue history, which reduces a size of a prompt that incorporates said each instance of abstract token information,

wherein latency of the machine-trained model and an amount of the resources that are consumed by the machine-trained model depends on sizes of prompts processed by the machine-trained model.

2 . The method of claim 1 , wherein the machine-trained model has two parts, including a response-generating model part and an abstract-token-generating model part.

3 . The method of claim 2 , wherein the abstract-token-generating model part has a smaller size, and has fewer weights, than the response-generating model part.

4 . The method of claim 3 , wherein the abstract-token-generating model part is implemented by a local computing system and the response-generating model part is implemented by a network-accessible computing system.

5 . The method of claim 1 , wherein the machine-trained model is a language model that includes attention logic for processing input embedding information by determining relevance of a first part of the input embedding information when interpreting a second part of the input embedding information.

6 . The method of claim 1 , wherein the first abstract token information includes one more abstract tokens generated by the machine-trained model.

7 . The method of claim 1 , wherein the second prompt also includes the first abstract token information.

8 . The method of claim 1 ,

wherein the second prompt also includes machine-trained abstract-token-prompting information, the machine-trained model interpreting the abstract-token-prompting information as a signal that the machine-trained model is to generate the second abstract token information,

wherein the abstract-token-prompting information includes one more abstraction tokens, and

wherein the first prompt does not include the machine-trained abstract-token-prompting information.

9 . The method of claim 1 , wherein the input information expresses an input query and text extracted from a document.

10 . The method of claim 1 , wherein weights of the machine-trained model have been trained by successively improving predictive accuracy of the machine-trained model, while rewarding the machine-trained model based on an extent to which the machine-trained model compresses instances of abstract token information.

11 . The method of claim 1 , wherein weights of the machine-trained model have been trained by:

using a teacher version of the machine-trained model to generate a ground-truth response for an input example, the teacher version of the machine-trained model having fixed weights during the training;

using a student version of the machine-trained model to generate a student-model response for the input example;

using the student version of the machine-trained model to generate student-model abstract token information, the student-model abstract token information expressing a current state of a dialogue history of a dialogue with fewer tokens than the dialogue history;

using the ground-truth response and the student-model response to generate prediction loss; and

using the student-model abstract token information to generate sparsity loss.

12 . The method of claim 11 ,

wherein the teacher version of the machine-trained model generates the ground-truth response independent of any instance of abstract token information, and

wherein the student version of the machine-trained model generates the student-model response based on prior-generated abstract token information.

13 . The method of claim 11 , wherein the student version of the machine-trained model generates the student-model abstract token information based on the input example, the student-model response, and prior-generated abstract token information.

14 . The method of claim 13 , wherein the student version of the machine-trained model also generates the student-model abstract token information based on machine-trained abstract-token-prompting information, the student version of the machine-trained model interpreting the machine-trained abstract-token-prompting information as a signal that the student version of the machine-trained model is to generate the student-model abstract token information.

15 . The method of claim 1 , wherein weights of the machine-trained model have been trained by:

using a teacher version of the machine-trained model to generate a ground-truth response for an input example, the teacher version of the machine-trained model having fixed weights during training, wherein the teacher version of the machine-trained model generates the ground-truth response independent of any instance of abstract token information,

using a student version of the machine-trained model to generate a student-model response for the input example, wherein the student version of the machine-trained model generates the student-model response based on prior-generated abstract token information,

using the student version of the machine-trained model to generate student-model abstract token information; and

using the ground-truth response, the student-model response, and the student-model abstract token information to generate loss.

16 . A computing system for interacting with a machine-trained model, comprising:

an instruction data store for storing computer-readable instructions;

a processing system for executing the computer-readable instructions in the data store, to perform operations including, in an inference stage:

using the machine-trained model to generate a response to a first prompt, the first prompt expressing input information for a current dialogue turn of a dialogue and first abstract token information generated in one or more prior dialogue turns,

each instance of abstract token information expressing a current state of a dialogue history of the dialogue with fewer tokens than the dialogue history,

wherein the machine-trained model includes weights that have been trained in a training stage by successively improving predictive accuracy of the machine-trained model, while rewarding the machine-trained model based on an extent to which the machine-trained model compresses instances of abstract token information,

wherein the weights have been trained in the training stage by:

using a teacher version of the machine-trained model to generate a ground-truth response for an input example, the teacher version of the machine-trained model having fixed weights during training, wherein the teacher version of the machine-trained model generates the ground-truth response independent of any instance of abstract token information,

using a student version of the machine-trained model to generate a student-model response for the input example, wherein the student version of the machine-trained model generates the student-model response based on prior-generated abstract token information,

using the student version of the machine-trained model to generate student-model abstract token information; and

using the ground-truth response, the student-model response, and the student-model abstract token information to generate loss.

17 . The computing system of claim 16 , wherein the operations further include, in the inference stage, mapping a second prompt to second abstract token information using the machine-trained model, for input to the machine-trained model in a subsequent dialogue turn.

18 . The computing system of claim 17 , wherein the second prompt also includes machine-trained abstract-token-prompting information, the machine-trained model interpreting the machine-trained abstract-token-prompting information as a signal that the machine-trained model is to generate the second abstract token information.

19 . A computer-readable storage medium for storing computer-readable instructions, a processing system executing the computer-readable instructions to perform operations, the operations comprising:

using a teacher version of a machine-trained model to generate a ground-truth response for an input example, the teacher version of the machine-trained model having fixed weights during training;

using a student version of the machine-trained model to generate a student-model response for the input example;

using the student version of the machine-trained model to generate student-model abstract token information;

using the ground-truth response and the student-model response to generate prediction loss;

using the student-model abstract token information to generate sparsity loss; and

using plural instances of the prediction loss and plural instances of the sparsity loss to update the student version of the machine-trained model,

wherein the teacher version of the machine-trained model generates the ground-truth response independent of any instance of abstract token information,

wherein the student version of the machine-trained model generates the student-model response based on prior-generated abstract token information, and

wherein the student version of the machine-trained model generates the student-model abstract token information based on the input example, the student-model response, the prior-generated abstract token information, and machine-trained abstract-token-prompting information.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 10, 2023
From: FAYYAZ, MOHSEN; SOMMERLADE, ERIC CHRIS WOLFGANG; WAGLE, JUSTIN JAMES; PRADEEP, VIVEK
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 064550/0962 →
Continuity (1)
Related Publication 20250053748A1 · Feb 13, 2025
References Cited (44)
US 20200349919A1 · Wanas · 2020 [cited by examiner]
US 20210217408A1 · Hakkani-Tur · 2021 [cited by examiner]
US 20220004819A1 · Modi et al. · 2022 [cited by applicant]
US 20230214689A1 · Tian et al. · 2023 [cited by applicant]
US 20230244938A1 · Wei et al. · 2023 [cited by applicant]
US 20240176958A1 · Raimondo · 2024 [cited by examiner]
US 20240289362A1 · Williams et al. · 2024 [cited by applicant]
US 20240311575A1 · Baeuml · 2024 [cited by examiner]
US 20240354319A1 · Dinu · 2024 [cited by examiner]
US 20240394479A1 · Pathak · 2024 [cited by examiner]
US 20250005276A1 · Bhat et al. · 2025 [cited by applicant]
US 20250005427A1 · Venkateswaran · 2025 [cited by examiner]
US 20250006052A1 · Williams et al. · 2025 [cited by applicant]
US 20250028751A1 · Yu · 2025 [cited by examiner]
US 20250086187A1 · Mohsen et al. · 2025 [cited by applicant]
WO 2023022727A1 · 2023 [cited by applicant]
Hegde, Srinidhi, et al. “Variational student: Learning compact and sparser networks in knowledge distillation framework.” ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP… [cited by examiner]
Gupta, “Compression of Deep Learning Models for Text: a Survey,” arXiv, arXiv:2008.05221v4 [cs. CL], Jun. 13, 2021, 53 pages. [cited by applicant]
Chen, et al., “Stabilized In-Context Learning with Pre-trained Language Models for Few Shot Dialogue State Tracking,” arXiv, arXiv:2302.05932v1 [cs.CL], Feb. 12, 2023, 14 pages. [cited by applicant]
Santra, et al., “Frugal Prompting for Dialog Models,” arXiv, arXiv:2305.14919v1 [cs.CL], May 24, 2023, 22 pages. [cited by applicant]
PCT Search Report and Written Opinion for PCT/US2024/037265, mailing date Oct. 22, 2024, 17 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Application No. PCT/US2024/041380, mailed on Nov. 25, 2024, 14 pages. [cited by applicant]
Fayyaz, et al., “Executing a Client Model Using a Task Prompt Produced by a Main System,” U.S. Appl. No. 18/244,229, filed Sep. 9, 2023, 52 pages. [cited by applicant]
Gu, et al., “From Server-Based to Client-Based Machine Learning: a Comprehensive Survey,” in ACM Computing Surveys, vol. 54, No. 1, Article 6. Dec. 2020, 36 pages. [cited by applicant]
Office Action received in U.S. Appl. No. 18/244,229, mailing date: Jan. 16, 2025, 31 pages. [cited by applicant]
Final Office Action mailed on Jun. 9, 2025, in U.S. Appl. No. 18/244,229, 30 pages. [cited by applicant]
Devlin, et al., “BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,” arXiv, Cornell University, arXiv:1810.04805v2 [cs.CL], May 24, 2019, 16 pages. [cited by applicant]
Scao, et al., “BLOOM: A 176B-Parameter Open-Access Multilingual Language Model,” arXiv, Cornell University, arXiv:2211.05100v2 [cs.CL], Dec. 11, 2022, 62 pages. [cited by applicant]
Vaswani, et al., “Attention Is All You Need,” in 31st Conference on Neural Information Processing Systems (NIPS 2017), 2017, 11 pages. [cited by applicant]
Brown, et al., “Language Models are Few-Shot Learners,” arXiv, Cornell University, arXiv:2005.14165v4 [cs.CL], Jul. 22, 2020, 75 pages. [cited by applicant]
“Introducing The World's Largest Open Multilingual Language Model: BLOOM,” available at https://bigscience.huggingface.co/blog/bloom, accessed on Feb. 13, 2023, 2 pages. [cited by applicant]
Houlsby, et al., “Parameter-Efficient Transfer Learning for NLP,” arXiv, Cornell University, arXiv:1902.00751v2 [cs.LG], Jun. 13, 2019, 13 pages. [cited by applicant]
Pfeiffer, et al., “AdapterFusion: Non-Destructive Task Composition for Transfer Learning,” arXiv, Cornell University, arXiv:2005.00247v3, Jan. 26, 2021, 17 pages. [cited by applicant]
Pfeiffer, et al., “AdapterHub: a Framework for Adapting Transformers,” in Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, 2020, 9 pages. [cited by applicant]
Hu, et al., “LoRA: Low-Rank Adaptation of Large Language Models,” in Proceedings of 10th International Conference on Learning Representations, Apr. 25, 2022, 13 pages. [cited by applicant]
Rafailov, et al., “Direct Preference Optimization: Your Language Model is Secretly a Reward Model,” arXiv, Cornell University, arXiv:2305.18290v1 [cs.LG], May 29, 2023, 26 pages. [cited by applicant]
Banino, et al., “PonderNet: Learning to Ponder,” in 8th ICML Workshop on Automated Machine Learning (2021), 2021, 16 pages. [cited by applicant]
Lester, Brian, “Guiding Frozen Language Models with Learned Soft Prompts,” available at https://ai.googleblog.com/2022/02/guiding-frozen-language-models-with.html, Google Research Blogs, Feb. 10, 2022, 5 pages. [cited by applicant]
Lester, et al., “The Power of Scale for Parameter-Efficient Prompt Tuning,” arXiv, Cornell University, arXiv:2104.08691v2 [cs.CL], Sep. 2, 2021, 15 pages. [cited by applicant]
Rao, et al., “DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsification,” in 35th Conference on Neural Information Processing Systems (NeurIPS 2021), 2021, 13 pages. [cited by applicant]
Hu, at al., “LoRA: Low-Rank Adaptation of Large Language Models,” arXiv, Cornell University, arXiv:2106.09685v2 [cs.CL], Oct. 16, 2021, 26 pages. [cited by applicant]
Radford, et al., “Improving Language Understanding by Generative Pre-Training,” available at https://cdn.openai.com/research-covers/language-unsupervised/language_understanding_paper.pdf, OpenAI, San Francisco, Californ… [cited by applicant]
Touvron, et al., “LLaMA: Open and Efficient Foundation Language Models,” arXiv, Cornell University, arXiv:2302.13971v1 [cs.CL], Feb. 27, 2023, 27 pages. [cited by applicant]
Notice of Allowance mailed on Oct. 28, 2025, in U.S. Appl. No. 18/244,229, 16 pages. [cited by applicant]