---
title: 'MF-Decoder: Adaptive Fusion for Vision-Language'
url: https://www.emergentmind.com/topics/modality-adaptive-fusion-decoder-mf-decoder
type: topic
---

# MF-Decoder: Adaptive Fusion for Vision-Language

Searching arXiv for the cited MUDAIF paper and closely related decoder-only vision-language work.
Modality-Adaptive Fusion Decoder (MF-Decoder) denotes the multimodal decoder stack at the core of MUDAIF, a decoder-only vision-language model introduced in “Optimizing Vision-Language Interactions Through Decoder-Only Models” [2412.10758]. In that formulation, MF-Decoder operates downstream of a Vision-Token Adapter (VTA) that converts raw pixels into “pseudo-text” tokens, and it fuses visual and textual representations through masked self-attention over a concatenated multimodal sequence together with adaptive co-attention. The architecture is presented as an alternative to conventional systems that rely on separate visual encoders, with the stated goals of enhanced efficiency, flexibility, and cross-modal understanding [2412.10758].

## 1. Position within MUDAIF

MUDAIF’s decoder-only backbone is organized into three stages: the Vision-Token Adapter (VTA), the Multimodal Decoder Stack identified as the MF-Decoder, and the Output Generation Head [2412.10758]. The model accepts an image $I \in \mathbb{R}^{H \times W \times 3}$ and a text token sequence $T = \{t_1, \ldots, t_L\}$ with embedding dimension $d$ [2412.10758].

Within this decomposition, the VTA converts raw pixels into $N$ pseudo-text tokens $V \in \mathbb{R}^{N \times d}$ by means of a small convolutional feature extractor, a linear projection, and an optional intra-visual self-attention refinement [2412.10758]. The MF-Decoder then processes both visual and textual streams jointly. After the final decoder layer, only the text-token outputs are fed into a linear plus softmax head for next-token prediction, whereas the visual stream is not directly decoded and instead influences generation through cross-attention throughout the stack [2412.10758].

This organization places MF-Decoder at the center of MUDAIF’s multimodal integration strategy. A plausible implication is that the decoder stack, rather than a separate encoder module, bears primary responsibility for both sequence modeling and cross-modal alignment.

## 2. Architectural organization of the decoder stack

The MF-Decoder is described as a stack of $L$ identical layers [2412.10758]. At layer $\ell$, each token representation, both visual and textual, is updated by three sub-layers: masked self-attention over the concatenated sequence $[T;V]$, adaptive co-attention between vision and text, and a position-wise feed-forward network [2412.10758].

The masked self-attention stage is specified as autoregressive on text and full attend on vision [2412.10758]. This design couples language-generation causality with unrestricted access to visual tokens. After self-attention, the visual stream $V_v^{(\ell)}$ and text stream $T_t^{(\ell)}$ cross-interact via bidirectional co-attention [2412.10758]. The resulting structure differs from encoder-decoder factorization in that both modalities remain active inside the same decoder stack at every depth.

The output pathway is likewise asymmetric in a precise sense. Text-token states at the final layer are used for token generation, while visual states remain latent conditioning signals rather than direct outputs [2412.10758]. This arrangement suggests a generative model in which visual information is progressively injected into an autoregressive textual backbone rather than encoded once and consumed passively.

## 3. Mathematical formulation

At layer $0$, the VTA projection is written as
$$
V^{(0)} = \mathrm{Linear}(\mathrm{Conv}(I)) \in \mathbb{R}^{N \times d},
$$
with an optional refinement by one round of intra-visual self-attention [2412.10758]. The detailed VTA construction is also given as
$$
F = \mathrm{Conv}(I),
$$
$$
V^{(0)} = W_{\mathrm{proj}} \cdot F + b_{\mathrm{proj}},
$$
followed optionally by
$$
Q_v = V^{(0)}W_q^v,\quad K_v = V^{(0)}W_k^v,\quad V' = V^{(0)}W_v^v,
$$
$$
V = \mathrm{Softmax}\!\left(\frac{Q_v K_v^T}{\sqrt{d}}\right)V'
$$
[2412.10758].

For self-attention in decoder layer $\ell$, the multimodal input is defined as
$$
X^{(\ell-1)} = [T^{(\ell-1)};V^{(\ell-1)}] \in \mathbb{R}^{(L+N)\times d},
$$
with
$$
Q = X^{(\ell-1)}W_q,\quad K = X^{(\ell-1)}W_k,\quad \hat{V} = X^{(\ell-1)}W_v,
$$
and
$$
\mathrm{SelfAttn}(X)=\mathrm{Softmax}\!\left(\frac{QK^T}{\sqrt{d}}\right)\hat{V}
$$
[2412.10758].

