Gluon-MVR: Momentum Variance Reduction

• Gluon-MVR is a momentum variance reduction technique that augments the Gluon framework with same-sample gradient-difference corrections to efficiently reduce variance.
• It improves non-convex convergence rates from O(K⁻¹/4) to O(K⁻¹/3) (and O(K⁻¹/2) for star-convex cases) by leveraging layer-wise norms and trust-region LMOs.
• The method extends to federated settings by integrating SARAH-style recursive estimators and compression techniques, enhancing communication efficiency.

Searching arXiv for papers on Gluon-MVR, Gluon, Muon, and related optimizer variants. Gluon-MVR denotes a family of momentum variance reduction methods built on the Gluon optimization framework, a layer-wise non-Euclidean linear minimization oracle (LMO) scheme that captures Muon, Scion, and related trust-region-style optimizers as special cases. In the non-convex stochastic setting, Gluon-MVR replaces vanilla momentum with control-variate updates based on same-sample gradient differences at consecutive iterates, while retaining Gluon’s layer-wise norm geometry and LMO step. In distributed and federated settings, the same principle is combined with SARAH-style recursive estimators, unbiased or contraction compressors, and error feedback, yielding communication-efficient variants with comparable communication complexity under weaker conditions when $L_i^1 \neq 0$ (Qian et al., 18 Dec 2025, Qian et al., 12 Apr 2026).

1. Gluon framework and optimization setting

Gluon-MVR inherits its ambient problem from Gluon. The objective is stochastic optimization over a finite-dimensional vector space,

$$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$

or, in the federated formulation,

$$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$

The parameter is partitioned layer-wise as $X=[X_1,\ldots,X_p]$, with $X_i \in \mathcal{S}_i$. This block structure is central: Gluon does not assume a single Euclidean geometry, but instead equips each layer with its own norm $\|\cdot\|_{(i)}$ and dual norm $\|\cdot\|_{(i)\star}$ (Qian et al., 18 Dec 2025).

The defining regularity condition is the layer-wise $(L_i^0,L_i^1)$-smoothness assumption,

$$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$

This formulation is more general than standard global $L$-smoothness and is meant to reflect the empirical observation that curvature and smoothness vary by layer and may scale with the local gradient norm. The analysis is supplemented by unbiased stochastic gradients with bounded variance, a norm-equivalence bound $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$0, and a Hessian-variance condition controlled by $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$1 (Qian et al., 18 Dec 2025).

The update itself is expressed through a trust-region LMO. For each block $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$2, Gluon defines

$$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$3

and computes

$$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$4

Here $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$5 is the momentum-like search direction. By choosing the block partition and the norms appropriately, Gluon recovers Muon and Scion. Muon corresponds to spectral-norm trust-region LMOs on hidden-layer weight matrices, whereas Scion applies the spectral-norm LMO to all layers (Qian et al., 18 Dec 2025).

2. Momentum variance reduction and the three Gluon-MVR variants

The defining modification in Gluon-MVR is the replacement of vanilla momentum by same-sample gradient-difference corrections. In vanilla Gluon, the momentum is typically

$$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$6

Gluon-MVR inserts a STORM-style control variate that evaluates gradients at both $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$7 and $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$8 using the same sample $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$9. This reduces variance without introducing bias and does not require large batches or checkpoint gradients (Qian et al., 18 Dec 2025).

The first variant, Gluon-MVR-1, is the most direct substitution: $$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$0 Its structure is minimal: the previous momentum is corrected by subtracting the stale stochastic gradient on the current sample and adding the current one. In the single-block spectral-norm case, this coincides with Muon-MVR. The paper also gives a decreasing-stepsize version with

$$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$1

which is used to obtain theory-guided $$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$2 guarantees (Qian et al., 18 Dec 2025).

The second variant, Gluon-MVR-2, introduces an auxiliary recursive estimator $$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$3,

$$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$4

followed by a smoothed momentum

$$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$5

The parameter $$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$6 controls the strength of the variance-reduced correction. Smaller $$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$7 increases the recursive contribution, whereas larger $$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$8 makes the estimator more local (Qian et al., 18 Dec 2025).

