# US 2026/0073311 A1 · Parameter Efficient Prompt Tuning for Efficient Models at Scale

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0073311 A1
- Document ID: US20260073311A1
- Status: Published application
- Kind: A1
- Application number: 19/395,834
- Filed: 2025-11-20
- Published: 2026-03-12
- Earliest claimed: 2022-04-12
- Assignees: Google Inc.
- Applicants: Google LLC
- Inventors: Brian David Lester; Noah J.G. Constant; Rami Eid Sammour Al-Rfou
- Web page: https://patentgrep.com/patent/US20260073311A1

## CPC

- G06N 20/20: Ensemble learning
- G06V 10/764: using classification, e.g. of video objects
- G06V 10/7747: {Organisation of the process, e.g. bagging or boosting}
- G06F 16/2455: Query execution
- G06F 16/55: Clustering; Classification
- G06F 40/30: Semantic analysis
- G06N 3/0455: Auto-encoder networks; Encoder-decoder networks
- G06N 3/08: Learning methods
- G06N 3/084: Backpropagation, e.g. using gradient descent
- G06V 10/454: {Integrating the filters into a hierarchical structure, e.g. convolutional neural networks [CNN]}
- G06V 10/776: Validation; Performance evaluation
- G06V 10/82: using neural networks
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems and methods for natural language processing can leverage trained prompts to condition a large pre-trained machine-learned model to generate an output for a specific task. For example, a subset of parameters may be trained for the particular task to then be input with a set of input data into the pre-trained machine-learned model to generate the task-specific output. During the training of the prompt, the parameters of the pre-trained machine-learned model can be frozen, which can reduce the computational resources used during training while still leveraging the previously learned data from the pre-trained machine-learned model.

## Claims

### Claim 1

A computer-implemented method, the computer-implemented method comprising:
obtaining, by a computing system comprising one or more processors, a training example from a user computing device, wherein the training example comprises one or more examples and one or more task descriptions;
obtaining, by the computing system, a prompt, wherein the prompt comprises a set of parameters;
processing, by the computing system, the training example and the prompt with a machine-learned model to generate one or more prompt gradients; and
sending the one or more prompt gradients to the user computing device.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein a predicted label is generated based on processing the one or more examples and the prompt with the machine-learned model, and wherein the one or more prompt gradients are generated based on the predicted label.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein processing, by the computing system, the training example and the prompt with the machine-learned model to generate the one or more prompt gradients comprises:
performing a forward pass of the machine-learned model with the training example and the prompt; and
performing a backwards pass to return the one or more prompt gradients.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein the prompt comprises learnable vectors.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the prompt is optimized end-to-end over a training dataset, wherein the training dataset comprises the training example.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein the prompt is initial as a fixed-length sequence of vectors.

### Claim 7 (depends on 6)

The computer-implemented method of claim 6, wherein processing, by the computing system, the training example and the prompt with a machine-learned model comprises attaching the fixed-length sequence of vectors to each embedded input of the one or more examples before feeding the embedded input to the machine-learned model.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the one or more task descriptions are associated with one or more labels, wherein the one or more labels are associated with the one or more examples, and wherein the prompt gradient is based on a difference between the one or more labels and a predicted label.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the training example is a supervised example for supervised training.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein the training example is an unsupervised example for unsupervised training.

### Claim 11

A computing system, the computing system comprising:
one or more processors; and
one or more non-transitory computer-readable media that collectively store instructions that, when executed by the one or more processors, cause the computing system to perform operations, the operations comprising:
obtaining, with a server computing system and from a computing device, a prompt, wherein the prompt comprises a set of parameters;
obtaining, with the server computing system, a training example, wherein the training example comprises an example dataset and one or more respective labels;
processing, with the server computing system, the training example and the prompt with a machine-learned model to generate one or more prompt gradients, wherein the prompt gradient is based on a difference between the one or more respective labels and a predicted label;
sending the one or more prompt gradients to the computing device; and
generating, with the computing device, an updated prompt based on the one or more prompt gradients.

### Claim 12 (depends on 11)

The computing system of claim 11, wherein the prompt comprises a combined prompt that comprises a shared value for a plurality of different tasks and a set of task prompts, wherein each task prompt is associated with a different task.

### Claim 13 (depends on 12)

The computing system of claim 12, wherein the combined prompt was generated based on at least one of: addition, concatenation or projection with an affine transform.

### Claim 14 (depends on 12)

The computing system of claim 12, wherein the shared value is a shared parameter that represents a mixture of tasks, and wherein the shared parameter is used across a whole computing system network.

### Claim 15 (depends on 11)

The computing system of claim 11, wherein the training example is a fine-tuning example for fine-tuning the prompt.

### Claim 16 (depends on 11)

The computing system of claim 11, wherein the prompt is being tuned based on interactions of a prompt tuning application programming interface.

### Claim 17

One or more non-transitory computer-readable media that collectively store instructions that, when executed by one or more computing devices, cause the one or more computing devices to perform operations, the operations comprising:
receiving one or more inputs with a user computing device;
generating a user-input to augment a prompt based on the one or more inputs, wherein the prompt comprises a set of parameters, wherein the user-input comprises interactions with a prompt gradient, wherein the prompt gradient was generated based on evaluating a prediction of a machine-learned model when conditioned with the prompt;
transmitting the user-input to a server computing system;
receiving an updated prompt from the server computing system in response to receiving the user-input; and
storing the updated prompt.

### Claim 18 (depends on 17)

The one or more non-transitory computer-readable media of claim 17, wherein the prompt comprises a general prompt for a group of tasks.

### Claim 19 (depends on 17)

The one or more non-transitory computer-readable media of claim 17, wherein the prompt comprises a task-specific prompt for a specific task.

### Claim 20 (depends on 17)

The one or more non-transitory computer-readable media of claim 17, wherein the prompt comprises a combined prompt comprising a general prompt and a task-specific prompt, wherein the combined prompt was trained via prompt tuning multi-task training.