The defining multimodal operation is adaptive co-attention. Two cross-modal attention maps are computed at layer $\ell$ [2412.10758]. For visual-to-text attention,
$$
Q_v = V^{(\ell)} W_q^v,\quad K_t = T^{(\ell)} W_k^t,\quad V_t = T^{(\ell)} W_v^t,
$$
$$
A_{v\to t} = \mathrm{Softmax}\!\left(\frac{Q_v K_t^T}{\sqrt{d}}\right)\in \mathbb{R}^{N\times L}.
$$
For text-to-visual attention,
$$
Q_t = T^{(\ell)} W_q^t,\quad K_v = V^{(\ell)} W_k^v,\quad V_v = V^{(\ell)} W_v^v,
$$
$$
A_{t\to v} = \mathrm{Softmax}\!\left(\frac{Q_t K_v^T}{\sqrt{d}}\right)\in \mathbb{R}^{L\times N}.
$$

The fused updates are then
$$
T_{\mathrm{update}} = A_{t\to v}V_v \in \mathbb{R}^{L\times d},
$$
$$
V_{\mathrm{update}} = A_{v\to t}V_t \in \mathbb{R}^{N\times d},
$$
followed by residual normalization:
$$
T^{(\ell+1)} = \mathrm{LayerNorm}(T^{(\ell)} + T_{\mathrm{update}}),
$$
$$
V^{(\ell+1)} = \mathrm{LayerNorm}(V^{(\ell)} + V_{\mathrm{update}})
$$
[2412.10758].

Each stream then passes through the usual two-layer MLP with GeLU and residual,
$$
\mathrm{FFN}(x) = W_2(\mathrm{GeLU}(W_1x+b_1))+b_2,
$$
$$
x_{\mathrm{out}} = \mathrm{LayerNorm}(x+\mathrm{FFN}(x))
$$
[2412.10758]. For generation, MUDAIF factorizes
$$
p(t_1\ldots t_L \mid I)=\prod_{i=1}^{L} p(t_i \mid t_{<i}, V^{(0)}),
$$
with
$$
p(t_i \mid \cdot)=\mathrm{softmax}(W_{\mathrm{out}} T_t^{(L)}[i]+b_{\mathrm{out}})
$$
[2412.10758].

## 4. Training regime and optimization

The reported pretraining dataset consists of 45 M image-text pairs drawn from COCO, LAION, and Visual Genome [2412.10758]. Instruction-tuning uses a mixture of multimodal instruction datasets, specifically VQA dialogues, captioning prompts, and reasoning instructions [2412.10758].

The loss functions are given explicitly. Pretraining uses the language-modeling objective
$$
\mathcal{L}_{\mathrm{pre}} = -\sum_{i=1}^{L} \log p(t_i \mid t_{<i}, V^{(0)}),
$$
while task-specific fine-tuning uses
$$
\mathcal{L}_{\mathrm{task}} = -\sum_{i=1}^{L} \log p(t_i \mid t_{<i}, V^{(0)}, \mathrm{prompt})
$$
[2412.10758]. The combined objective is
$$
\mathcal{L}=\lambda_{\mathrm{pre}}\mathcal{L}_{\mathrm{pre}}+\lambda_{\mathrm{task}}\mathcal{L}_{\mathrm{task}},
$$
with $\lambda_{\mathrm{pre}}, \lambda_{\mathrm{task}}$ tuned on hold-out [2412.10758].

The optimization recipe is reported as AdamW with weight decay $0.01$, linear learning-rate warmup for the first $5\%$ of steps, peak learning rate around $5\times 10^{-5}$, cosine decay thereafter, and batch size $\sim 512$ images on 64 A100 GPUs [2412.10758]. No additional modality-specific regularizers beyond dropout $(0.1)$ in each sub-layer are used [2412.10758].

These details characterize MF-Decoder not as an isolated module but as part of a large-scale pretrain-and-instruction-tune pipeline. A plausible implication is that the decoder’s fusion behavior is learned primarily through standard autoregressive and instruction-following objectives rather than bespoke alignment losses.

## 5. Empirical results and ablations

MUDAIF is compared against InstructBLIP, LLaVA-1.5, and EVE-7B on VQA-v2, GQA, VizWiz, captioning BLEU, SEED, and MM-Vet [2412.10758]. The reported results are as follows:

