{'fraction_non_alphanumeric': 0.0236013986013986, 'fraction_numerical': 0.0, 'mean_word_length': 5.897590361445783, '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}}
Minimum Classification Error training employing Real-Coded Genetic Algorithms

One of the recent popular discriminative training methods, Minimum Classification Error (MCE) training, aims at efficiently developing high-performance classifiers through the minimization of smooth (differentiable in classifier parameters) classification error count loss. The smoothness enables one to use handy gradient-based minimization methods such as the probabilistic descent method. However, the gradient-based methods do not guarantee global minimization; what they pursue is basically local minimization. This locality may hinder one in exploring the achievable performance of the MCE training. To alleviate this problem, we apply one of the global optimization methods, Real-Coded Genetic Algorithms (RCGA), to the MCE training, and investigate its effectiveness experimentally. From the results, we show that the effects of the RCGA-based MCE training are limited and the conventional MCE training using the probabilistic descent method is better suited to classifier development based on the minimization of the smooth classification error count loss.