Search papers, labs, and topics across Lattice.
C๐ i)\mathbf{f}_{\text{out}}=\text{BatchNorm}\left(\frac{1}{C}\sum_{i=1}^{C}\mathbf{F}_{i}\right) (19) Gated Linear Unit (GLU) Fusion: A gating mechanism that learns to suppress noise and control information flow. The gating mechanism can learn to suppress noisy or irrelevant feature dimensions while preserving informative ones, acting as a learned noise filter. ๐=๐ฑs+๐ฑt\mathbf{c}=\mathbf{x}_{s}+\mathbf{x}_{t} (20) ๐ =ฯโ(๐gโ[๐ฑsโฅ๐ฑt]+๐g)โโBรD\mathbf{g}=\sigma\left(\mathbf{W}_{g}[\mathbf{x}_{s}\|\mathbf{x}_{t}]+\mathbf{b}_{g}\right)\in\mathbb{R}^{B\times D} (21) ๐out=BatchNormโ(๐โ๐ )\mathbf{f}_{\text{out}}=\text{BatchNorm}(\mathbf{c}\odot\mathbf{g}) (22) where ฯ\sigma is the sigmoid function, โ\odot denotes element-wise multiplication, and ๐gโโDร2โD\mathbf{W}_{g}\in\mathbb{R}^{D\times, D}. Multiplicative Fusion: Element-wise product of projected features to capture second-order interactions. Multiplicative interactions can capture correlations between the two streams that additive fusion cannot, enabling the model to learn feature conjunctions. ๐=(๐sโ๐ฑs+๐s)โ(๐tโ๐ฑt+๐t)\mathbf{f}=(\mathbf{W}_{s}\mathbf{x}_{s}+\mathbf{b}_{s})\odot(\mathbf{W}_{t}\mathbf{x}_{t}+\mathbf{b}_{t}) (23) ๐out=BatchNormโ(Dropoutโ(๐))\mathbf{f}_{\text{out}}=\text{BatchNorm}(\text{Dropout}(\mathbf{f})) (24) where ๐s,๐tโโDรD\mathbf{W}_{s},\mathbf{W}_{t}\in\mathbb{R}^{D\times D}. Low-Rank Bilinear Fusion: Full bilinear interaction approximated with low-rank factorization for efficiency. Captures rich pairwise interactions between all feature dimensions while maintaining computational efficiency through the low-rank bottleneck. A full bilinear model would compute ๐ฑsโคโ๐๐ฑt\mathbf{x}_{s}^{\top}\mathbf{W}\mathbf{x}_{t} with ๐โโDรDรD\mathbf{W}\in\mathbb{R}^{D\times D\times D}, which is computationally prohibitive. Instead, we use a low-rank approximation: ๐ณs=๐sโ๐ฑsโโBรR\mathbf{z}_{s}=\mathbf{U}_{s}\mathbf{x}_{s}\in\mathbb{R}^{B\times R} (25) ๐ณt=๐tโ๐ฑtโโBรR\mathbf{z}_{t}=\mathbf{U}_{t}\mathbf{x}_{t}\in\mathbb{R}^{B\times R} (26) ๐ณ=๐ณsโ๐ณtโโBรR\mathbf{z}=\mathbf{z}_{s}\odot\mathbf{z}_{t}\in\mathbb{R}^{B\times R} (27) ๐out=BatchNormโ(Dropoutโ(๐outโ๐ณ+๐out))\mathbf{f}_{\text{out}}=\text{BatchNorm}(\text{Dropout}(\mathbf{W}_{\text{out}}\mathbf{z}+\mathbf{b}_{\text{out}})) (28) where ๐s,๐tโโRรD\mathbf{U}_{s},\mathbf{U}_{t}\in\mathbb{R}^{R\times D} are low-rank projection matrices, RโชDR\ll D is the rank (typically 8-32), and ๐outโโDรR\mathbf{W}_{\text{out}}\in\mathbb{R}^{D\times R}. Cross-Attention Fusion: Multi-head cross-attention allowing one stream to attend to the other, followed by global weighting. Cross-attention allows the spectral stream to selectively incorporate information from the temporal stream based on learned relevance, providing a more flexible fusion mechanism than simple weighting. Step 1: Multi-Head Cross-Attention For HH attention heads with head dimension dh=D/Hd_{h}=D/H: ๐=๐Qโ๐ฑs,๐=๐Kโ๐ฑt,๐=๐Vโ๐ฑt\mathbf{Q}=\mathbf{W}_{Q}\mathbf{x}_{s},\quad\mathbf{K}=\mathbf{W}_{K}\mathbf{x}_{t},\quad\mathbf{V}=\mathbf{W}_{V}\mathbf{x}_{t} (29) Attentionโ(๐,๐,๐)=softmaxโ(๐๐โคฯโdh)โ๐\text{Attention}(\mathbf{Q},\mathbf{K},\mathbf{V})=\text{softmax}\left(\frac{\mathbf{Q}\mathbf{K}^{\top}}{\tau\sqrt{d_{h}}}\right)\mathbf{V} (30) ๐ฑattn=๐Oโ Concatโ(head1,โฆ,headH)\mathbf{x}_{\text{attn}}=\mathbf{W}_{O}\cdot\text{Concat}(\text{head}_{1},\ldots,\text{head}_{H}) (31) Step 2: Global Weighting ๐ฐ=softmaxโ(MLPโ([๐ฑsโฅ๐ฑattn])ฯ)โโBร2\mathbf{w}=\text{softmax}\left(\frac{\text{MLP}([\mathbf{x}_{s}\|\mathbf{x}_{\text{attn}}])}{\tau}\right)\in\mathbb{R}^{B\times 2} (32) ๐=w0โ ๐ฑs+w1โ ๐ฑattn\mathbf{f}=w_{0}\cdot\mathbf{x}_{s}+w_{1}\cdot\mathbf{x}_{\text{attn}} (33) ๐out=BatchNormโ(๐+ฯโ(ฮฑ)โ ๐ฑs+๐ฑt2)\mathbf{f}_{\text{out}}=\text{BatchNorm}\left(\mathbf{f}+\sigma(\alpha)\cdot\frac{\mathbf{x}_{s}+\mathbf{x}_{t}}{2}\right) (34) C.2 Fusion Ablation Results Table 10: Fusion Strategy Ablation on Wang 2016 SSVEP STFT Config Strategy Val Acc Unseen Acc Unseen F1 Unseen Rec Unseen AUC nperseg=128 noverlap=64 nfft=256
1
0
1