{'fraction_non_alphanumeric': 0.012958963282937365, 'fraction_numerical': 0.0021598272138228943, 'mean_word_length': 4.904458598726115, '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}}
Rademacher complexity bound for domain adaptation regression

Domain adaptation problems arise when the data distribution in test domain is different from that in training domain. In this paper, we provide a new error bound for the domain adaptive regression problem. Inspired by the original ideas in 0-1 classification, firstly, an error bound with a large amount of samples of source domain can be got in a new scene of regression. In the process, we utilize the covering number and Rademacher complexity respectively. Then we combine the error bound of source domain by Rademacher complexity with the divergence distance to get a new learning bound in regression. Using the thought and framework in classification to deal with error bound problems in regression is the key ideas, it opens the door to tackling domain adaptation tasks by making full use of the Rademacher complexity tools in the new scenario of regression.