Robotron

Engineering guide / Small models

A small model begins with a precise promise.

Give Robotron one decision that matters and happens often. We turn it into a compact TRM model, preserve the learned computation as Robotron IR, and execute it with an engine designed for the hardware where that decision belongs.

One use case TRM architecture GPT token interface Portable IR Target inference

The use case is the first piece of architecture.

A general model begins with a broad question: what might somebody ask? A Robotron model begins with a smaller one: what decision must this system make repeatedly? In content management, that may mean identifying a topic, recognizing a content type, choosing an editorial route, or deciding that a person should review the item.

Before choosing a network, we define the accepted input, exact output, cost of each error, confidence policy, and human fallback. Those choices determine the training examples, output head, evaluation metrics, and the amount of model worth carrying into production.

Small is not the objective by itself. Small becomes possible when the promise is precise enough to test.

TRM spends computation instead of storing excess capability.

Robotron uses the Tiny Recursive Model idea: a small learned block revisits the model state several times. A larger network carries many separate layers for every input. A recursive model carries less and can spend another pass refining the state when the input needs it.

GPT-style tokenization and causal prediction provide the language interface. They allow the model to read text and produce labels, JSON, commands, or short generated sequences without turning it into a general-purpose chatbot. TRM describes how the compact core computes; the GPT interface describes how language enters and leaves; the task contract defines a valid answer.

context ──→ shared TRM block ──→ state¹
              ↑                    ↓
              └──── refine ←── state² ←── state³
                                      ↓
                                task output

Recursive core

Repeated computation creates useful depth without storing a large stack of unrelated parameters.

Token interface

GPT-style tokens provide a practical language for text, structured records, labels, and commands.

Task output

The answer space is deliberately bounded so behavior can be evaluated thoroughly.

The useful examples live where categories almost touch.

Content management becomes difficult at the boundaries. A product announcement can resemble an explainer. A security update can use the language of a sales article. These near misses reveal what the editorial system actually means by a category, so we preserve them instead of allowing easy examples to dominate training.

Approved historical decisions become versioned training records. Authors, time periods, and near duplicates are separated before evaluation. The model is selected on the errors the workflow feels—not simply on average training loss. Reviewed production mistakes may become future examples, but raw traffic never teaches the model automatically.

Freeze the meaning. Keep the machinery replaceable.

Training ends with a PyTorch checkpoint, but a checkpoint is not yet a production contract. The exporter resolves the graph into supported operations and packages the tensors, tokenizer, labels, task metadata, limits, quantization, and integrity records as Robotron IR.

  1. 1
    Train in PyTorch

    Compare compact TRM configurations and select the smallest checkpoint that clears the task-quality threshold.

  2. 2
    Export Robotron IR

    Normalize the graph and bind weights, tokenizer, task identity, limits, and quantization into one versioned artifact.

  3. 3
    Prove parity

    Run fixed examples through PyTorch and IR, then compare outputs within explicit numerical and task tolerances.

  4. 4
    Load a target engine

    Validate the artifact, plan memory, and map every IR operation to an implementation supported by the destination.

PyTorch

Architecture, learning, experimentation, and checkpoint selection.

Robotron IR

The stable description of the learned computation and its task contract.

Inference engine

The implementation that turns IR operations into efficient work on one target.

Hardware may change speed, memory, and energy. It must not change what the model's answer means.

One model contract. Different execution paths.

The inference engine validates the IR, plans memory, and chooses an implementation for every operation. The application API and task semantics remain stable while the execution layer changes for the environment.

JavaScript + WASM

Portable backend integration with a long-lived engine kept behind the application API.

C on ARM

Native execution for devices where memory, power, and predictable latency are fixed.

CUDA

Parallel kernels when a service needs higher throughput or a larger working set.

Custom silicon

A target adapter maps IR operations to native instructions, memory layouts, and scheduling rules.

Same fixtures

Every engine is tested against the parity cases established during export.

Same task

Optimization can change representation, never the model contract or permitted output.

A content item becomes a bounded decision.

The application backend supplies a title and body. The model never receives database credentials or permission to publish. It returns a structured suggestion; ordinary application code decides whether confidence is sufficient, policy permits the route, or a person should review the result.

input    title + body
         ↓ tokenize
model    content-model.ir / classify()
         ↓ validate
output   topic       technology
         type        explainer
         route       ai-infrastructure
         confidence  0.94
         action      suggest

The workflow ships, not the benchmark.

A high validation score is necessary and incomplete. The exported artifact must agree with training, the target must meet its physical budget, and the service must know how to reject, defer, observe, and roll back.

  • Task quality: per-class precision and recall, boundary cases, calibration, and abstention quality.
  • Runtime parity: fixed outputs compared across PyTorch, IR, and every target engine.
  • System fit: median and tail latency, peak memory, startup time, throughput, artifact size, and energy.
  • Operational safety: immutable versions, bounded requests, useful telemetry, human fallback, and tested rollback.
The model is ready when the surrounding system knows when to trust it—and when not to.