REVIEW 3 cited by
Uncertainty-Aware Hybrid Inference with On-Device Small and Remote Large Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This paper studies a hybrid language model (HLM) architecture that integrates a small language model (SLM) operating on a mobile device with a large language model (LLM) hosted at the base station (BS) of a wireless network. The HLM token generation process follows the speculative inference principle: the SLM's vocabulary distribution is uploaded to the LLM, which either accepts or rejects it, with rejected tokens being resampled by the LLM. While this approach ensures alignment between the vocabulary distributions of the SLM and LLM, it suffers from low token throughput due to uplink transmission and the computation costs of running both language models. To address this, we propose a novel HLM structure coined Uncertainty-aware opportunistic HLM (U-HLM), wherein the SLM locally measures its output uncertainty and skips both uplink transmissions and LLM operations for tokens that are likely to be accepted. This opportunistic skipping is enabled by our empirical finding of a linear correlation between the SLM's uncertainty and the LLM's rejection probability. We analytically derive the uncertainty threshold and evaluate its expected risk of rejection. Simulations show that U-HLM reduces uplink transmissions and LLM computations by 45.93%, while achieving up to 97.54% of the LLM's inference accuracy and 2.54$\times$ faster token throughput than HLM without skipping.
Forward citations
Cited by 3 Pith papers
-
DSSD: Efficient Edge-Device LLM Deployment and Collaborative Inference via Distributed Split Speculative Decoding
DSSD moves the resample step of speculative decoding onto the device, replacing the upload of many token distributions with a single download when a draft is rejected.
-
Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search
SemPA-Look groups tokens into packets using a leave-one-out residual semantic score and a fixed-width lookahead search, matching near-optimal ATS at linear text-encoding complexity.
-
Prompting Wireless Networks: Reinforced In-Context Learning for Power Control
Prompting LLMs with a few reward-ranked state-action examples controls base station power at a level comparable to a trained DQN on a small simulated problem.
Discussion (0). Continue with ORCID to comment.