Skip to content

Structuring Relations Among Learning Paradigms via Protocol--Objective--Resource Reductions

Sep 2026 · 0 citations · 62 references
Computer Science

TL;DR

This work introduces a protocol-objective-resource (POR) framework that provides a unified language for structuring learning paradigms and transferring complexity guarantees across them and derives a non-exact episode-to-example reduction for episodic meta-learning.

Abstract

Modern machine learning spans supervised, transfer, continual, meta-learning, and related regimes that often reuse the same hypothesis classes, architectures, and optimizers but differ in information access, objectives, memory, adaptation, and sample accounting. This makes it difficult to determine whether one paradigm is genuinely distinct, a special case of another, or part of a broader structural hierarchy. We introduce a protocol-objective-resource (POR) framework that separates representational capacity from these design choices. A paradigm is specified by an environment class, observation protocol, admissible learners, performance functional, and resource accounting rule. POR reductions combine environment embeddings, learner compilers, threshold maps, and calibrated resource overheads. Our main theorem shows that such reductions imply worst-case complexity domination on embedded comparison classes, transferring upper bounds forward and lower bounds backward; under labeled-example accounting, this yields sample complexity domination. We also show that calibrated nontrivial accuracy regimes are necessary to avoid vacuous comparisons, and that strengthening the objective can strictly increase minimax sample complexity even with unchanged protocols and learner classes. Instantiating the framework for supervised, transfer, continual, and meta-learning yields canonical special-case relations: continual contains transfer, transfer contains supervised, and meta-learning contains supervised under aligned raw-example accounting. We further derive a non-exact episode-to-example reduction for episodic meta-learning and capture within-paradigm refinements such as replay memory and task identifiers. The framework thus provides a unified language for structuring learning paradigms and transferring complexity guarantees across them.

View source

Similar papers

Preprint Oct 2026

Do Knowledge and Reasoning Oriented Benchmarks Induce Stable Representation Signatures in LLMs?

Internal signatures could support monitoring, adaptive computation, and mechanistic analysis, but benchmark prompts can be separable without any shared computational distinction. We test whether a prespecified knowledge/reasoning label defines a reusable internal signature in five contemporary 7B to 31B models. We trea...

Parsa Rahimi, Azim Dehghani Amirabad · 0 citations
Preprint Oct 2026

WEAVE: Weaving Real-World Code Evolution into Dependency-Structured Tasks for Benchmarking and Training Code Agents

Real-world software engineering rarely consists of isolated changes. Features, migrations, and systematic fixes often unfold across multiple pull requests (PRs), requiring coordinated modifications across a repository. Yet most executable repository-level benchmarks retain a single issue or PR as the task unit, while e...

Wei-Hao Li, Zi-Hang Xu, Zhong-Qiu Wang et al. · 3 citations
#machine learning Preprint Oct 2026

A Systematic Study of Small Language Models on Abstract Reasoning Tasks

Endpoint accuracy on abstract-reasoning benchmarks does not reveal whether a language model has acquired a transferable rule or fit distribution-specific regularities. We study this distinction in small language models on the ARC-TGI benchmark, which organizes abstract grid transformations into controllable task famili...

Nur A. Zarin Nishat, Jens Lehmann, Andrei C. Aioanei et al. · 0 citations
Preprint Nov 2026

Library of Layers (LoL): Adaptively Ordering Transformer Layers at Runtime

Computer programmers chain together the same reusable computational primitives, for example, conditional statements or loops, but in different orders to implement different algorithms. In contrast, existing language model architectures always execute their layers in the same order. We introduce Library of Layers (LoL),...

Abdellah Rahmani, Sean McLeish, Ang Li et al. · 0 citations

The Geometry of Logic: Stratification Induces Semantic Structure and Robust Reasoning

STRAT is introduced, which partitions the residual stream into orthogonal Data and Type subspaces and uses Type-based attention and gating to govern Data transformations and in arithmetic, STRAT reduces median OOD error 35-fold relative to a Transformer baseline.

Cristina V. Lopes, Yuan-Gang Li, Justin Tian Jin Chen et al. · 0 citations

Related blog posts

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.