Meta-Learning

Meta-learning frames adaptation itself as an optimization objective: rather than learning to perform a single task, the model learns an initialization, metric space, or learning procedure that enables rapid generalization to new tasks from minimal data (Task Distribution) ^{[63, 87]}. Its D3 (Data Requirements) coordinate is the defining characteristic: instead of a labeled dataset for one task, meta-learning requires a diverse distribution of training tasks—a data-provenance structure qualitatively different from the task-specific corpora of Full FT (Large Labeled) or PEFT (Small Labeled). Its D6 (Model Type) ceiling at DL, FM encodes a significant structural observation within the taxonomy: at the LLM tier, ICL has architecturally supplanted gradient-based meta-learning as the primary mechanism for rapid few-shot adaptation. The supersession is mechanistically grounded: LLM contain sufficiently rich pre-trained representations that few-shot task generalization can occur through in-context conditioning (Context Injection, Session-Ephemeral) rather than through expensive parametric optimization (Parametric Update, Ad-hoc Permanent, Scheduled Permanent). This supersession relationship dictates that system engineers deploying LLM should route rapid adaptation requirements through prompt-level ICL architectures, reserving formal meta-learning pipelines exclusively for DL and early FM deployments. The D4 (Persistence) coordinate is counterintuitive for a technique framed around adaptability: meta-learning produces a permanent parametric modification (Ad-hoc Permanent, Scheduled Permanent)—not a transient or session-ephemeral one. This means meta-learning demands the same rigorous full-system regression testing and baseline validation protocols as any standard training event, structurally distinct from ICL's zero-artifact execution. Meta-learning requires that the task distribution used for outer-loop training be fully documented as the primary provenance record; the diversity and coverage of this task distribution directly determines the generalization bounds of the resulting meta-initialization, and any modification to the task distribution constitutes a change event requiring re-validation of the adaptation baseline.