In plain words: Training a network on one simple formal language, the study checks whether the mathematically correct rule is the best answer under usual training goals. It is not, even with weight penalties or dropout, but rewarding the shortest description of the data makes it the optimum.
Abstract · Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length
Neural networks offer good approximation to many tasks but consistently fail to reach perfect generalization, even when theoretical work shows that such perfect solutions can be expressed by certain architectures. Using the task of formal language learning, we focus on one simple formal language and show that the theoretically correct solution is in fact not an optimum of commonly used objectives -- even with regularization techniques that according to common wisdom should lead to simple weights and good generalization (L1, L2) or other meta-heuristics (early-stopping, dropout). On the other hand, replacing standard targets with the Minimum Description Length objective (MDL) results in the correct solution being an optimum.
Nur Lan, Emmanuel Chemla, Roni Katzir
arXiv:2402.10013 · cs.CL, cs.FL · submitted Feb 15, 2024 · updated Jun 6, 2024
abstract · pdf · html · 9 pages, 5 figures, 3 appendix pages
The LSTM architecture does permit a correct, 'general' solution to exist, and the authors show that the general solution is an optimum when using a minimum-description-length error function. The MDL error function is effectively entropy(weights) + relative entropy(training data | model).
The researcher's problem is that entropy(weights) is not well-defined. To prevent the network from "smuggling" information through highly precise but otherwise random-looking weights, they define an entropy (coding length) that rewards simple rational fractions (1/2, 3/4, 7/11) and penalizes complex ones (715/937). With this loss function, their hand-crafted optimal solution also lies at a loss-optimum.
Unfortunately, the resulting loss space is non-differentiable, making it useless for any gradient-descent-like training.
To muse about this, the authors' problem of weight entropy here is similar to the problem faced by autoencoders, whereby they want to have a minimally-structured latent space to avoid the same information-smuggling problem. Perhaps we could evolve a differentiable version of the model-entropy loss function by treating the model weights as random variables, drawn from a distribution of learned mean and variance with the same 'reparameterization trick' that makes variational autoencoders work. The model entropy loss term is then the same as the latent-space regularization term in VAE training.