{'fraction_non_alphanumeric': 0.01639344262295082, 'fraction_numerical': 0.0, 'mean_word_length': 5.301587301587301, '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}}
Dominating and Admissible Mse-Bounds Using Saddle-Point Methods

We treat the problem of evaluating the performance of estimators for estimating a deterministic parameter vector x, with the mean-squared error (MSE) as the performance measure. Since the MSE depends on the unknown vector x, direct comparison between estimators is a difficult problem. Here we consider a framework for examining the MSE of different approaches based on the concepts of admissible and dominating estimators. Using a saddle-point framework we reduce these abstract concepts to a concrete convex optimization problem, which can then by analyzed by utilizing the machinery of convex optimization. Our development considers both the case of linear estimation in linear models as well as more general nonlinear models