pith. sign in

arxiv: 2505.24060 · v1 · pith:DMTG2XG7new · submitted 2025-05-29 · 💻 cs.LG · stat.ML

Characterising the Inductive Biases of Neural Networks on Boolean Data

classification 💻 cs.LG stat.ML
keywords featureinductivelearningnetworkstrainingbooleandynamicsgeneralisation
0
0 comments X
read the original abstract

Deep neural networks are renowned for their ability to generalise well across diverse tasks, even when heavily overparameterized. Existing works offer only partial explanations (for example, the NTK-based task-model alignment explanation neglects feature learning). Here, we provide an end-to-end, analytically tractable case study that links a network's inductive prior, its training dynamics including feature learning, and its eventual generalisation. Specifically, we exploit the one-to-one correspondence between depth-2 discrete fully connected networks and disjunctive normal form (DNF) formulas by training on Boolean functions. Under a Monte Carlo learning algorithm, our model exhibits predictable training dynamics and the emergence of interpretable features. This framework allows us to trace, in detail, how inductive bias and feature formation drive generalisation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.