{'fraction_non_alphanumeric': 0.020064205457463884, 'fraction_numerical': 0.0, 'mean_word_length': 5.461139896373057, '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}}
Meta-Learning through Coupled Optimization in Reproducing Kernel Hilbert Spaces

In this paper we consider a problem known as meta-learning, consisting of building policies that achieve good generalization performance and adapt quickly to different tasks. In our novel formulation, which we denote by cross-learning, we introduce meta-learning through the coupled optimization of a set of rewards that are defined for different tasks. This coupling is effected by a projection step that brings the task-specific policies close to a central one which combines the information collected across tasks. Since such a projection is computationally expensive, we derive a relaxed version that can be obtained in closed-form through a geometric rule. While our initial cross-learning formulation is widely general, and connects with state-of-the art strategies, we specialize it for the case of reinforcement learning. In particular, we search for continuous policies in reproducing kernel Hilbert spaces, which are considered in order to avoid discretization and bypass parametric models. Preliminary numerical experiments performed on the classical cartpole system corroborate that the cross-learned control policy performs well in different scenarios.