An Information-Theoretic Approach for Automatically Determining the Number of States when Aggregating Markov Chains

Abstract

A fundamental problem when aggregating Markov chains is the specification of the number of state groups. Too few state groups may fail to sufficiently capture the pertinent dynamics of the original, high-order Markov chain. Too many state groups may lead to a non-parsimonious, reduced-order Markov chain whose complexity rivals that of the original. In this paper, we show that an augmented value-of-information-based approach to aggregating Markov chains facilitates the determination of the number of state groups. The optimal state-group count coincides with the case where the complexity of the reduced-order chain is balanced against the mutual dependence between the original- and reduced-order chain dynamics.

arXiv commentSubmitted to IEEE ICASSP. arXiv admin note: substantial text overlap with arXiv:1903.09266

References in corpus (5)

• The information bottleneck method
• Guided Policy Exploration for Markov Decision Processes using an Uncertainty-Based Value-of-Information Criterion
• Optimal Kullback-Leibler Aggregation via Information Bottleneck
• Analysis of Agent Expertise in Ms. Pac-Man using Value-of-Information-based Policies
• An Analysis of the Value of Information when Exploring Stochastic, Discrete Multi-Armed Bandits

Cited by in corpus (1)

• On Determining and Qualifying the Number of Superstates in Aggregation of Markov Chains