MixGate: Joint Node-Channel PP-GNN

• MixGate is a pre-propagation graph neural network paradigm that applies joint node-channel adaptive filtering through a compact shared expert bank.
• It routes filter experts to every node-channel pair using a 3D gating tensor, enabling flexible adaptation while preserving dense, cache-friendly training.
• Empirical results show MixGate outperforms other PP-GNNs on node-classification benchmarks, with significant improvements on large-scale graphs.

MixGate is a pre-propagation graph neural network (PP-GNN) design paradigm in which a compact bank of shared filter experts is routed to every node–channel pair through a 3D gating tensor, so that the effective graph filter varies with both the node and the feature channel while all graph-dependent computation remains in preprocessing. In the formulation introduced in "Gate the Filter, Not the Message: Node-Channel Mixtures for Pre-Propagation GNNs," MixGate is instantiated as FilterMoE, a mixture-of-experts PP-GNN built from learnable Chebyshev filters over a cached diffusion basis. Its central claim is that the important design variable in PP-GNNs is not merely hop-aggregator capacity, but how filter coefficients are shared across nodes and feature channels (Yue et al., 1 Jun 2026).

1. Pre-propagation contract and the problem MixGate addresses

PP-GNNs precompute dense hop features once and train only on cached tensors. For a graph with $N$ nodes, node features $X\in\mathbb{R}^{N\times F}$, and a diffusion operator $S\in\mathbb{R}^{N\times N}$, preprocessing materializes

$$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$

Training then applies a row-wise dense predictor $\hat y_i = f_\theta(z_i)$ without further sparse message passing. This preprocessing-only contract is what gives PP-GNNs their scalability: all graph-dependent propagation is amortized, and the training loop uses dense operations only (Yue et al., 1 Jun 2026).

Within this regime, a puzzle motivates MixGate. More complex hop aggregators do not reliably outperform simpler ones: on many benchmarks, a plain MLP-based aggregator matches or beats hop-attention variants. The paper reinterprets this behavior from a graph-filter perspective. Over a precomputed diffusion basis, existing PP-GNNs differ mainly in how filter coefficients are shared across nodes and channels. MLP-based architectures learn channel-dependent filters that are largely shared across nodes, while hop-attention-based architectures learn node-dependent mixtures that are largely shared across channels. MixGate is introduced to fill the missing regime: joint node- and channel-adaptive filtering under the pre-propagation computational contract (Yue et al., 1 Jun 2026).

This reframing is significant because it shifts the comparison away from generic notions of model capacity. A plausible implication is that several apparently different PP-GNN heads are better understood as different coefficient-sharing schemes over the same cached basis, with MixGate adding the one regime that standard PP-GNN designs had not represented directly.

2. Chebyshev experts and filter-level routing

FilterMoE implements MixGate with a small bank of learnable Chebyshev filter experts over a cached diffusion basis. For an undirected graph with normalized Laplacian $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$, the Laplacian is scaled so that $\tilde L$ has spectrum in $[-1,1]$. The precomputed Chebyshev basis is

$$B_0 = X,\qquad B_1 = \tilde L X,\qquad B_k = 2\tilde L B_{k-1} - B_{k-2},\quad k=2,\dots,K,$$

equivalently $B_k = T_k(\tilde L)X$ for $X\in\mathbb{R}^{N\times F}$0 (Yue et al., 1 Jun 2026).

Each expert $X\in\mathbb{R}^{N\times F}$1 has coefficients $X\in\mathbb{R}^{N\times F}$2 and spectral response

$X\in\mathbb{R}^{N\times F}$3

Because the basis tensors are cached, the expert output during training is only a dense recombination,

$X\in\mathbb{R}^{N\times F}$4

The graph-dependent propagation therefore remains offline; no per-epoch sparse propagation is reintroduced. The coefficients are initialized using ChebNetII’s interpolation parameterization and then learned (Yue et al., 1 Jun 2026).