The third variant, Gluon-MVR-3, combines the recursive estimator of Gluon-MVR-2 with an additional gradient-difference correction,

$$\min_{X \in \mathcal{S}} \; f(X) := \frac{1}{n}\sum_{\tau=1}^n f^\tau(X), \quad f^\tau(X):= \mathbb{E}_{\xi_\tau \sim D_\tau}\big[f_{\xi_\tau}(X)\big].$$9

This formulation interpolates between the first two designs: it retains a recursively denoised estimator $X=[X_1,\ldots,X_p]$0 while also injecting the explicit same-sample difference term into the momentum state (Qian et al., 18 Dec 2025).

Across all three variants, the LMO step remains unchanged. The algorithmic identity of Gluon-MVR is therefore not a new search geometry, but a new momentum estimator inside the pre-existing non-Euclidean trust-region geometry of Gluon.

3. Convergence theory and rate improvements

The principal theoretical claim associated with Gluon-MVR is that MVR improves the constant-stepsize non-convex rate from $X=[X_1,\ldots,X_p]$1 for vanilla Gluon to $X=[X_1,\ldots,X_p]$2 for all three MVR variants. The paper presents this as the optimal rate for single-sample stochastic non-convex optimization, citing lower-bound consistency. The gain is traced to tighter control of

$X=[X_1,\ldots,X_p]$3

obtained by exploiting same-sample gradient differences, Hessian variance bounds, and the layer-wise smoothness structure (Qian et al., 18 Dec 2025).

For Gluon-MVR-1, the representative non-convex guarantee is stated in terms of

$X=[X_1,\ldots,X_p]$4

When $X=[X_1,\ldots,X_p]$5, choosing

$X=[X_1,\ldots,X_p]$6

yields

$X=[X_1,\ldots,X_p]$7

When $X=[X_1,\ldots,X_p]$8, the same rate is recovered essentially under

$X=[X_1,\ldots,X_p]$9

up to a small additive term of order $X_i \in \mathcal{S}_i$0. Gluon-MVR-2 and Gluon-MVR-3 admit analogous $X_i \in \mathcal{S}_i$1 statements under parameter choices such as $X_i \in \mathcal{S}_i$2 and $X_i \in \mathcal{S}_i$3 for Gluon-MVR-2, and $X_i \in \mathcal{S}_i$4 with $X_i \in \mathcal{S}_i$5 for Gluon-MVR-3 (Qian et al., 18 Dec 2025).

The star-convex case is treated separately through Muon-MVR. There the trust-region step is written as

$X_i \in \mathcal{S}_i$6

with MVR update

$X_i \in \mathcal{S}_i$7

Under star-convexity and Non-Euclidean smoothness, the resulting rate improves from the previously known $X_i \in \mathcal{S}_i$8 for Muon to $X_i \in \mathcal{S}_i$9 for Muon-MVR when $\|\cdot\|_{(i)}$0 and $\|\cdot\|_{(i)}$1 (Qian et al., 18 Dec 2025).

A common misconception is that Gluon-MVR is a single optimizer with a single proof template. The published analysis instead treats three non-convex MVR insertions, plus a star-convex Muon-MVR specialization, all sharing the same LMO geometry but differing in how variance-reduced momentum is constructed.

4. Communication-efficient federated variants

A second line of work extends Gluon-MVR to communication-efficient federated learning. Here the objective is

$\|\cdot\|_{(i)}$2

with $\|\cdot\|_{(i)}$3 workers, local data distributions $\|\cdot\|_{(i)}$4, and server-side aggregation. The key design is a SARAH/PAGE-style recursive estimator $\|\cdot\|_{(i)}$5 that alternates between occasional uncompressed refreshes and frequent compressed gradient-difference steps. This is explicitly motivated by the fact that gradient differences are smaller and easier to compress than full gradients (Qian et al., 12 Apr 2026).

Two compressor classes are considered. An unbiased compressor $\|\cdot\|_{(i)}$6 satisfies

