Time-series Random Process Complexity Ranking Using a Bound on Conditional Differential Entropy
利用条件微分熵上界排序时间序列随机过程复杂度
Conditional differential entropy provides an intuitive measure for relatively ranking time-series complexity by quantifying uncertainty in future observations given past context. However, its direct computation for high-dimensional processes from unknown distributions is often intractable. This paper builds on the information theoretic prediction error bounds established by Fang et al. \cite{fang2019generic}, which demonstrate that the conditional differential entropy…