MixGate itself is the routing mechanism over these experts. FilterMoE learns a gate tensor whose axes correspond to nodes, experts, and feature channels; in the formal presentation it is written as $X\in\mathbb{R}^{N\times F}$5, where $X\in\mathbb{R}^{N\times F}$6 is the weight of expert $X\in\mathbb{R}^{N\times F}$7 for node $X\in\mathbb{R}^{N\times F}$8 and channel $X\in\mathbb{R}^{N\times F}$9. Given logits $S\in\mathbb{R}^{N\times N}$0, dense routing normalizes across experts,

$S\in\mathbb{R}^{N\times N}$1

with routing temperature $S\in\mathbb{R}^{N\times N}$2; a sparse variant optionally keeps top-$S\in\mathbb{R}^{N\times N}$3 experts per $S\in\mathbb{R}^{N\times N}$4 (Yue et al., 1 Jun 2026).

The routed representation and effective node-channel filter are

$S\in\mathbb{R}^{N\times N}$5

and

$S\in\mathbb{R}^{N\times N}$6

The second expression is the key structural statement of MixGate: each node–channel pair receives its own adaptive filter, but the filter is constrained to lie in the span of a compact shared expert bank. This combines fine-grained adaptivity with parameter sharing and preserves dense, cache-friendly training (Yue et al., 1 Jun 2026).

3. Sharing regimes, routers, and the meaning of “gate the filter, not the message”

The paper contrasts three coefficient-sharing regimes over the cached basis. The distinction is not whether a model is “simple” or “complex,” but whether it adapts across channels, nodes, or both.

Regime	Representative view	Sharing pattern
Channel-adaptive, node-shared	SIGN linear view $S\in\mathbb{R}^{N\times N}$7	Distinct filters per channel, largely shared across nodes
Node-adaptive, channel-shared	HOGA hop attention	Node-dependent hop weights, mostly shared across channels
Joint node-channel adaptivity	FilterMoE / MixGate	Adaptive filter per node–channel pair

In this sense, MixGate is a filter-level gate rather than a message-passing attention mechanism. Message-passing attention such as GAT weights neighbor messages online; hop-attention PP-GNNs such as HOGA weight hop features per node but largely share weights across channels. MixGate instead routes spectral filters themselves to node–channel pairs using only cached diffusion features. That distinction is what preserves the PP-GNN contract while targeting joint node- and channel-adaptive filtering (Yue et al., 1 Jun 2026).

Two routers are described for computing the gate logits. The direct joint MLP router forms a node descriptor $S\in\mathbb{R}^{N\times N}$8 from pre-routing expert outputs $S\in\mathbb{R}^{N\times N}$9, optionally augmented by random-walk structural encodings, and applies an MLP to produce an $$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$0 logit grid per node,

$$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$1

This design has no sharing across channels or experts in the final logit grid (Yue et al., 1 Jun 2026).

The response-aware two-stage router uses each expert’s graph-aware spectral shape. It first constructs an SLQ spectral grid $$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$2 offline, samples each expert response $$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$3, and maps the weighted sketch $$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$4 through $$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$5 to obtain expert keys $$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$6. Node and channel queries are then extracted from expert outputs: $$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$7 and $$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$8. Stage 1 computes node-shared priors across channels,

$$Z = [X \,\|\, SX \,\|\, S^2X \,\|\, \cdots \,\|\, S^KX] \in \mathbb{R}^{N\times((K+1)F)}.$$9

and Stage 2 refines them with channel-specific corrections,

$\hat y_i = f_\theta(z_i)$0

followed by the softmax over experts. Optional top-$\hat y_i = f_\theta(z_i)$1 screening reduces stage-2 candidates (Yue et al., 1 Jun 2026).

A recurring misconception addressed by the paper is that unconstrained per-node-per-channel flexibility can be recovered simply by increasing hop-attention heads. Empirically, setting HOGA heads equal to hidden dimension did not close the gap consistently on heterophilous graphs, which the paper attributes to weak inductive bias when attempting unconstrained per-node-per-channel filters. MixGate’s compact expert bank and shared routing keys provide a more structured route to the same missing regime (Yue et al., 1 Jun 2026).

