跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

采集已暂停
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+1新增 AI 导读

arXiv 最近完成扫描:等待完成 · 全站最近入库:2026-11-02 00:39各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:尚未完成最近发现新增版本:2026-11-02 00:39库内论文最新更新时间:2026-10-30 01:59

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

8,677 已收录论文7,675 AI 相关1,866 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。

找到 1 篇论文 · 按版本更新时间排序等待首次采集
新论文 · v1arXiv:2610.36905

Digital Twin-Guided Wireless Localization via Probabilistic Inverse Learning

Mahmoud Saad Abouamer, Henrik C. M. Frederiksen, Robin J. Williams, Shashi Raj Pandey, Petar Popovski

This work investigates how site-specific digital twins (DTs) can support wireless localization using simplified distributed infrastructure. We propose PRISM (Probabilistic Refinement using Inverse learning and a Site-specific Model), a DT-guided probabilistic localization scheme with single-antenna access points (APs). Localization is formulated as a probabilistic inverse problem in which a conditional proposal distribution over UE locations is learned from multi-node channel impulse responses (CIRs). The proposal generates candidate locations, with its spread regularized during training and DT consistency used to reweight candidates and refine the estimate at inference. The DT serves as an approximate forward-consistency model, avoiding assumptions of exact channel fidelity or differentiability with respect to user position. Numerical experiments demonstrate gains over data-driven and classical fingerprinting benchmarks, while achieving a median error of approximately $0.7$ m using 10 single-antenna APs. Without retraining, PRISM remains effective under degraded inference-time DT features. PRISM also yields uncertainty estimates from its proposal covariance, with empirical $χ^2$ calibration approaching ideal behavior as APs increase.

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

cs.IT · eess.SP
arXiv ↗PDF ↗