Prompt-Boundary Directional Alignment

• Prompt-Boundary Directional Alignment is a mechanism that applies prompt-conditioned control at the interface where modality signals meet model internals.
• It employs bi-directional attention and gating to fuse injected visual and textual tokens, ensuring coherent cross-modal alignment.
• The approach optimizes gradients and residuals to steer representations, enhancing robustness, generalization, and performance in multimodal tasks.

Searching arXiv for the cited papers to ground the article in current literature. arxiv_search(query="(Lv et al., 14 Jan 2025)", max_results=5) arxiv_search(query="(Tursun et al., 11 Feb 2025)", max_results=5) arxiv_search(query="(Niu et al., 12 Mar 2026)", max_results=5) arxiv_search(query="(Talemi et al., 26 May 2025)", max_results=5) Prompt-Boundary Directional Alignment denotes a family of alignment mechanisms in which prompt-conditioned control is imposed at an interface where signals are injected, fused, contrasted, or made to compete. In CLIP-style vision-LLMs, the boundary is the injection point of learnable prompt tokens into the visual and textual encoders; in zero-shot composed image retrieval, it is the displacement from a reference representation along a prompt-induced residual direction; in online reinforcement learning for LLMs, it is the within-prompt preference direction that must agree with a batch consensus; in prompt-injection defense, it is the explicit split between trusted commands and untrusted data; and in topology-enhanced alignment, it is the hidden-state transition from prompt-region to answer-region manifolds (Lv et al., 14 Jan 2025, Tursun et al., 11 Feb 2025, Zhou et al., 25 Jun 2026, Gong et al., 2 May 2026, Pan et al., 8 May 2026). A plausible unifying interpretation is that the topic concerns not prompts in isolation, but the geometry, routing, and optimization direction induced where prompts meet model internals or downstream decision criteria.

1. Boundary specification and formal scope

In the most explicit formulation, BMIP defines the boundary at the points where prompt tokens are injected into the early layers of both encoders in a frozen CLIP backbone. Deep language prompts $P_0,\dots,P_J$ are prepended to the caption token stream, with the initial text input to layer $g_0$ given by $[P_0, W_0]$, while deep vision prompts are concatenated with the CLS token and patch embeddings, with the initial visual input to layer $f_0$ given by $[CLS_0, E_0, \cdot]$. Directional alignment means ensuring information flow in both directions—vision$\rightarrow$language and language$\rightarrow$vision—so that each modality’s prompt is modulated by the other modality’s attention-informed signal at the boundary where prompts enter the encoder stack (Lv et al., 14 Jan 2025).

This boundary interpretation extends beyond multimodal encoder injection. KA-Prompt studies Domain Incremental Learning and identifies “component-wise misalignment” between independently learned domain prompts: prompts containing shared knowledge are “randomly positioned within the componential level of the prompt,” so inter-domain prompt fusion averages unrelated components and causes interference. The method therefore treats alignment as preserving corresponding component positions across domain boundaries through initialization and online consistency constraints (Xu et al., 7 May 2025).

A related but distinct formulation appears in DiSa. There, the relevant boundary is not an explicit prompt-token fusion module but the cosine-similarity decision geometry of CLIP classification. The paper argues that aligning only the directional component of prompted embeddings to class-wise prototypes preserves flexibility to adapt magnitudes while maintaining orientation consistency toward semantically meaningful class directions. This shifts the emphasis from prompt content alone to the angular relation between prompted features and stable class anchors (Talemi et al., 26 May 2025).

2. Bi-directional mechanisms in vision-language prompt learning

BMIP operationalizes prompt-boundary directional alignment through attention-informed bi-directional aggregation. Let $A_v$ and $A_l$ denote attention outputs from the current attention layer in the visual and textual encoders. BMIP maps these signals to gating weights with modality-specific $1\times1$ linear layers $g_0$0 and $g_0$1, then fuses the original prompt and the projected cross-modal prompt using convex mixing with complements $g_0$2 and $g_0$3. The design is explicitly directional in both pathways: vision$g_0$4language via $g_0$5 and language$g_0$6vision via $g_0$7. BMIP adopts replacement rather than naive concatenation or fixed-weight addition, reducing prompt redundancy and ensuring the fused boundary prompt remains compact and trainable. Only layered prompts, projection heads, and gating modules are trained; the CLIP image encoder $g_0$8 and text encoder $g_0$9 remain frozen (Lv et al., 14 Jan 2025).

NA-MVP generalizes the bi-directional idea under noisy supervision. It uses clean-oriented and noise-aware multi-view prompts, and aligns local image patches to prompt tokens with unbalanced optimal transport. Forward alignment minimizes transport cost from patches to prompt tokens, reverse alignment swaps source and target measures, and a clean–noise separation margin penalizes cases where the noise-aware match rivals or exceeds the clean-oriented match. The total objective is $[P_0, W_0]$0, and selective refinement uses optimal-transport-derived clean probabilities to correct only mislabeled samples. This makes directional alignment a region-aware mechanism for stabilizing decision boundaries under label noise rather than only a global prompt-matching device (Niu et al., 12 Mar 2026).

