{'fraction_non_alphanumeric': 0.008912655971479501, 'fraction_numerical': 0.0, 'mean_word_length': 5.2444444444444445, '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}}
Saturation spaces for regularization methods in inverse problems

The aim of this article is to characterize the saturation spaces that appear in inverse problems. Such spaces are defined for a regularization method and the rate of convergence of the estimation part of the inverse problem depends on their definition. Here we prove that it is possible to define these spaces as regularity spaces, independent of the choice of the approximation method. Moreover, this intrinsec definition enables us to provide minimax rate of convergence under such assumptions