A predator-prey two-agent optimizer accelerates the post-memorization grokking phase by tens to a hundred times in gradient calls on modular arithmetic and MNIST, but still requires standard pre-training to memorization.
Control of Overfitting with Physics
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
While there are many works on the applications of machine learning, not so many of them are trying to understand the theoretical justifications to explain their efficiency. In this work, overfitting control (or generalization property) in machine learning is explained using analogies from physics and biology. For stochastic gradient Langevin dynamics, we show that the Eyring formula of kinetic theory allows to control overfitting in the algorithmic stability approach - when wide minima of the risk function with low free energy correspond to low overfitting. For the generative adversarial network (GAN) model, we establish an analogy between GAN and the predator-prey model in biology. An application of this analogy allows us to explain the selection of wide likelihood maxima and overfitting reduction for GANs.
citation-role summary
citation-polarity summary
fields
cs.NE 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Predator-Prey Model: Driven Hunt for Accelerated Grokking
A predator-prey two-agent optimizer accelerates the post-memorization grokking phase by tens to a hundred times in gradient calls on modular arithmetic and MNIST, but still requires standard pre-training to memorization.