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

arXiv cs.AI / 4/28/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes a Wi‑Fi CSI–based human activity recognition framework that aims for causal interpretability, symbolic controllability, and the ability to operate directly on high-dimensional raw CSI signals.
  • It compresses CSI magnitude windows into a compact discrete representation using a categorical variational autoencoder with Gumbel‑Softmax latents, then freezes the encoder to produce deterministic one-hot latent trajectories.
  • The method applies causal discovery to these discrete latent trajectories to infer class-conditional temporal dependency graphs and converts statistically supported lag relationships into Linear Temporal Logic (LTL) rules.
  • Classification is then performed purely by deterministic symbolic rule evaluation and aggregation, avoiding any learned discriminative head and preserving explicit temporal/causal structure.
  • The authors report competitive performance for their CHAR Latent Temporal Rule Extraction (CHARL‑TRE) approach and argue it supports structured multi-antenna fusion by combining antenna-specific rule sets at the symbolic level.

Abstract

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.