4. Optimization, regularization, and computational properties

FilterMoE combines the supervised task loss $\hat y_i = f_\theta(z_i)$2 with several lightweight regularizers. Expert diversity is enforced in spectral-response space to discourage collapse. Using normalized sampled responses $\hat y_i = f_\theta(z_i)$3 and the weighted Gram matrix

$\hat y_i = f_\theta(z_i)$4

the diversity loss is

$\hat y_i = f_\theta(z_i)$5

Chebyshev smoothness damps high degrees and stabilizes training,

$\hat y_i = f_\theta(z_i)$6

MoE balancing uses per-channel importance and, for sparse routing, per-channel load. The router z-loss stabilizes logit magnitudes,

$\hat y_i = f_\theta(z_i)$7

The final objective is

$\hat y_i = f_\theta(z_i)$8

Dense softmax routing sets $\hat y_i = f_\theta(z_i)$9; sparse top-$L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$0 routing uses both $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$1 and $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$2 (Yue et al., 1 Jun 2026).

The complexity profile is divided cleanly between offline preprocessing and dense training. Preprocessing the Chebyshev basis $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$3 costs $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$4 sparse–dense operations and requires cache size $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$5. Building the SLQ grid for $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$6 points costs $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$7 per update and is done once. During training and inference, expert outputs cost $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$8, gate softmax and mixing cost $L = I - D^{-1/2}AD^{-1/2} = U\Lambda U^\top$9, and router cost depends on whether the direct MLP or two-stage scheme is used (Yue et al., 1 Jun 2026).

The reported large-graph runtimes, excluding one-time preprocessing and averaged over 10 runs, are approximately 31 min/run on pokec, 10 min/run on ogbn-products, and 14 min/run on ogbn-papers100M. One-time preprocessing on pokec and products is at most 3% of the 10-run total; on papers100M it is approximately 41 min combined for Chebyshev and SLQ, still amortized across seeds and trials (Yue et al., 1 Jun 2026).

These details matter because MixGate is proposed not as an exception to pre-propagation, but as a way of increasing adaptivity without violating pre-propagation’s dense-only training loop.

5. Empirical results, ablations, and common points of confusion

Across eleven node-classification benchmarks, FilterMoE is reported as a robust learned aggregator for PP-GNNs. It wins on 9 of 11 datasets and improves the average test score over the strongest PP-GNN baseline—defined as the best of SIGN, HOGA, and GAMLP per dataset—by 1.53 points. On the three large-scale graphs, where PP-GNNs are particularly relevant, it ranks first on all three: pokec 83.87, an improvement of 1.76 over the best PP-GNN; ogbn-products 82.36, an improvement of 0.93; and ogbn-papers100M 67.57, an improvement of 0.71 (Yue et al., 1 Jun 2026).

The homophily and heterophily results are differentiated rather than conflated. On homophilic graphs, FilterMoE is competitive with adaptive MP-GNNs and graph-MoE methods, while improving by 2.4 points on average over the best PP baseline. On heterophilic graphs, it is second on tolokers with 85.06 ROC-AUC, virtually tied with GAMLP; third on minesweeper with 92.29 ROC-AUC; and fourth on roman-empire with 82.79. Even there, it beats the strongest PP-GNN baseline by 1.58 on minesweeper and 2.78 on roman-empire (Yue et al., 1 Jun 2026).

The ablations are central to the interpretation of MixGate. Gating granularity shows that node-only gating is better than channel-only gating on all eight small datasets, while joint routers match or outperform single-axis variants on seven of eight. The direct joint MLP router is described as the most robust on heterophily. Expert-count studies indicate that small banks, approximately $\tilde L$0–12, suffice; diversity loss mitigates collapse, and smoothness stabilizes learning of higher-order filters. Sensitivity to $\tilde L$1 indicates that moderate orders, approximately $\tilde L$2–15, balance expressivity and stability (Yue et al., 1 Jun 2026).

