(1) Relax the constraint that the embeddings of template words be the embeddings of natural language (e.g., English) words. 
(2) Remove the restriction that the template is parameterized by the pre-trained LM’s parameters.

University of Michigan - Ann Arbor

Continuous prompts, also known as soft prompts, are implicit and adaptable prompting patterns that exist as hidden, distributed representations directly within the embedding space of a Large Language Model. Unlike human-readable hard prompts, they are not required to correspond to meaningful text. Instead, soft prompts are treated as learnable parameters that are optimized through continuous optimization, enabling the exploration of prompting methods beyond discrete, user-defined text.

Continuous Prompts (Soft Prompts)

https://arxiv.org/pdf/2107.13586.pdf
It's one amazing survey paper proposing existing prompt-tuning methods.

Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing


Major Changes of Continuous Prompts

These methods initialize the search for a continuous prompt using a prompt that has already been created or discovered using discrete prompt search methods.

Tuning Initialized with Discrete Prompts

A method to enhance prompting by combining the strengths of both soft and hard prompts. In this approach, tunable soft prompt embeddings are arranged or interspersed with discrete hard prompt tokens within the input embedding sequence. This fusion allows for the creation of diverse and effective prompt patterns that leverage both human-readable instructions and machine-optimized learnable parameters.

Hard-Soft Prompt Hybrid Tuning

Hard and soft prompts represent two fundamentally different approaches to guiding Large Language Models. Hard prompts are explicit, predefined text sequences in natural language that are directly input by users. In contrast, soft prompts are implicit, adaptable patterns embedded within the model's architecture as hidden, distributed representations. This core distinction leads to distinct trade-offs: hard prompts are highly interpretable and easy to adjust, while soft prompts are more computationally efficient but lack direct interpretability and are inflexible, requiring extensive retraining to modify.

Comparison of Hard and Soft Prompts

Soft prompts are dense, low-dimensional, and learnable representations that exist as hidden states within a model's embedding space. A key characteristic is that they do not need to correspond to or be interpreted as meaningful text. Instead, they are treated as standard model parameters that can be learned through continuous optimization, allowing for the exploration of prompting methods beyond natural language.

Characteristics of Soft Prompts

Soft prompts offer a significant advantage in computational efficiency over hard prompts. Because they provide dense, low-dimensional, and learnable representations for guiding Large Language Models, their training and application demand much less computational power than processing lengthy hard prompts. This approach provides substantial practical value during model inference, especially in applications where the same prompt is repeatedly applied.

Computational Efficiency of Soft Prompts

Prefix fine-tuning is a parameter-efficient method that adapts Large Language Models by modifying their internal architecture. It involves prepending a sequence of trainable vectors, known as prefixes, to the input of each Transformer layer. While the original model parameters remain frozen, this technique requires architectural adjustments to accommodate the prefixes at every layer. These learned prefixes act as soft prompts, guiding the model's behavior for specific tasks.

Prefix Fine-Tuning

A technique to better represent a soft prompt by treating its sequence of vectors ($p_0, p_1, \dots, p_n$) as an input to a dedicated sequence model, such as a Transformer. This secondary model encodes the entire soft prompt sequence, and its resulting output representation is then used as the actual prompt input for the main Large Language Model. This essentially involves developing an additional model specifically for encoding soft prompts.

Encoding Soft Prompts with Sequence Models

The training of soft prompts is accomplished through a standard supervised learning framework. The objective of this process is to optimize the prompt's parameters by maximizing the likelihood that the language model will produce the correct output for a given input.

Training Soft Prompts via Supervised Learning

This technique frames soft prompt learning as a context compression problem solved using knowledge distillation. In this process, the knowledge from a lengthy, standard prompt is distilled from a teacher model into a compact set of 'pseudo tokens'. The embeddings for these pseudo tokens, which are appended to the user's input sequence, are then optimized to replicate the predictions of the teacher model, effectively capturing the essence of the original, more complex prompt.

Soft Prompt Learning as Context Compression via Knowledge Distillation

Learning soft prompts can be viewed through the lens of compression. This approach aims to approximate a long context, such as detailed instructions and demonstrations, with a more compact, continuous representation. For a given user input, this compressed representation of the context is developed to guide the model, functioning as the soft prompt.

Learning Soft Prompts via Context Compression

An iterative optimization process for soft prompts involves using the main Transformer layers of a model to refine the prompt vectors over successive steps. In this mechanism, the soft prompts from a given step, denoted as $\sigma_i$, are processed along with the standard input embeddings. The resulting hidden states from the Transformer layers are then used to generate an updated, more optimized set of soft prompts, $\sigma_{i+1}$, for the next iteration. This creates a feedback loop where the model progressively improves the soft prompts.

Iterative Refinement of Soft Prompts via Transformer Layers

A significant drawback of soft prompts is their lack of direct interpretability. Because they exist as dense, hidden representations within the model's embedding space rather than as human-readable text, it becomes a major challenge for users to understand precisely how these prompts influence the model's final output.

Lack of Interpretability in Soft Prompts

