{'fraction_non_alphanumeric': 0.021718602455146365, 'fraction_numerical': 0.0, 'mean_word_length': 5.883116883116883, '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}}
Online discriminative learning: theory and applications

Online discriminative learning has been successfully applied to various speech and natural language processing tasks, including classification, parsing, translation and speech recognition/generation. In addition to their simplicity and scalability, online learning algorithms are natural tools in applications involving human-computer interaction, such as computer-assisted translation. In this talk we describe some of the most popular online learning algorithms, and mention their connection with the solution of convex optimization problems. In order to cope with problems where the human feedback comes at a cost, we also illustrate some simple techniques for designing online algorithms that work in semi-supervised mode (active learning). We then discuss the game-theoretic nature of online performance analysis, which explains the robustness to noise exhibited by these algorithms. Finally, we mention some of the latest research developments and future challenges in the online research domain.