arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.22979cs.AI
收藏

迈向基于Wi-Fi CSI的人体活动识别的因果可解释方法:离散潜在压缩与LTL规则提取

Towards Causally Interpretable Wi-Fi CSI-Based Human Activity Recognition with Discrete Latent Compression and LTL Rule Extraction

6 Ohio University, USA.\;4 U.S. Army DEVCOM Army Research Laboratory, USA.\;8 Cardiff University, UK.\;9 University of Southampton, UK.\;10 Imperial College London, UK.\
Luca Cotti, Luca Lavazza, Marco Cominelli, Liying Han, Gaofeng Dong, Francesco Gringoli, Mani B. Srivastava, Trevor Bihl, Erik P. Blasch, Daniel O. Brigham, Kar… 展开作者

Luca Cotti, Luca Lavazza, Marco Cominelli, Liying Han, Gaofeng Dong, Francesco Gringoli, Mani B. Srivastava, Trevor Bihl, Erik P. Blasch, Daniel O. Brigham, Kara Combs, Lance M. Kaplan, Federico Cerutti

AI总结:

本文提出一种结合离散潜在压缩与LTL规则提取的因果可解释方法,用于基于Wi-Fi CSI的人体活动识别,通过符号可控性和直接操作高维原始信号,实现确定性符号分类。

摘要:

我们针对利用Wi-Fi信道状态信息(CSI)进行人体活动识别(HAR)的问题,同时满足因果可解释性、符号可控性和直接操作高维原始信号的联合需求。深度神经网络模型在CSI基础HAR(CHAR)上表现出强大的预测性能,但依赖于连续潜在表示,这些表示是不透明且难以修改的;纯粹符号方法则无法处理原始CSI流。我们提出了一种完全自动且严格解耦的流程,其中CSI幅度窗口通过具有Gumbel-Softmax潜在变量的类别变分自编码器进行压缩,以满足容量控制的目标,从而得到紧凑的离散表示。然后将编码器冻结,并用作确定性映射到一维潜在轨迹。在这些轨迹上执行因果发现,以估计类条件时间依赖图。统计支持的滞后依赖性被翻译成线性时间逻辑(LTL)规则,产生一个完全符号化和确定性的分类器,仅基于规则评估和聚合,而没有任何学习的判别头。因为规则是在离散潜在变量上定义的,天线特定的规则集原则上可以在符号层面结合,从而实现结构化的多天线融合,而无需重新训练编码器。CHAR Latent Temporal Rule Extraction(CHARL-TRE)的结果表明,该方法在保持显式时间和因果结构的同时,表现出竞争性的性能,显示了基于无监督离散潜在表示的确定性符号分类作为无线HAR端到端黑盒模型的可行替代方案。

英文摘要:

We address Human Activity Recognition (HAR) utilizing Wi-Fi Channel State Information (CSI) under the joint requirements of causal interpretability, symbolic controllability, and direct operation on high-dimensional raw signals. Deep neural models achieve strong predictive performance on CSI-based HAR (CHAR), yet rely on continuous latent representations that are opaque and difficult to modify; purely symbolic approaches, in contrast, cannot process raw CSI streams. We propose a fully automatic and strictly decoupled pipeline in which CSI magnitude windows are compressed by a categorical variational autoencoder with Gumbel-Softmax latent variables under a capacity-controlled objective, yielding a compact discrete representation. The encoder is then frozen and used as a deterministic mapping to one-hot latent trajectories. Causal discovery is performed on these trajectories to estimate class-conditional temporal dependency graphs. Statistically supported lagged dependencies are translated into Linear Temporal Logic (LTL) rules, producing a fully symbolic and deterministic classifier based solely on rule evaluation and aggregation, without any learned discriminative head. Because rules are defined over discrete latent variables, antenna-specific rule sets can in principle be combined at the symbolic level, enabling structured multi-antenna fusion without retraining the encoder. Results from CHAR Latent Temporal Rule Extraction (CHARL-TRE) indicate competitive performance while preserving explicit temporal and causal structure, showing that deterministic symbolic classification grounded in unsupervised discrete latent representations constitutes a viable alternative to end-to-end black-box models for wireless HAR.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