$\|\cdot\|_{(i)}$7

while a contraction compressor $\|\cdot\|_{(i)}$8 satisfies

$\|\cdot\|_{(i)}$9

Contraction compressors are paired with error feedback, with local memory $\|\cdot\|_{(i)\star}$0 compensating the compression bias (Qian et al., 12 Apr 2026).

In the unbiased compressed Gluon with MVR, the server-side recursive estimator is

$\|\cdot\|_{(i)\star}$1

where $\|\cdot\|_{(i)\star}$2 is the Bernoulli refresh flag and $\|\cdot\|_{(i)\star}$3 is the averaged compressed gradient difference. The MVR momentum takes the form

$\|\cdot\|_{(i)\star}$4

The same momentum law is used in the contraction-compressor setting after the error-feedback correction (Qian et al., 12 Apr 2026).

The theory preserves the overall Gluon-MVR logic while adding communication terms. For unbiased compressors, the rate corollary yields

$\|\cdot\|_{(i)\star}$5

where $\|\cdot\|_{(i)\star}$6 includes the layer-wise smoothness constants and the compressor-dependent term

$\|\cdot\|_{(i)\star}$7

For contraction compressors with error feedback and MVR, a similar bound holds with $\|\cdot\|_{(i)\star}$8 replacing $\|\cdot\|_{(i)\star}$9. In both cases, the notable point is structural rather than merely asymptotic: when $(L_i^0,L_i^1)$0, MVR requires only

$(L_i^0,L_i^1)$1

whereas the non-MVR compressed Gluon analysis requires the stricter condition

$(L_i^0,L_i^1)$2

This weaker condition is one of the central reasons MVR is introduced in the federated setting (Qian et al., 12 Apr 2026).

The communication model is explicit. Expected per-step uplink cost is

$(L_i^0,L_i^1)$3

for unbiased compression and

$(L_i^0,L_i^1)$4

for contraction compression. For $(L_i^0,L_i^1)$5-precision, the total expected communication is reported as

$(L_i^0,L_i^1)$6

for compressed Gluon with unbiased compressors, and

$(L_i^0,L_i^1)$7

for compressed Gluon with error feedback and contraction compressors. These dominant terms improve on the stated EF21-Muon stochastic-gradient communication baseline of

$(L_i^0,L_i^1)$8

(Qian et al., 12 Apr 2026).

5. Empirical behavior and implementation

The non-federated Gluon-MVR experiments are conducted on NanoGPT with approximately $(L_i^0,L_i^1)$9M parameters, using FineWeb-10B, a single NVIDIA A100 GPU, $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$0 steps, and global batch sizes $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$1. Validation loss is the reported metric. The strongest large-batch result is for Gluon-MVR-2 at $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$2: baseline Gluon reaches $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$3, whereas a tuned Gluon-MVR-2 run with $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$4 and $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$5 reaches $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$6. Gluon-MVR-1 is nearly neutral at $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$7, with $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$8 versus the same $$\|\nabla_i f(X) - \nabla_i f(Y)\|_{(i)\star} \leq \left(L^0_i + L^1_i \|\nabla_i f(X)\|_{(i)\star}\right) \|X_i - Y_i\|_{(i)}.$$9 baseline, but becomes more helpful at smaller batch size, improving from $L$0 to $L$1 at $L$2. Gluon-MVR-3 also improves over baseline, with a best reported run of $L$3, though it is described as generally slightly inferior to Gluon-MVR-2 and superior to Gluon-MVR-1 (Qian et al., 18 Dec 2025).

These experiments support a practical division of labor among the variants. Gluon-MVR-2 is empirically strongest in the large-batch regime, Gluon-MVR-1 is more useful in smaller-batch settings, and Gluon-MVR-3 is intermediate. The recommended theory-guided schedule for provable $L$4 behavior is

$L$5

whereas constant stepsizes are used for most practical tuning. The main overhead is computational rather than conceptual: MVR requires evaluating both $L$6 and $L$7, which is roughly a second backward pass per step, while the spectral-norm LMO is typically approximated efficiently by a few power iterations (Qian et al., 18 Dec 2025).

