mlsanityData to 14 Oct 2026

Learning Inference Concurrency in DynamicGate MLP Structural and Mathematical Justification

arXiv 2604.13546 ↗First posted 15 Apr 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Conventional neural networks strictly separate learning and inference because if parameters are updated during inference, outputs become unstable and even the inference function itself is not well defined [1, 2, 3]. This paper shows that DynamicGate MLP structurally permits learning inference concurrency [4, 5]. The key idea is to separate routing (gating) parameters from representation (prediction) parameters, so that the gate can be adapted online while inference stability is preserved, or weights can be selectively updated only within the inactive subspace [4, 5, 6, 7]. We mathematically formalize sufficient conditions for concurrency and show that even under asynchronous or partial updates, the inference output at each time step can always be interpreted as a forward computation of a valid model snapshot [8, 9, 10]. This suggests that DynamicGate MLP can serve as a practical foundation for online adaptive and on device learning systems [11, 12].

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 39 references that are in the map. First posted on arXiv 15 Apr 2026.

Builds on

21 of 39 references.

References · 21

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  2. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
  3. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  6. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
  7. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
  8. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 848
  9. 2022Continual Test-Time Domain Adaptationcited by 525
  10. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  11. 2022Efficient Test-Time Model Adaptation without Forgettingcited by 469
  12. 2023Towards Stable Test-Time Adaptation in Dynamic Wild Worldcited by 415
9 more
  1. 2021MEMO: Test Time Robustness via Adaptation and Augmentationcited by 377
  2. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
  3. 2016Revisiting Batch Normalization For Practical Domain Adaptationcited by 288
  4. 2022Test-Time Training with Masked Autoencoderscited by 212
  5. 2015Conditional Computation in Neural Networks for faster modelscited by 167
  6. 2023TTN: A Domain-Shift Aware Batch Normalization in Test-Time Adaptationcited by 101
  7. 2024C-TPT: Calibrated Test-Time Prompt Tuning for Vision-Language Models via Text Feature Dispersioncited by 83
  8. 2017Dynamic Evaluation of Neural Sequence Modelscited by 55
  9. 2024Test-Time Low Rank Adaptation via Confidence Maximization for Zero-Shot Generalization of Vision-Language Modelscited by 17

Built on by

Not cited yet.