跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1151新增论文
+896其中 AI 相关
+86已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-06 22:43 · 全站最近入库:2026-11-06 13:12各信源进度 →

统计口径与数据新鲜度

统计 2026-11-05 23:28 — 2026-11-06 23:28(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-06 22:43最近发现新增版本:2026-11-06 13:12库内论文最新更新时间:2026-11-06 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

17,100 已收录论文14,661 AI 相关4,055 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-06 22:38(北京时间)
新论文 · v1arXiv:2610.34532

Multi-view Semantic-aware Resource Allocation for Edge AI

Jiawei Luo, Hussein Saleh, Mohamad Assaad

Semantic communication is emerging as a pivotal paradigm to overcome wireless resource scarcity in 6G networks. This paper proposes a novel end-to-end framework for semantics-aware resource allocation in multi-user Edge AI. We extend the Opportunistic Information Bottleneck (OIB) to a multi-view setting, termed the Multi-view Gaussian Information Bottleneck (MGIB), by fusing complementary source views without variational approximation or network retraining. A resource allocation framework is then formulated for joint compression-level selection, transmission mode selection (i.e., the number of active sources per group), and PRB assignment. The problem is formulated as a Mixed-Integer Linear Program (MILP), solved efficiently via a proposed Lagrangian Relaxation (LR) algorithm, and benchmarked against the NP-hard optimal solution. Simulations demonstrate that the proposed LR scheme achieves near-optimal utility, and doubles PRB efficiency versus average allocation.

尚无 AI 解读,展示原文摘要

cs.IT · cs.LG · eess.SP
arXiv ↗PDF ↗