REVIEW 2 cited by
Eliminating Meta Optimization Through Self-Referential Meta 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
read the original abstract
Meta Learning automates the search for learning algorithms. At the same time, it creates a dependency on human engineering on the meta-level, where meta learning algorithms need to be designed. In this paper, we investigate self-referential meta learning systems that modify themselves without the need for explicit meta optimization. We discuss the relationship of such systems to in-context and memory-based meta learning and show that self-referential neural networks require functionality to be reused in the form of parameter sharing. Finally, we propose fitness monotonic execution (FME), a simple approach to avoid explicit meta optimization. A neural network self-modifies to solve bandit and classic control tasks, improves its self-modifications, and learns how to learn, purely by assigning more computational resources to better performing solutions.
Forward citations
Cited by 2 Pith papers
-
Self-Improvements in Modern Agentic Systems: A Survey
Self-improving agents are classified by what they update — foundation-model weights or the surrounding scaffold — and by the signal that drives the update, under a single formal operator.
-
Boundless Socratic Learning with Language Games
A position paper claiming recursive self-improvement in a closed language-only system can reach arbitrary capability, and proposing language games as the mechanism.
Discussion (0). Continue with ORCID to comment.