Fiber-MoE & Symplectic Gating: Principled Dynamic Expert Routing and Zero-Waste State Annihilation for Autonomous World Agents

Author: Thanakon Haunaong (ORCID: 0009-0004-4400-6452)
Organization: Autonomous Systems Research Laboratory
Affiliation: Independent Researcher / AI Systems Lab


📌 Abstract

Current Mixture-of-Experts (MoE) architectures and autoregressive world models suffer from three structural pathologies:

  1. Router Thrashing: Limit-cycle oscillation across heterogeneous expert domains on adjacent sequence tokens.
  2. Static Over-Allocation: Inflexible compute allocation ($K=8$ experts/token) on low-entropy boilerplate tokens.
  3. Epistemic World Drift: Compounding simulation errors over extended rollouts lacking conservative dynamical invariants.

In this work, we present SCE-Fiber, an energy-conserving control substrate for massive sparse models (demonstrated on 35B parameter scales with 128 physical experts). By restructuring flat expert topographies into eight semantic domain fibers and applying a critically damped Hamiltonian update ($\zeta = 1.0$), our framework eliminates oscillatory domain switching while reducing active parameters via dynamic Upper Confidence Bound (UCB) dead-work pruning.

Furthermore, we formulate an invariant world manifold that bounds simulated transitions via LaSalle-Lyapunov invariance ($V(x) = x^T P x$). Backed by a sub-microsecond CPython native kernel ($0.76 - 1.46\ \mu\text{s}$ latency), empirical benchmarks on an NVIDIA GeForce RTX 3090 demonstrate a 37.5% - 75% reduction in active FLOPs while preserving foundational baseline accuracy and providing instant zero-waste state caching.


🔬 Core Mathematical Formulation

1. Critically Damped Router Dynamics ($\zeta = 1.0$)

Router state trajectories follow a second-order critically damped system: z¨+2ωz˙+ω2z=ω2u\ddot{z} + 2\omega \dot{z} + \omega^2 z = \omega^2 u Enforcing critical damping ($\zeta = 1.0$) guarantees that router specialization converges to optimal domain allocations without overshoot or high-frequency thrashing.

2. Two-Stage Fiber-MoE Routing & Dynamic-K

We group $E = 128$ physical experts into $F = 8$ semantic domain fibers (Physics, Spatial, Temporal, Tool, Memory, Agent, Logic, Self-Correction). Routing occurs hierarchically with sequence uncertainty $U_t$ dynamically governing the active budget: Kt=Kmin⁡+⌈(Kmax⁡−Kmin⁡)⋅Ut⌉,Kt∈[2,8]K_t = K_{\min} + \left\lceil (K_{\max} - K_{\min}) \cdot U_t \right\rceil, \quad K_t \in [2, 8]

3. Dead-Work UCB Pruning & LaSalle-Lyapunov Invariance

Before executing expensive forward matrix multiplications, upper confidence bound estimation prunes redundant passes: UCBe=V^e+κσe<τuseful  ⟹  Annihilate Expert\text{UCB}_e = \hat{V}_e + \kappa \sigma_e < \tau_{\text{useful}} \implies \text{Annihilate Expert} Concurrently, environmental transitions are bounded on a conservative Lyapunov energy manifold: V(x)=xTPx,E[Vt+1−Vt]≤−ϵV(x) = x^T P x, \quad \mathbb{E}[V_{t+1} - V_t] \le -\epsilon


⚡ Empirical Hardware Benchmarks (NVIDIA RTX 3090)

The entire control manifold is implemented as an optimized C-Kernel (libsce_native.so) executed with zero Python GIL overhead:

Subsystem Iterations Latency Throughput
Holographic State Hash ($\Phi_h$) 100,000 0.97 $\mu$s / hash 1,030,624 op/s
UCB Dead-Work Pruner (128 Experts) 50,000 1.46 $\mu$s / pass 684,287 op/s
Symplectic Damped Step ($\zeta=1.0$) 50,000 1.15 $\mu$s / step 866,851 op/s
LaSalle-Lyapunov Manifold ($V(x)$) 50,000 0.76 $\mu$s / eval 1,317,523 op/s

📄 Full Paper & Assets

Citation

@article{haunaong2026fibermoe,
  title={Fiber-MoE & Symplectic Gating: Principled Dynamic Expert Routing and Zero-Waste State Annihilation for Autonomous World Agents},
  author={Haunaong, Thanakon},
  journal={Autonomous Systems Research Laboratory},
  year={2026},
  url={https://huggingface.co/papers}
}
Downloads last month

-

Downloads are not tracked for this model. How to track
Inference Providers NEW
This model isn't deployed by any Inference Provider. 🙋 Ask for provider support