REVIEW 5 cited by
The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
No free lunch theorems for supervised learning state that no learner can solve all problems or that all learners achieve exactly the same accuracy on average over a uniform distribution on learning problems. Accordingly, these theorems are often referenced in support of the notion that individual problems require specially tailored inductive biases. While virtually all uniformly sampled datasets have high complexity, real-world problems disproportionately generate low-complexity data, and we argue that neural network models share this same preference, formalized using Kolmogorov complexity. Notably, we show that architectures designed for a particular domain, such as computer vision, can compress datasets on a variety of seemingly unrelated domains. Our experiments show that pre-trained and even randomly initialized language models prefer to generate low-complexity sequences. Whereas no free lunch theorems seemingly indicate that individual problems require specialized learners, we explain how tasks that often require human intervention such as picking an appropriately sized model when labeled data is scarce or plentiful can be automated into a single learning algorithm. These observations justify the trend in deep learning of unifying seemingly disparate problems with an increasingly small set of machine learning models.
Forward citations
Cited by 5 Pith papers
-
Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks
Learned replacement non-linearities show transformers are rarely optimal for algorithmic tasks, with benefits that are task-specific, while language/code gains are smaller and more transferable.
-
A Group Theoretic Analysis of the Symmetries Underlying Base Addition and Their Learnability by Neural Networks
For bases 3-5, the structural complexity of a base-addition carry rule (fractal dimension, carry frequency, associativity) strongly predicts whether a tiny recurrent network can learn it and generalize from 3-digit to...
-
The Complexity Dynamics of Grokking
A compression-based complexity measure reveals a rise-and-fall complexity phase transition during grokking, and a spectral entropy regularizer makes networks reach the low-complexity generalizing phase.
-
Universal pre-training by iterated random computation
Pre-training a transformer on data generated by randomly initialized LSTMs yields zero-shot in-context learning on several held-out datasets, with gains that improve with scale and faster finetuning.
-
Are We Ready for AI-Driven Discovery? AI Verification Before the Next Fundamental Physics Breakthrough
Verification of ML in fundamental physics is essential precisely when models enter statistical modeling, inference, or hypothesis testing, and is bounded by unavoidable inductive bias, sample complexity, and experimen...
Discussion (0). Continue with ORCID to comment.