Speculative Decoding (SD) accelerates large language model inference by allowing a lightweight draft model to propose tokens that are subsequently verified in parallel by a larger target model. Recent approaches introduce lossy verification schemes to further improve efficiency by relaxing strict distributional matching. Yet such relaxation silently rewrites the decoding distribution, and the resulting acceleration can come at the cost of unstable, sometimes severely degraded generation quality. In this work, we present a principled analysis of the distributions induced by lossy verification methods. We show that many seemingly distinct approaches differ only superficially and can be classified into two categories: truncation-based verification and collaborative verification. We further construct a diagnostic evaluation framework across curated benchmarks. For truncation-based methods, we identify a fundamental pitfall: performance can degrade significantly compared to the true truncation sampling baseline due to distributional distortion. For collaborative verification, we uncover a key principles: controlling the overshoot of draft probabilities relative to target probabilities is essential to prevent low-quality outputs. Our code is available at https://github.com/ZhouYuxuanYX/Fast-HSD.
Tianyu Wang, Yuxuan Zhou, Wenbin Wang et al.· 0 citations
The heterogeneous nature has been regarded as a predominant challenge during the deployment of federated learning (FL) systems, wherein model heterogeneity—where clients train models of fundamentally different architectures—remains underexplored. Existing methods tolerate it poorly: they enforce interdependent model families, extract sub-models of one shared model, or rely on auxiliary public datasets and proxy models, which constrain model selection or demand storage that resource-limited clients cannot afford. We posit that an effective bridge across heterogeneous models should be both model-agnostic—decoupling knowledge transfer from incompatible parameter spaces—and storage-free, staying practical for clients with sharply different resources. On this basis we propose FedGPA, a hierarchical framework in which clients with comparable resources and identical architectures form a group and a server mediates knowledge transfer across groups of diverse models; at its core, the lightweight, model-agnostic Aligned Co-decision (Alco) Unit aligns class-level prototypical information across groups to bridge heterogeneous architectures, and a prototypical fusion step interpolates prototypes to regularize local training and refine cross-group knowledge. Experiments on CIFAR-10/100, EMNIST, and Tiny-ImageNet across heterogeneous architectures show that FedGPA consistently outperforms strong baselines from four method families, with the largest gains on resource-poor clients, at a cost of only ~100 KB of additional cross-group communication per round. A limitation of this study is that we provide no formal differential-privacy guarantee for the exchanged prototypes and do not address adversarial or data-quality attacks, leaving both to future work.
Liyinglan Liu, Zikai Xiao, Zihan Chen et al.· Journal of Machine Learning...· 0 citations
Experiments on long-horizon embodied and web-agent benchmarks show that MemPrism consistently improves the task performance, especially as trajectories become longer, while reducing memory token consumption.
Zhisheng Chen, Bingfan Zeng, Bangde Cao et al.· 0 citations