DiSa provides an important contrast. Its directional regularization is prototype-based rather than cross-modal fusion-based: for class prototype $[P_0, W_0]$1, the loss is $[P_0, W_0]$2. The paper explicitly reports that norm alignment hurts novel-class performance, full feature MSE is inferior, and direction-only alignment yields the most improvement for novel classes. This addresses a common misconception that stronger alignment necessarily means stronger Euclidean proximity; in this line of work, angular consistency is treated as the more stable object (Talemi et al., 26 May 2025).

3. Embedding-space steering, component alignment, and highlighted-span boundaries

PDV reformulates directional alignment in a shared embedding space. Given a pre-trained vision-LLM $[P_0, W_0]$3, the Prompt Directional Vector is the residual

$[P_0, W_0]$4

PDV-T defines a dynamic composed text embedding by adding $[P_0, W_0]$5 to the base text embedding; PDV-I transfers the same residual to the image embedding via $[P_0, W_0]$6; and PDV-F fuses the two as $[P_0, W_0]$7. In this setting, the “boundary” is the angular region between visual fidelity and semantic change, and $[P_0, W_0]$8, $[P_0, W_0]$9, and $f_0$0 steer the query across that boundary without retraining the model (Tursun et al., 11 Feb 2025).

KA-Prompt addresses a different boundary problem: fusion across domain-specific prompt memories. Reusable Knowledge Mining computes a relation matrix

$f_0$1

then greedily selects old prompts that add the largest amount of unique relevant knowledge. Initialization establishes a positional identity mapping $f_0$2, so new prompts inherit the componential structure of selected old prompts. Online alignment preservation then forms an alignment prompt with weights

$f_0$3

and optimizes $f_0$4. Here the boundary is neither an encoder layer nor a classifier margin, but the component-wise interface where prompts from different domains are fused (Xu et al., 7 May 2025).

Prism-$f_0$5 makes the boundary token-selective. It learns per-head, per-layer discriminative subspaces from differential cross-covariances

$f_0$6

then applies the resulting projectors only to highlighted tokens $f_0$7 at inference: $f_0$8 Shared directions are removed automatically because if $f_0$9, then $[CLS_0, E_0, \cdot]$0. The prompt boundary is therefore the contrast between edited highlighted spans and unedited neighboring spans inside the same prompt (Ge et al., 11 Mar 2026).

4. Directional alignment in optimization and reinforcement learning

GeoAlign instantiates prompt-local directional alignment in online RL for LLMs. For each prompt, it forms reward-ordered within-prompt preference pairs, computes latent displacement directions $[CLS_0, E_0, \cdot]$1 on detached hidden states, learns a small projector $[CLS_0, E_0, \cdot]$2 to concentrate these directions, and builds a reward-margin-weighted batch prototype

$[CLS_0, E_0, \cdot]$3

Angular deviation is accumulated into the Geometric Deviation Index, KDE is used for anomaly detection, and anomalous rollouts are replaced with within-prompt stable alternatives. The paper’s central failure mode is “directional inconsistency,” where a small set of high-reward rollouts induces representation-space preference directions that disagree with the batch majority (Zhou et al., 25 Jun 2026).

A closely related formulation appears in “Directional Alignment Mitigates Reward Hacking in Reinforcement Learning for LLMs.” There, reward hacking is analyzed as drift away from a stable low-dimensional learning trajectory. Parameter updates are decomposed by SVD,

$[CLS_0, E_0, \cdot]$4

and trusted-direction projection constrains gradients to a clean reference subspace: $[CLS_0, E_0, \cdot]$5 This is not a prompt-token boundary method, but it is a directional alignment method for prompt-conditioned RL behavior, especially in settings where exploitative behaviors are induced by specific prompt structures (Deng et al., 24 May 2026).

Topology-Enhanced Alignment supplies another geometric variant. TTL extracts cross-label “prompt–answer bridges” from a mixed prompt/answer point cloud via $[CLS_0, E_0, \cdot]$6D persistent homology and aligns the model’s prompt$[CLS_0, E_0, \cdot]$7answer update direction to those bridges during SFT, while TPO aligns rejected$[CLS_0, E_0, \cdot]$8chosen improvement directions with topic-specific semantic preference vectors during DPO. The relevant boundary is the hidden-state crossing from prompt manifold to answer manifold, and the alignment target is the sparse global skeleton given by persistent-homology merge edges rather than nearest-neighbor or per-example directions (Pan et al., 8 May 2026).

D$[CLS_0, E_0, \cdot]$9-Align moves the directional correction into the reward model’s text-embedding space for diffusion RL. With a frozen reward model, it learns a vector $\rightarrow$0 and constructs

$\rightarrow$1

then uses the guided reward $\rightarrow$2. The paper interprets this as decoupling prompt-relevant semantics from reward-bias directions that otherwise drive Preference Mode Collapse (Chen et al., 30 Dec 2025).

5. Trusted–untrusted prompt fields, calibration, and self-alignment

