Controllable-Prior Feature Attention (CPFA)

• CPFA is an attention mechanism that integrates explicit, tunable priors to blend statistical information with neural feature extraction.
• It uses a parameterized trade-off interface to mix self- and reference-guided cross-attention, enhancing consistency, interpretability, and restoration fidelity.
• CPFA is applied in mixed-type data imputation, diffusion-based generative modeling, and image restoration, offering empirical control through interpretable coefficients.

Controllable-Prior Feature Attention (CPFA) is a class of attention mechanisms in neural architectures that integrates explicit, tunable prior information—statistical, neural, or generative—into the attention computation via a parameterized control interface. CPFA enables direct manipulation of the statistical–neural or reference–content trade-off during inference or training. Approaches termed CPFA have emerged in structured data imputation, diffusion-based generative modeling, and probabilistic image restoration, offering strong empirical control over consistency, interpretability, or restoration fidelity by exposing an attention prior or reference mixing coefficient to the model designer or user (Deng et al., 18 Jan 2026, Fan et al., 2024, Sun et al., 2024).

1. Mathematical Foundations of CPFA

Controllable-Prior Feature Attention mechanisms augment the standard attention paradigm by incorporating a prior distribution, feature map, or guidance vector—either as a regularizer, an additive bias, or an explicit interpolation coefficient—into the attention computation.

Generic Formulation

Given input tokens $X_i \in \mathbb{R}^{L \times d}$, queries $Q$, keys $K$, and values $V$, standard self-attention produces:

$$A_s = \mathrm{Softmax}\left(\frac{QK^\top}{\sqrt{d}}\right)V$$

CPFA augmentations introduce a reference feature set (prior, $K_{prior}$/$V_{prior}$), and produce a cross-attention output $A_c$ analogously. A controllable trade-off parameter $\Lambda$ (scalar, vector, or tensor) governs the mixture:

$$A_{mix} = (1 - \Lambda) \odot A_s + \Lambda \odot A_c$$

Here, $\odot$ denotes element-wise multiplication, and $\Lambda$ can be a scalar ($\lambda$), a per-head vector ($\lambda_h$), or a full tensor with token, head, or spatial granularity. In statistical-neural imputation, CPFA regularizes attention by penalizing deviation from a statistical prior probability vector $P_f$, weighted by learned or user-specified prior strengths $λ_h$ (Deng et al., 18 Jan 2026). In image or video generation, CPFA enables reference-guided or diversity-inducing mixing in diffusion U-Nets (Fan et al., 2024).

2. Implementation Details and Variants

Statistical-Neural Interaction for Imputation

In Statistical-Neural Interaction Networks (SNI) for mixed-type tabular data imputation, CPFA fuses a correlation-derived statistical prior $P_f$ into a Transformer-style multi-head feature attention block (Deng et al., 18 Jan 2026). Each attention head receives a nonnegative, learnable coefficient $λ_h$ that softly regularizes the empirical attention map $\overline{A}^{(h)}$ toward $P_f$:

$$\mathcal{L}_{prior} = \alpha \sum_{h=1}^H λ_h \|\overline{A}^{(h)} - P_f\|_2^2$$

The prior strengths $λ_h$ are updated by gradient descent, and heads with high $λ_h$ converge to linear, correlation-based feature selection, while small $λ_h$ encourages unconstrained neural adaptation.

Controllable Reference-Guided Attention in Diffusion Models

RefDrop, a CPFA instantiation in diffusion models, replaces the standard self-attention with a linear mixture of self- and cross-attention to a reference feature map (Fan et al., 2024). The mixing coefficient $\Lambda$ is user-settable (scalar, per-head, per-layer, or per-token). Pseudocode for a CPFA attention block:

def CPFA_Attention(X_i, X_ref, Lambda): Q = X_i @ W_Q K_self = X_i @ W_K V_self = X_i @ W_V K_ref = X_ref @ W_K V_ref = X_ref @ W_V S_self = softmax(Q @ K_self.T / sqrt(d)) S_ref = softmax(Q @ K_ref.T / sqrt(d)) A_s = S_self @ V_self A_c = S_ref @ V_ref A_mix = (1 - Lambda) * A_s + Lambda * A_c return concat_heads(A_mix) @ W_O

During inference, $\Lambda$ is manipulated to control generated sample consistency or diversity without retraining. For multi-reference conditioning, weighted sums of multiple cross-attention terms are supported.

Probabilistic Prior-Driven Attention for Image Restoration

In image restoration under atmospheric turbulence, PPTRN's CPFA variant couples a DDPM-learned prior with Transformer attention by injecting a latent prior sample into cross-attention blocks (Sun et al., 2024). Here, attention logits may be biased by the log-probability of prior tokens, modulated by a scalar $\gamma$:

