splitLLM, a novel zero-installation system that partitions autoregressive LLM inference between a WebGPU browser client and remote server, maintaining a key–value cache on both sides of the partition, offers a promising platform for enhancing the accessibility of LLMs, especially for resource-constrained client devices.
Abstract
On-device inference of large language models (LLMs) preserves user privacy and eliminates per-query server costs. However, weak client devices cannot run full models locally, and complete offloading negates the benefits of on-device inference. This study introduces SplitLLM, a novel zero-installation system that partitions autoregressive LLM inference between a WebGPU browser client and remote server, maintaining a key–value cache on both sides of the partition. The influence of the client device, model, split point, and network on the throughput is systematically evaluated. The results show that the optimal split point depends on the client device, whereas the per-token round trip time is invariant to the split point. This explains why adapting the split point to the network conditions yields no communication benefit, providing support for a lightweight placement rule that requires no trial offloading. The transmitted hidden state is compressed to 8 bits using static, offline-calibrated per-channel scales shared between the client and server, reducing the payload by half while keeping perplexity within 0–7% of full precision. In contrast, per-tensor quantization inflates perplexity by several orders of magnitude at intermediate split points. Under bandwidth-constrained conditions, the proposed compression speeds up decode and prefill by 1.7– $2.6\times $ and 2.4– $2.9\times $ , respectively. Overall, this work offers a promising platform for enhancing the accessibility of LLMs, especially for resource-constrained client devices.
System is presented, a reference-aware codec that retrieves exact-token historical spans for prefill uplinks, reuses the reconstructed uplink state for same-round prefill downlinks, and generates boundary-specific decode references with lightweight causal predictors.
Guo-Tao Yang, Ming-Ze Zhao, Hao-Peng Li et al.· 0 citations
This work addresses leakage through a learned obfuscate-and-recover scheme that protects participants' private datasets while still allowing an independently deployable model to be trained on the server side, making split-based federated LLM fine-tuning practically viable.
Heng Jin, Chao-Yu Zhang, He-Xuan Yu et al.· 1 citation
Large language model (LLM) inference is often constrained by both computation and memory, especially in offloading-based deployments where model weights are transferred across memory hierarchies during autoregressive decoding. In this setting, reducing the number of executed layers can lower per-token latency while als...
A residual-stream covert-channel attack is introduced that maps messages to codewords and injects them into an intermediate residual stream through a compromised runtime hook and is scaled with the local residual norm using the signal-to-residual-norm ratio.
Ming-Yuan Li, Yan-Na Jiang, Guang-Sheng Yu et al.· 0 citations
L-shaped SFT is presented, a split fine-tuning framework that removes the need for continuous client participation and introduces one-shot SFT, in which clients upload activations once and then go offline while the server continues optimization over cached representations.
This study identifies the “sweet spot” for local and restricted-resource AI deployment, proving that aggressive quantization of SLMs enables real-time, scalable AI performance on general-purpose hardware without the necessity for dedicated GPU acceleration.
J. Sciammarelli· 2026 IEEE Colombian Conferen...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.