Pith. sign in

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

arxiv 2212.14392 v1 pith:IA2J6TZJ submitted 2022-12-29 cs.LG cs.AIcs.NEstat.ML

classification cs.LGcs.AIcs.NEstat.ML
keywords metalearningoptimizationself-referentialalgorithmsexplicitneedneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Self-Improvements in Modern Agentic Systems: A Survey

    cs.AI 2026-07 conditional novelty 5.0 of 10

    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.

  2. Boundless Socratic Learning with Language Games

    cs.AI 2024-11 conditional novelty 5.0 of 10

    A position paper claiming recursive self-improvement in a closed language-only system can reach arbitrary capability, and proposing language games as the mechanism.

Pith tools