{'fraction_non_alphanumeric': 0.022546419098143235, 'fraction_numerical': 0.0, 'mean_word_length': 5.291666666666667, '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}}
Deep Learning for Bipartite Assignment Problems*

Many assignment problems cannot be solved to optimality in real-time. The existing literature tends to focus on the development of handcrafted heuristics that exploit the structure of a particular assignment problem. We instead seek a general-purpose approach that can automatically learn such heuristics. In this work, we present a deep learning approach that is designed to automatically learn heuristics for a large class of assignment problems. We demonstrate the effectiveness of our approach on the weapon-target assignment (WTA) problem, which is nonlinear and NP-complete. We take non-trivial WTA problem instances and show that our approach reliably finds near-optimal solutions in milliseconds.