A second common confusion is whether the observed gain comes only from replacing the preprocessing operator with Chebyshev diffusion. The reported ablation argues against that reading. Swapping PP baselines’ preprocessing to Chebyshev helps on homophily but not heterophily; FilterMoE still outperforms the best Chebyshev-tuned PP baselines on all datasets. The paper therefore interprets the gain as coming from joint node–channel routing, not from the operator alone (Yue et al., 1 Jun 2026).

6. Practical guidance, extensions, and nomenclature

The paper presents MixGate as a robust default when the alternative is dataset-specific hop-aggregator selection among MLP, hop attention, or adaptive fusion. On heterophilous graphs with diverse local spectra, the direct joint MLP router tends to outperform node-only or channel-only gates; on saturated homophily, node-only gating can be sufficient. Recommended settings are: Chebyshev order $\tilde L$3 of 7–12 for small and mid-sized graphs and 10–12 for large graphs; smoothness weight $\tilde L$4–0.2; experts $\tilde L$5 in the range 6–12, starting at 8–10 on large graphs; diversity weight $\tilde L$6–$\tilde L$7; direct joint MLP routers with 2–4 layers and width 128–768; temperature $\tilde L$8; optional top-$\tilde L$9–2 for sparsity; and, for the two-stage router on very large channel count, $[-1,1]$0–32 with Stage-1 top-$[-1,1]$1–4. The SLQ grid recommendation is $[-1,1]$2 with 20 probes and 50 Lanczos iterations (Yue et al., 1 Jun 2026).

The failure modes and mitigations are correspondingly concrete. Expert collapse is addressed by adding $[-1,1]$3, reducing $[-1,1]$4, increasing $[-1,1]$5 modestly, or using top-$[-1,1]$6 routing. Overfitting at high $[-1,1]$7 is addressed by increasing $[-1,1]$8, early stopping, reducing $[-1,1]$9, or projecting input channels before routing. Router instability is addressed through $$B_0 = X,\qquad B_1 = \tilde L X,\qquad B_k = 2\tilde L B_{k-1} - B_{k-2},\quad k=2,\dots,K,$$0, LayerNorm, temperature annealing, and restricted gate width. Imbalanced experts are handled באמצעות $$B_0 = X,\qquad B_1 = \tilde L X,\qquad B_k = 2\tilde L B_{k-1} - B_{k-2},\quad k=2,\dots,K,$$1 and $$B_0 = X,\qquad B_1 = \tilde L X,\qquad B_k = 2\tilde L B_{k-1} - B_{k-2},\quad k=2,\dots,K,$$2, or by using a Stage-1 prior with top-$$B_0 = X,\qquad B_1 = \tilde L X,\qquad B_k = 2\tilde L B_{k-1} - B_{k-2},\quad k=2,\dots,K,$$3 screening (Yue et al., 1 Jun 2026).

The design is also presented as extensible. For directed or weighted graphs, the scaled Laplacian can be replaced by an appropriate operator, such as normalized adjacency for directed graphs or Hermitian symmetrizations, while keeping experts and gates unchanged. For heterogeneous graphs, relation-specific bases $$B_0 = X,\qquad B_1 = \tilde L X,\qquad B_k = 2\tilde L B_{k-1} - B_{k-2},\quad k=2,\dots,K,$$4 can be built and experts extended to multi-relation polynomials, with gates conditioned on node and edge types. For link prediction, the proposal is to compute pairwise routed representations and a pairwise gate; for graph classification, to apply MixGate per graph and then pool nodes. MixGate is further described as orthogonal to label-propagation modules such as GAMLP’s optional label feedback, which can be layered on top while preserving prepropagation for features (Yue et al., 1 Jun 2026).

The name "MixGate" is not unique across the broader machine-learning and quantum-information literature. It has also been used for a multiview circuit representation learning framework in Boolean circuit analysis (Shi et al., 25 Sep 2025) and for a channel-aware gating mechanism in distributed wireless mixture-of-experts systems (Song et al., 1 Apr 2025). In the PP-GNN setting, however, the term refers specifically to joint node–channel routing over a compact bank of learnable Chebyshev filter experts, operationalized by FilterMoE (Yue et al., 1 Jun 2026).