arXiv Machine Learning

Subspace Networks: Scaling Decentralized Training with Communication-Efficient Model Parallelism

arXiv:2506. 01260v3 Announce Type: replace Abstract: Scaling models has led to significant advancements in deep learning, but training these models in decentralized settings remains challenging due to communication bottlenecks.

arXiv Machine Learning
Jun 16

Mixtures of Subspaces for Bandwidth Efficient Context Parallel Training

arXiv:2606. 16384v1 Announce Type: new Abstract: Pretraining language models with extended context windows enhances their ability to leverage rich information during generation.

By Sameera Ramasinghe, Ajanthan Thalaiyasingam, Hadi Mohaghegh Dolatabadi, Gil Avraham, Violetta Shevchenko, Yan Zuo, Chamin Hewa Koneputugodage, Alexander Long
arXiv AI
Sep 2

A Mathematical Theory of Reusable Neural Bases for Network Compression

The paper introduces the Linear Reusable Neural Bases Architecture (LRNBA), a framework that represents each network block as a linear combination of shared neural bases to improve parameter efficiency and reduce memory cost. Inspired by recurrent neural network designs, LRNBA enables the construction of wider and deeper networks within the same parameter budget. Experiments show that models using LRNBA converge as fast or faster than classical architectures, achieve lower loss, and maintain stable training dynamics.

By Binshuai Wang
arXiv Machine Learning
Sep 15

Communication-Efficient LLM Adaptation over Decentralized GPU Meshes

The paper introduces a communication‑efficient method for adapting large language models on decentralized GPU meshes. It proposes an asynchronous two‑circuit system that uses fast compressed training with activation masking for pipeline‑parallel transfer and compressed data‑parallel synchronization, while a slower anchor circuit performs occasional unmasked passes. A spectral correction optimizer then denoises the masked gradients using these anchor priors, enabling high compression rates and achieving up to 40× throughput gains over internet‑grade connections while matching dense uncompressed performance.

By Sameera Ramasinghe, Shamane Siriwardhana, Thalaiyasingam Ajanthan, Hadi Mohaghegh Dolatabadi, Chamin P Hewa Koneputugodage, Gil Avraham, Violetta Shevchenko, James Snewin, Karol Pajak, Harry Xi, Alexander Long