Soft prompts are characterized by their inflexibility, as they cannot be easily adjusted once trained. Any modification requires substantial fine-tuning, which limits their practical use in dynamic environments where prompts may need to be changed frequently.

Inflexibility of Soft Prompts

A key trade-off exists with soft prompts: they are highly efficient for fine-tuning and deployment, but this comes at the cost of being inflexible. Once trained, they cannot be easily adjusted to new requirements without undergoing extensive modification or retraining, which limits their use in dynamic applications.

Trade-off between Efficiency and Flexibility in Soft Prompts

Analyze the two scenarios below. For each company, recommend whether they should use a prompting method based on human-readable, editable text or a method based on optimized, learnable parameters that are not directly readable as text. Justify your recommendations by explaining the key trade-offs involved for each scenario.

Choosing the Right Prompting Strategy

A key distinction of a continuous prompt is that it exists as a sequence of learnable numerical vectors within a model's embedding space, rather than as a sequence of discrete, human-readable words. Which of the following is the most direct consequence of this architectural difference?

Prompt tuning is a parameter-efficient adaptation method for Large Language Models. It involves incorporating a set of trainable vectors, or soft prompts, which are adjusted during training to steer the model for a specific task. A defining characteristic of this technique is that it only modifies the model's input embedding layer, leaving the rest of the pre-trained model's parameters frozen.

Prompt Tuning

A research team is developing a specialized question-answering system for a fixed, well-defined medical domain. Their primary constraints are a limited computational budget for model adaptation and the need for the highest possible task performance. Given this context, which of the following best describes the fundamental trade-off the team accepts by choosing to implement continuous prompts instead of manually crafted discrete prompts?

Your team is building a multi-tenant LLM service w...

You’re reviewing an internal design doc for adapti...

You’re implementing a PEFT approach for a customer...

You’re reviewing a teammate’s claim about a new PE...

You are reviewing a teammate’s implementation of a parameter-efficient adaptation for a frozen Transformer-based LLM. They claim they implemented *prefix fine-tuning* using continuous (soft) prompts.

They describe their code as follows:
- They create a trainable matrix P of shape (n, d_model) and prepend it to the token embeddings only once, before the first Transformer layer.
- For every Transformer layer l, they pass the same hidden-state sequence length forward (no extra positions are added inside deeper layers).
- They report that training updates only P, and the base model weights remain frozen.

A second teammate argues this is actually *prompt tuning*, not prefix fine-tuning, and that true prefix fine-tuning would change the input composition inside each layer.

Write an analysis that (1) determines who is correct, (2) explains the key architectural/mechanistic difference using the idea of continuous prompts and the layer-wise input composition (i.e., how H^l is formed when prefixes are used), and (3) proposes a concrete fix to make the implementation match prefix fine-tuning while still remaining parameter-efficient (describe what must be introduced per layer and where it is concatenated).

Diagnosing a PEFT Implementation Bug: Prompt Tuning vs Prefix Fine-Tuning

Your company maintains a single, frozen 30B-parameter Transformer model behind a shared inference service. You must ship 12 task-specific adaptations (e.g., contract clause extraction, customer-email triage, internal policy Q&A) to different product teams. Constraints: (1) you cannot store or deploy 12 full model copies; (2) the inference service team will not accept per-task changes that require modifying the model’s internal layer code paths, but they will allow per-request changes to the input embeddings; (3) tasks are stable for months, but product teams occasionally request small behavior tweaks that must be delivered within a day.

Write an essay recommending an adaptation approach that fits these constraints, explicitly comparing prompt tuning vs prefix fine-tuning as PEFT methods that use continuous (soft) prompts. In your justification, explain (a) where the trainable vectors live and how they are applied at inference time, (b) what “input composition” looks like in prefix tuning at a Transformer layer (i.e., how trainable prefix vectors and previous-layer hidden states form the layer input), and (c) the practical trade-offs you are accepting regarding deployment complexity, storage per task, and speed of making small updates.

Choosing and Explaining a PEFT Strategy Under Deployment Constraints

You are advising an internal platform team that must support 30 task-specific adaptations of the same frozen LLM (e.g., policy QA, ticket triage, contract clause extraction). The serving stack is standardized: it can easily prepend extra vectors to the *input embedding sequence* before layer 1, but it is costly to modify the model graph to inject additional vectors into every Transformer layer. The team is considering two PEFT options that both use continuous (soft) prompts: (A) prompt tuning, where a learned sequence of soft prompt vectors is prepended only at the embedding layer; (B) prefix fine-tuning, where each layer l receives an input matrix H^l formed by concatenating trainable prefix vectors p_0^l..p_n^l with the previous layer’s hidden states h_0^l..h_m^l (i.e., H^l = [p^l ; h^l]).

Write a recommendation memo that (1) explains, using the H^l composition above, what architectural/serving changes prefix fine-tuning implies compared with prompt tuning, (2) analyzes how those changes affect per-request latency and operational complexity when hosting many tasks, and (3) justifies which approach you would choose if the primary business goal is to minimize deployment friction while still staying within the PEFT philosophy of updating only a small number of parameters. Your answer should explicitly connect the “where the soft prompts live” (embedding-only vs every layer) to the trade-offs you claim.

