arXiv:2510.15620cs.LG2025-10被引 1

通过动态剪枝和流水执行,让设备端语义筛选更快更省内存。

On-device Semantic Selection Made Low Latency and Memory Efficient with Monolithic Forwarding

  • 基于候选集相对排序不变性,实现逐层渐进式剪枝。
  • 在0.6B到8B模型上,延迟降低最高达89.2%,内存峰值减少91.3%。
  • 无需训练,适合部署在手机、边缘设备的生成与推荐系统。

基于交叉编码器重排序的语义top-K选择支撑了设备端AI服务,如检索增强生成、智能体记忆和个性化推荐。但其延迟和内存开销占用了边缘硬件的端到端预算。我们重新审视top-K选择的目标,发现仅相对排序重要,而非具体得分。进一步观察到序列级稀疏性:中间层中相对排序逐渐稳定,可在完整推理前进行早期剪枝。基于此,我们提出统一前向机制,构建免训练推理系统PRISM。通过保持所有候选全局视图,实现渐进式聚簇剪枝以降低延迟;同时通过重叠层流与分块执行,策略性地重叠输入输出与计算,控制峰值内存。我们在Apple M2和RTX 5070上对0.6B至8B参数的重排序器进行了评估。PRISM在微基准测试中延迟最多降低89.2%,峰值内存最多减少91.3%,且不损失精度。在三个真实设备端AI应用中,延迟降低11.6%-51.0%,峰值内存减少18.6%-77.8%,显著提升效率与可部署性。

原文摘要 · Abstract (English)

Semantic top-K selection with cross-encoder rerankers underpins on-device AI services, such as retrieval-augmented generation, agent memory, and personalized recommendation. However, its latency and memory demands dominate end-to-end budgets on edge hardware. Revisiting the objective of top-K selection, we reveal that only relative rankings matter, not exact per-candidate scores. We further observe sequence-level sparsity: relative rankings progressively stabilize in intermediate layers, enabling early pruning prior to completing full inference. Building on this insight, we propose monolithic forwarding and develop a training-free inference system, PRISM. By maintaining a global view of all candidates, it reduces latency through progressive cluster pruning. It also bounds peak memory usage by strategically overlapping I/O with computation via overlapped layer streaming and chunked execution. We evaluate PRISM against state-of-the-art baselines on rerankers from 0.6 B to 8 B parameters across Apple M2 and RTX 5070. PRISM consistently reduces latency by up to 89.2% and peak memory by up to 91.3% in microbenchmarks, without compromising precision. Across three real-world on-device AI applications, PRISM lowers latency by 11.6%-51.0% and peak memory by 18.6%-77.8%, demonstrating substantial improvements in efficiency and deployability.

设备端推理高效剪枝内存优化语义筛选

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。