{'fraction_non_alphanumeric': 0.019580419580419582, 'fraction_numerical': 0.0, 'mean_word_length': 4.821138211382114, '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}}
Kshirsagar-Type Lower Bounds for Mean Squared Error of Prediction

Let Y be an observable random vector and Z be an unobserved random variable with joint density f(y, z | θ), where θ is an unknown parameter vector. Considering the problem of predicting Z based on Y, we derive Kshirsagar type lower bounds for the mean squared error of any predictor of Z. These bounds do not require the regularity conditions of Bhattacharyya bounds and hence are more widely applicable. Moreover, the new bounds are shown to be sharper than the corresponding Bhattacharyya bounds. The conditions for attaining the new lower bounds are useful for easy derivation of best unbiased predictors, which we illustrate with some examples.