The federated experiments use two tasks. The first is logistic regression on the a5a dataset with cross-entropy, weight decay $L$8, batch size $L$9, and $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$00 clients. The second is a CNN on CIFAR-10 with spectral norm LMOs for hidden layers and $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$01-norm for the head, batch size $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$02, and $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$03. Compressors include RandK% and TopK%. Across both tasks, Compressed Gluon and Compressed Gluon with error feedback achieve approximately $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$04–$$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$05 reduction in communication cost, measured in uplink bytes, relative to tuned baselines at comparable loss. The ablations report that smaller $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$06 slows per-iteration convergence but improves cost-versus-loss trade-offs under aggressive compression, larger $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$07 accelerates convergence of the variance-reduced methods, $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$08 consistently improves performance, and TopK% does not show a clear advantage over RandK% (Qian et al., 12 Apr 2026).

From an implementation standpoint, the published guidance is specific. For compressed unbiased variants, the experiments treat $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$09–$$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$10 as typical, while the theory suggests $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$11. For compression, an effective setting is $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$12 for unbiased sparsification, with $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$13, and $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$14 for contraction compressors used with error feedback. This suggests that Gluon-MVR is not only a rate-improvement device but also a practical stabilizer when the optimization geometry is non-Euclidean and communication is constrained (Qian et al., 12 Apr 2026).

6. Relations, scope, and terminological ambiguity

Within optimization, Gluon-MVR is best understood as a family rather than a single named algorithm. It is the MVR augmentation of Gluon, and therefore of any optimizer representable through Gluon’s layer-wise LMO geometry. In this sense it recovers Muon-MVR in the single-block spectral-norm case and Scion-MVR when the same spectral-norm LMO is applied layer-wise. The unifying idea is not a specific architecture or dataset, but the insertion of same-sample variance reduction into momentum under layer-wise non-Euclidean trust regions (Qian et al., 18 Dec 2025).

A separate source of confusion is terminological. In the supplied QCD-oriented synthesis, “Gluon-MVR” is also used as a shorthand for a multi-vertex renormalization/modeling framework centered on Landau-gauge four-gluon and ghost–gluon vertices. In that usage, the framework is anchored by a nearly flat four-gluon dressing $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$15, an IR-enhanced $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$16, a suppressed $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$17, and a soft-gluon ghost–gluon form factor $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$18 that remains close to its tree-level value, supporting $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$19 in Taylor kinematics (Brito et al., 29 May 2025). Related Landau-gauge work on the gluon propagator and three-gluon vertex with dynamical quarks formulates mass–vertex relations through the decomposition

$$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$20

with STIs separating the $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$21-driven no-pole part of the vertex from the pole part driven by $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$22 (Aguilar et al., 2019).

The two usages are unrelated in technical content. One belongs to stochastic non-Euclidean optimization and federated learning; the other belongs to nonperturbative Yang–Mills theory. The overlap is lexical rather than conceptual. A plausible implication is that the term “Gluon-MVR” should always be interpreted in context: in optimizer literature it denotes Momentum Variance Reduction for Gluon, whereas in the QCD synthesis it denotes a multi-vertex renormalization framework.

Taken in its optimization sense, Gluon-MVR occupies a specific place in the recent theory of LMO-based training methods. It preserves Gluon’s layer-wise geometry, sharpens its non-convex theory from $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$23 to $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$24, improves the star-convex Muon rate to $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$25, and extends naturally to compressed federated training with explicit communication gains and weaker $$\min_{X \in \mathcal{S}} \left\{ f(X) := \mathbb{E}_{\xi \sim \mathcal{D}}\big[f_\xi(X)\big] \right\},$$26 conditions. Its significance lies in showing that the practical advantages associated with Muon-type non-Euclidean updates can be made compatible with modern variance-reduction methodology rather than treated as a separate optimization paradigm (Qian et al., 18 Dec 2025, Qian et al., 12 Apr 2026).