LocalAlign defines the prompt boundary explicitly as the split in a composite input $\rightarrow$3, where $\rightarrow$4 is trusted and $\rightarrow$5 is untrusted and can be attacker-controlled. The method generates near-but-wrong adversarial responses by synthesizing an injected command $\rightarrow$6, placing it in the untrusted field, and optimizing a margin-aware DPO loss with per-sample weights based on

$\rightarrow$7

Smaller margins receive larger effective weights through $\rightarrow$8. This tightens the robustness boundary around the correct response by penalizing small shifts toward behaviors induced by commands in untrusted data (Gong et al., 2 May 2026).

Intent-based Prompt Calibration addresses boundary alignment without parameter updates. It iteratively synthesizes “boundary use cases,” scores prompts on those hard cases, and updates the prompt through an Analyzer and Prompt Generator loop. Boundary cases are defined as examples near the current decision boundary, and the method treats them as the most informative signal for moving the prompt in the correct semantic direction. The update is gradient-free, but the paper explicitly frames it as using boundary errors to determine which clauses should be sharpened or relaxed in the prompt (Levi et al., 2024).

DRPO extends this idea to tuning-free self-alignment. The optimized objects are the system prompt and in-context demonstrations, which together form the outer prompt boundary. Dynamic rewarding selects query-specific sub-rewards such as helpfulness, clarity, safety, compliance, and limitations-awareness, and beam search updates the boundary text accordingly. In this setting, directional alignment is enacted through explicit bullet-point constraints and demonstrations rather than through learned prompt tokens or latent projectors (Singla et al., 2024).

6. Empirical patterns, misconceptions, and unresolved issues

The empirical literature converges on several regularities. In BMIP, open-world generalization on ViT-B/16 improves from MaPLe’s $\rightarrow$9 HM / $\rightarrow$0 Acc to $\rightarrow$1 HM / $\rightarrow$2 Acc on average, with pronounced gains on EuroSAT, Flowers102, and FGVC-Aircraft; the method also slightly improves cross-dataset transfer and domain generalization, and its gains persist when combined with MaPLe, PromptSRC, and CoPrompt (Lv et al., 14 Jan 2025). DiSa reports that directional regularization with class-wise prototypes yields the strongest additional gain among its ablated components, and that masking more than $\rightarrow$3 of least informative patches degrades both base and novel classes (Talemi et al., 26 May 2025). NA-MVP reports strong robustness under label noise, including ImageNet-100 results of $\rightarrow$4, $\rightarrow$5, and $\rightarrow$6 at noise rates $\rightarrow$7, $\rightarrow$8, and $\rightarrow$9, together with selective refinement that reduces Caltech101 noise from $A_v$0 to $A_v$1 and from $A_v$2 to $A_v$3 (Niu et al., 12 Mar 2026). LocalAlign reduces adaptive GCG ASR on Llama3.1 from SecAlign’s $A_v$4 to $A_v$5 while retaining comparable utility (Gong et al., 2 May 2026). GeoAlign improves final performance and reduces training oscillation, with Qwen3-4B results of $A_v$6 versus Base-GRPO’s $A_v$7 on math and $A_v$8 versus $A_v$9 on RLHF (Zhou et al., 25 Jun 2026). PDV shows that simple directional residuals can materially improve retrieval, for example raising Fashion-IQ average $A_l$0 for CIReVL on ViT-L/14 from $A_l$1 to $A_l$2 (Tursun et al., 11 Feb 2025).

Several misconceptions are directly challenged by these results. First, directional alignment is not equivalent to adding parameters: BMIP reports that increasing parameters in MaPLe does not match BMIP and tends to overfit base classes (Lv et al., 14 Jan 2025). Second, directional alignment is not synonymous with distance minimization: DiSa explicitly finds norm alignment harmful and full MSE inferior to cosine-based directional alignment (Talemi et al., 26 May 2025). Third, alignment at a boundary is not always bi-directional; some methods are intentionally one-directional, as in PDV’s residual steering or LocalAlign’s trust-preserving margin optimization, while others enforce explicit reciprocity, as in BMIP and NA-MVP (Tursun et al., 11 Feb 2025, Niu et al., 12 Mar 2026).

Limitations also recur. BMIP notes attention noise sensitivity, scalability issues with larger backbones or deeper prompt stacks, and small drops or parity on some datasets (Lv et al., 14 Jan 2025). GeoAlign warns that overly strict consensus can suppress genuinely novel correct directions and reduce exploration if anomaly filtering is too aggressive (Zhou et al., 25 Jun 2026). NA-MVP incurs unbalanced optimal transport overhead and remains sensitive to $A_l$3, $A_l$4, and $A_l$5 (Niu et al., 12 Mar 2026). LocalAlign approximates worst-case attacks through target-side generation rather than exact inner-loop optimization (Gong et al., 2 May 2026). Topology-enhanced alignment is limited to $A_l$6D persistent homology and incurs $A_l$7 distance costs (Pan et al., 8 May 2026). These constraints suggest that Prompt-Boundary Directional Alignment is best understood not as a single algorithm, but as a design principle: define the operative boundary precisely, identify the direction that reflects reliable prompt-conditioned improvement, and regularize routing or optimization so that updates cross that boundary in the intended way rather than along spurious, redundant, or adversarial directions.