InfoDPCCA combines a dynamic probabilistic CCA model with an information-bottleneck objective so the shared latent state is trained to contain only the mutual information of the two sequences and still predict the next observations.
Latent Representation and Simulation of Markov Processes via Time-Lagged Information Bottleneck
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Markov processes are widely used mathematical models for describing dynamic systems in various fields. However, accurately simulating large-scale systems at long time scales is computationally expensive due to the short time steps required for accurate integration. In this paper, we introduce an inference process that maps complex systems into a simplified representational space and models large jumps in time. To achieve this, we propose Time-lagged Information Bottleneck (T-IB), a principled objective rooted in information theory, which aims to capture relevant temporal features while discarding high-frequency information to simplify the simulation task and minimize the inference error. Our experiments demonstrate that T-IB learns information-optimal representations for accurately modeling the statistical properties and dynamics of the original process at a selected time lag, outperforming existing time-lagged dimensionality reduction methods.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
InfoDPCCA: Information-Theoretic Dynamic Probabilistic Canonical Correlation Analysis
InfoDPCCA combines a dynamic probabilistic CCA model with an information-bottleneck objective so the shared latent state is trained to contain only the mutual information of the two sequences and still predict the next observations.