{'fraction_non_alphanumeric': 0.025525525525525526, 'fraction_numerical': 0.0, 'mean_word_length': 4.872246696035242, '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}}
The MC-ELM: Learning an ELM-like network with minimum VC dimension

Though the Extreme Learning Machine (ELM) has become quite popular in recent years, there are no performance guarantees; the resultant networks also tend to be densely connected. The complexity of a learning machine may be measured by the Vapnik-Chervonenkis (VC) dimension, and a small VC dimension leads to good generalization and lower test set errors. The Minimal Complexity Machine (MCM), that has been proposed very recently, shows that it is possible to learn a classifier with minimal VC dimension, leading to sparse representations and good generalization. In this paper, we draw on results from the MCM to propose a hybrid variant of the ELM, termed the Minimal Complexity - Extreme Learning Machine (MC-ELM), in order to realize a robust classifier that minimizes an exact bound on the VC dimension. The MC-ELM solves a linear programming problem for the last layer and offers the advantages of large margin and low VC dimension. In effect, the learning paradigm elucidated in this paper helps us build a classifier which is based on a minimal representation of the training data owing to MCM, and high training speed attributed to ELM. This makes it feasible for use in complex machine learning applications, where these advantages are of significance.