$$A_{ij} = \frac{\exp\left(Q_i K_j^\top / \sqrt{d_k} + \gamma \log p_\theta(Z_j)\right)}{\sum_k \exp\left(Q_i K_k^\top / \sqrt{d_k} + \gamma \log p_\theta(Z_k)\right)}$$

$\gamma$ and the DDPM time step control the prior’s influence and sharpness.

3. Control Regimes and Empirical Behavior

The essential utility of CPFA is the explicit control over the attention prior—whether as statistical dependency ($P_f$), cross-image consistency (reference features), or generative likelihood (DDPM log-density). Empirical studies report:

• In SNI for imputation, $λ_h$ values typically distribute across heads, with high $λ_h$ heads acting as analytic feature selectors and low $λ_h$ heads modeling nonlinear residuals. This spectrum yields both interpretability (via a dependency matrix $D_{f,j}$) and competitive continuous performance, at the cost of slightly lower accuracy on categorical variables compared to purely data-driven baselines (Deng et al., 18 Jan 2026).
• In RefDrop, increasing $\lambda$ improves image/video subject consistency (by 1–DreamSim score), with optimal trade-off at $\lambda \approx 0.3 \dots 0.4$. Negative $\lambda$ promotes diversity by driving generated samples away from references (raising LPIPS without compromising prompt fidelity) (Fan et al., 2024).
• In PPTRN, tuning $\gamma$ in prior-based attention (optimal $\gamma=1.0$) improves image restoration PSNR over baseline Transformer or no-prior variants (Sun et al., 2024).

4. Applications and Integration Scenarios

CPFA has enabled advances in several domains:

• Mixed-type Data Imputation: In SNI, CPFA provides a principled, interpretable trade-off between explicit statistical structure and deep learning flexibility. Every feature imputation can be audited for dependency structure, and per-head $\lambda_h$ offers insight into the reliance on prior knowledge (Deng et al., 18 Jan 2026).
• Diffusion-based Image/Video Generation: In RefDrop, CPFA generalizes previous ad hoc reference concatenation and supports seamless multi-reference blending, spatially localized control (via per-token $\Lambda$), and negative “repulsion” for diversity and style variation. Consistency, multi-subject compositing, and flicker suppression in videos are accessible at inference without retraining (Fan et al., 2024).
• Image Restoration from Turbulence: In PPTRN, CPFA with DDPM priors yields sharper, less artifact-prone reconstructions, and prior influence is modulated via noise schedule and $\gamma$ (Sun et al., 2024).

5. Model Selection, Interpretability, and Trade-Off Analysis

CPFA’s core feature is interpretable, quantitative regulation of prior versus data-driven attention. In SNI, the resulting directed dependency matrix $D_{f,j}$ provides an “intrinsic” map of imputation causality, validated (on synthetic DAGs) by high AUROC/AUPRC for true feature dependencies. Node-level summaries ($\Sigma_j$) identify global “hub” features critical for downstream analysis.

In generative contexts, CPFA exposes the reference-consistency/creativity axis to the practitioner, enabling explorations along subject fidelitiy and novelty dimensions with a single model (Fan et al., 2024). In restoration tasks, CPFA formalizes and quantifies the role of strong priors in driving model spatial coherence, tunable to domain idiosyncrasies (Sun et al., 2024).

6. Limitations and Deployment Considerations

The tractable and explicit nature of CPFA comes with certain domain-dependent trade-offs:

• In imputation for tabular data, SNI–CPFA yields superior interpretability but in some regimes (e.g., highly imbalanced categorical targets or MCAR/MNAR with minimal linear dependencies), accuracy may lag purely predictive baselines (Deng et al., 18 Jan 2026).
• Excessive reliance on prior coefficients can lead to overfitting to the reference or prior, reducing model capacity for out-of-distribution adaptation.
• For generative or restoration models, hand-tuning $\lambda$, $\Lambda$, or $\gamma$ may be necessary for domain-specific optimality; in practice, optimal ranges are reported (e.g., $\lambda \approx 0.3$–$0.4$ for subject consistency (Fan et al., 2024), $\gamma = 1.0$ in PPTRN (Sun et al., 2024)).

7. Summary and Context with Related Approaches

CPFA formalizes, generalizes, and exposes a controllable interface to the prior in neural attention, bridging classical statistical, generative, and deep learning paradigms. Compared with mechanisms that bake the prior implicitly (e.g., positional biases, fixed reference concatenation, entropy regularization), CPFA surfaces the prior as a user- or model-learned interpolation or regularization parameter, enabling fine-grained, interpretable, and flexible attention manipulation at inference or training time. CPFA modules have demonstrated utility in interpretable imputation (Deng et al., 18 Jan 2026), controllable generative modeling (Fan et al., 2024), and diffusion-guided restoration (Sun et al., 2024), and are conceptually related to recent developments in entropic-OT-based attention prior learning (Litman et al., 21 Jan 2026).