{'fraction_non_alphanumeric': 0.024205748865355523, 'fraction_numerical': 0.0, 'mean_word_length': 4.910714285714286, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Barankin Bound for Multiple Change-Point Estimation

We derive the Barankin bound on the mean-squared error for multiple change-point estimation of an independent measurement sequence. We first derive a general form of this bound and give the structure of the so-called Barankin information matrix (BIM). We show that the BIM for the change-point parameters has a tri-diagonal structure which means that one change-point estimation depends on its neighboring change points. Using this result, we propose a computationally efficient inversion algorithm of the BIM. As an illustration, we analyze the case of changes in the mean vector of a Gaussian distribution.