Selecting Prompt Tuning vs Prefix Fine-Tuning by Reasoning from Where Soft Prompts Enter the Transformer

You run a multi-tenant internal LLM platform where one frozen base model serves 30 business units. Each unit needs a task-specific adaptation that can be swapped at request time with minimal latency and minimal per-task storage. Your inference stack is standardized and you are allowed to (a) prepend trainable continuous vectors only at the input embedding layer, or (b) modify the model so that each Transformer layer receives additional trainable vectors prepended to that layer’s input. A new requirement arrives: several units want to update their adaptation weekly based on fresh labeled data, but the platform team also needs a clear way to reason about what is being trained and where it is injected to debug occasional regressions.

Given these constraints, choose which approach you would deploy (input-embedding-only prompt tuning vs per-layer prefix fine-tuning) and justify your choice by explicitly explaining (1) how the trainable continuous prompts relate to PEFT goals, and (2) how the per-layer input matrix is composed in the per-layer approach (i.e., what is concatenated with what, and which part is trainable vs frozen).

Post-Deployment PEFT Choice and Prefix Input Composition for a Multi-Tenant LLM Service

You run an internal LLM platform that serves 30 department-specific tasks (e.g., HR policy Q&A, procurement clause extraction, IT ticket triage) from a single frozen base model. Each task must be deployable as a small “adapter artifact” (you cannot store 30 full model copies). Two additional constraints have emerged:

1) The inference stack is standardized and cannot be modified to add new per-layer inputs or change Transformer internals; only the request payload (tokens/embeddings at the model input) can vary by task.
2) A new product requirement demands that the adapter be as small as possible and that per-request latency overhead be minimal.

A senior engineer proposes using prefix fine-tuning because it is also parameter-efficient and often performs well. Another proposes prompt tuning with continuous (soft) prompts.

As the technical decision-maker, which approach should you choose and why? In your answer, explicitly connect (a) what “parameter-efficient fine-tuning” means in this context, (b) how continuous/soft prompts are represented and trained, and (c) where the trainable vectors are composed into the model’s computation (e.g., at the embedding input vs concatenated into each layer’s input matrix as $\mathbf{H}^l = [\mathbf{p}_0^l \dots \mathbf{p}_n^l \; \mathbf{h}_0^l \dots \mathbf{h}_m^l]$).

Choosing Between Prompt Tuning and Prefix Fine-Tuning for a Latency-Critical, Multi-Task LLM Service

You run an internal LLM platform where the base model must remain frozen and shared across many business units. To avoid storing full model copies per task, your team uses parameter-efficient fine-tuning with continuous (soft) prompts. For a new task, an engineer claims they implemented prefix fine-tuning, but after deployment you observe two issues: (1) latency increased roughly in proportion to the number of Transformer layers, and (2) task quality is much worse than the offline evaluation.

During a code review you find that, at every layer l, they build the layer input as H^l = [p_0, p_1, ..., p_n, h_0^l, h_1^l, ..., h_m^l] using the SAME trainable vectors p_0...p_n for all layers (no layer-specific prefixes), and they also pass the entire output sequence (including the prefix positions) to the next layer instead of discarding the prefix positions.

As the reviewer, explain which parts of this implementation are inconsistent with prefix fine-tuning (vs prompt tuning), and how each inconsistency plausibly causes the observed latency and quality regression. Your answer must explicitly reference (a) where soft prompts are inserted in prompt tuning vs prefix fine-tuning, and (b) the intended input composition behavior in a prefix-tuned Transformer layer.

Root-Causing a Prefix-Tuning Rollout Regression in a Multi-Task LLM Platform

Soft prompts can be utilized in Large Language Models (LLMs) through several distinct methods for task adaptation. Tunable soft prompts, whose parameters are optimized during fine-tuning while the rest of the model remains fixed, can be integrated by appending them as prefixes to each layer of the LLM or by using them as input embeddings. Alternatively, soft prompts can be broadly conceptualized as specific components of the model that undergo fine-tuning to adapt the LLM to new tasks.

Methods of Using Soft Prompts in LLMs

The problem of approximating a long context with a continuous representation can be formalized as an optimization task. Given a user input $$\mathbf{z}$$ and its full context $$\mathbf{c}$$, the goal is to learn a compressed representation $$\sigma$$ such that the model's prediction using $$\sigma$$ closely matches the prediction using $$\mathbf{c}$$. This objective is expressed as $$\hat{\sigma} = \argmin_{\sigma} s(\hat{\mathbf{y}},\hat{\mathbf{y}}_{\sigma})$$, where $$\hat{\mathbf{y}} = \argmax_{\mathbf{y}} \Pr(\mathbf{y}|\mathbf{c},\mathbf{z})$$ is the prediction with the full context, $$\hat{\mathbf{y}}_{\sigma} = \argmax_{\mathbf{y}_{\sigma}} \Pr(\mathbf{y}|\sigma,\mathbf{z})$$ is the prediction with the compressed context, and $$s(\cdot,\cdot)$$ is a loss or similarity measure.

Learn Before

Related