| Model | VQA-v2 / GQA / VizWiz | BLEU / SEED / MM-Vet |
|---|---|---|
| InstructBLIP | 78.5 / 62.0 / 50.0 | 0.72 / 58.6 / 30.5 |
| LLaVA-1.5 | 78.7 / 63.2 / 51.1 | 0.74 / 60.4 / 31.0 |
| EVE-7B | 76.4 / 60.8 / 41.8 | 0.69 / 54.3 / 25.6 |
| MUDAIF (Ours) | **80.3** / **65.5** / **53.7** | **0.78** / **62.8** / **33.4** |

The ablation study on VQA-v2 and GQA isolates several architectural components [2412.10758]. Removing the Vision-Token Adapter yields $77.4 / 61.2$, removing Adaptive Co-Attention yields $78.0 / 62.0$, and using a simplified decoder with no cross-modality yields $76.8 / 60.5$ [2412.10758]. Within the paper’s experimental framing, these ablations assign a direct empirical role to the adaptive fusion machinery.

Robustness and generalization are reported separately. Under input variations such as low or high resolution and noisy inputs, MUDAIF maintains $\sim 78$–$80\%$ accuracy versus $\sim 70$–$76\%$ for baselines [2412.10758]. Zero-shot generalization on unseen tasks is reported as $72.9\%$ versus nearest $69.8\%$, and few-shot performance with fewer than 10 examples is reported as $78.3\%$ versus $\sim 75.5\%$ [2412.10758].

## 6. Efficiency, alignment, and limitations

The reported efficiency claim is that eliminating a heavyweight visual encoder yields a $\sim 20\%$ reduction in training time and $\sim 1.5\times$ faster inference on high-resolution images [2412.10758]. The paper also states that the decoder-only design supports arbitrary image resolutions and aspect ratios, since the VTA simply slides over raw pixels [2412.10758]. In this framing, MF-Decoder participates in an encoder-free architecture whose computational profile differs from conventional vision-language pipelines.

For cross-modal alignment, the paper reports cosine similarity between vision- and text-embeddings during pretraining of $0.82$ versus $\sim 0.75$ for encoder-based approaches [2412.10758]. This is presented as evidence of stronger alignment. A plausible implication is that repeated bidirectional co-attention inside the decoder stack promotes tighter representational coupling than one-shot fusion after a frozen or decoupled visual encoder.

The limitations and future directions are also stated directly. The current VTA uses fixed conv+linear layers, and future work could explore dynamic patch sizes or transformer-based vision front-ends [2412.10758]. The paper further proposes extending MF-Decoder to video by adding a temporal fusion adapter and suggests that incorporating a small gating network $\phi(\cdot)$ inside the co-attention denominator, in the style of learnable fusion biases, could allow finer-grained modality weighting [2412.10758]. These proposals indicate that the “modality-adaptive” designation refers to adaptive cross-modal interaction within the decoder, but not yet to an explicitly gated or uncertainty-aware scheduler of the kind explored in separate adaptive-fusion research directions.

## 7. Relation to adjacent adaptive-fusion work

MF-Decoder should be distinguished from the framework introduced in “Learning to Fuse: Modality-Aware Adaptive Scheduling for Robust Multimodal Foundation Models” [2506.12733]. That work proposes Modality-Aware Adaptive Fusion Scheduling (MA-AFS), a framework that learns to dynamically modulate the contribution of each modality on a per-instance basis using a lightweight neural scheduler, visual and textual entropy signals, and cross-modal agreement cues [2506.12733]. The provided record for that paper explicitly notes that there is no discussion of an MF-Decoder in the supplied details, and it does not provide the scheduler architecture, entropy formulas, fusion algorithms, theoretical propositions, or empirical results for direct comparison.

The distinction is conceptually important. MF-Decoder in MUDAIF is defined through a decoder-only architecture with bidirectional adaptive co-attention and pseudo-tokenized visual inputs [2412.10758]. MA-AFS, by contrast, is framed around dynamic fusion scheduling under noisy, missing, or misaligned inputs [2506.12733]. This suggests that “adaptive fusion” can refer either to layerwise co-attention within a unified decoder, as in MUDAIF, or to per-instance modality weighting via an explicit scheduler, as in MA-AFS. Conflating the two would obscure the architectural specificity of MF-Decoder.

Source: https://www.emergentmind.com/topics/modality-adaptive-fusion-decoder-mf-decoder