Skip to page content
SAVRN
Search Plan a project

Open-weight model · Text generation

semsimula-ladder-owt-d384-l2-gpt2-matched

by Dimitar Gueorguiev dimitarpg13/semsimula-ladder-owt-d384-l2-gpt2-matched

semsimula-ladder-owt-d384-l2-gpt2-matched is an open-weight model for text generation from Dimitar Gueorguiev, released under Creative Commons Attribution 4.0. Its published files total 286.5 MB.

One arm of the SemSimula mechanism ladder — OpenWebText, d=384, L=2: five models that differ by exactly one mechanism each, so that every gap in the ordering prices one component by construction rather than by attribution.

Parameters—
Context—
Weights286.4 MB
Licensecc-by-4.0
AccessOpen weights
Monthly Downloads—

Model Card

By Dimitar Gueorguiev, published under cc-by-4.0, revision b92ef4b55c50.

One arm of the SemSimula mechanism ladder — OpenWebText, d=384, L=2: five models that differ by exactly one mechanism each, so that every gap in the ordering prices one component by construction rather than by attribution. Italic entries are pre-registered predictions, recorded before the run. The ordering is itself the prediction; any inversion is a result. Every arm above sees exactly 532,480,000 training tokens — 32,500 steps × 32 × 512 = 532,480,000 tokens — on the same corpus, tokenizer and validation batches. No arm is trained longer than another, so a gap in the table is a gap between mechanisms and never a difference in budget. The models below integrate a damped mechanical system…

Read Dimitar Gueorguiev's full model card

Matched GPT-2 baseline

One arm of the SemSimula mechanism ladder — OpenWebText, d=384, L=2: five models that differ by exactly one mechanism each, so that every gap in the ordering prices one component by construction rather than by attribution.

This arm removes: the reference architecture.

The ladder

arm mechanism removed settled PPL vs GPT-2
Matched GPT-2 baseline (this model) the reference architecture 49.81 1.000×
Fock-PARFLM, exchange field on (arm 'attention') the transformer itself 63.51 1.275×
Fock-PARFLM, exchange field as a potential (arm 'attention_potential') conservativity — the same ξ-routed attention, entering as a scalar potential so the force stays a gradient 80.90 1.624×
Fock-PARFLM, no exchange field (arm 'none') the exchange field 66.98 1.345×
Conservative-only control — the Fock mechanism off the Fock mechanism — the register-to-token path 87.93 1.765×
Multi-ξ SPLM — no Vφ, no Fock Vφ (the PARF pairwise potential) within 5% of 87.93 — near-zero Vφ effect (protocol 3.2) —
Fock-SPLM — no Vφ, Fock mechanism on Vφ, with the register-to-token path kept within 5% of 66.98 — near-zero Vφ effect (protocol 3.2) —

Italic entries are pre-registered predictions, recorded before the run. The ordering is itself the prediction; any inversion is a result.

Every arm above sees exactly 532,480,000 training tokens — 32,500 steps × 32 × 512 = 532,480,000 tokens — on the same corpus, tokenizer and validation batches. No arm is trained longer than another, so a gap in the table is a gap between mechanisms and never a difference in budget.

What each gap prices

gap prices value
Matched GPT-2 baseline → Fock-PARFLM, exchange field on what the transformer has that this architecture does not 13.70 PPL (+27.5%), measured
Fock-PARFLM, exchange field on → Fock-PARFLM, exchange field as a potential the price of conservativity 17.39 PPL (+27.4%), measured
Fock-PARFLM, exchange field as a potential → Fock-PARFLM, no exchange field the exchange field -13.92 PPL (+-17.2%), measured
Fock-PARFLM, no exchange field → Conservative-only control — the Fock mechanism off the Fock mechanism (the register-to-token path) 20.95 PPL (+31.3%), measured
Fock-PARFLM, no exchange field → Fock-SPLM — no Vφ, Fock mechanism on Vφ / PARF, with the register mechanism present pending
Conservative-only control — the Fock mechanism off → Multi-ξ SPLM — no Vφ, no Fock Vφ / PARF, without it — the 2×2's second reading pending
Fock-SPLM — no Vφ, Fock mechanism on → Multi-ξ SPLM — no Vφ, no Fock the Fock mechanism again, on a Vφ-free base (replication) pending

What the ladder is measuring

The models below integrate a damped mechanical system in semantic space. With the register mechanism on, the equation of motion carries a non-conservative term and is Lagrangian only in the Lagrange–d'Alembert sense:

$$m \ddot{h} = -\nabla V_\theta(h) - \gamma m \dot{h} + F_{\mathrm{rc}}(h, r) + F_\phi(h)$$

\(V_\theta\) is the pointwise scalar potential, \(V_\phi\) the pairwise one, and \(F_{\mathrm{rc}}\) the reverse channel through which the register bank acts on the token state. \(F_{\mathrm{rc}}\) is not the gradient of anything in \(h\), so it is the term that makes the trajectory non-geodesic; the damping \(-\gamma m \dot{h}\) is parallel to the velocity and changes only the speed along the path, never the path itself.

Setting \(F_{\mathrm{rc}} = 0\) (the none-norc arm) leaves every force a gradient, so \(V = V_\theta + V_\phi\) admits a Jacobi metric and the step is its damped geodesic step, up to the LayerNorm projection. That arm is the only fully conservative model in the collection, and the ladder prices what its geodesics cost.

This model

architecture GPT-2 decoder, d=384, L=8, 6 heads, d_ff=1536, tied embeddings
parameters 33,691,776
training tokens 532,480,000 — the same on every arm
learning rate 0.0006
settled PPL 49.81
best PPL 49.76 (step 32,500)
final PPL 49.76
ratio to matched GPT-2 1.000×
pre-registration below 54.59, point 49.5, band 49.0-50.0 — HIT, error +0.26
run health reference arm

Protocol

  • Corpus OpenWebText (GPT-2 BPE, 50,257); 32,500 steps × 32 × 512 = 532,480,000 tokens.
  • Settled PPL is the mean of the last three 500-step evals at block 512 — not the best checkpoint.
  • Shared across all arms: tokenizer, corpus, validation batches, width d=384, block 512, effective batch 32, token budget (532,480,000 tokens, identical on every arm), WSD schedule (warmup 5%, stable to 65%, decay to 100%, floor 6e-05).
  • Not shared: depth (GPT-2 L=8 vs Fock L=2) and the learning rate of the GPT-2 arm (6e-04, separately tuned).
  • Full protocol, pre-registered bands and run health: Depth_Ladder_and_Matched_Baseline_Protocol.md §5.4.

Reproduction

Set in Cell 0 of colab_fock_cfc_baoab_lowrank_depth_ladder_openwebtext_d384.ipynb and run Cell 0 → 1 → 1b → 1c → 1d → 2 → 3 → 4 → 5 → 5b → 6:

separate notebook: colab_matched_gpt2_baseline_openwebtext.ipynb

Training artefacts were written to semsimula_matched_gpt2_baseline_owt/.

Files

path what
README.md this card
config.json architecture, training and result, machine-readable
checkpoints/*_best.pt weights at the best eval
checkpoints/*_step25000.pt an intermediate checkpoint; see the note below
results/training_log.jsonl per-eval record; the settled PPL above is the mean of its last three rows
results/*_training_output.txt the full run log, including per-step diagnostics
results/gpt2_baseline_summary.json end-of-run summary; read NOTE_summary_json_fock_fields.md beside it first
code/ everything needed to reproduce the run, below

The code, and why this subset

code/ mirrors the layout of the companion repository, so the notebook's own sys.path lines resolve unchanged.

path what
code/colab_matched_gpt2_baseline_openwebtext.ipynb the whole run. Self-contained: the model is defined in Cell 3 and nothing is imported from the companion repository

Caveats

  • This is a reference, not a tuned transformer. It exists to give the ladder a scale, and it is the only arm whose learning rate was tuned separately (6e-04). Read it as "what a conventional architecture reaches on this budget", not as a claim about GPT-2.
  • Depth is not matched. L=8 here against L=2 on every Fock arm. The ratio column elsewhere in the collection is for orientation, not a like-for-like efficiency claim.
  • The second checkpoint is not the same kind as the other arms'. The Fock arms each ship step 500, essentially untrained. This arm has no step-500 checkpoint; its second file is step 25,000 at PPL 52.87, already within 6% of the endpoint. Do not read a cross-arm comparison of "first" checkpoints as like-for-like.
  • gpt2_baseline_summary.json carries a stale cross-reference. Its fock_* fields and ratio_fock_to_gpt2_settled are not a ladder arm: the file was written before any L=2 arm existed and those numbers come from a pre-ladder L=8 run read mid-schedule. The GPT-2 fields in it are correct. NOTE_summary_json_fock_fields.md sits beside it.
  • OpenWebText only.

Citation

@techreport{Gueorguiev2026SemanticSimulation,
  author = {Gueorguiev, Dimitar P.},
  title  = {Semantic Simulation: A Prescriptive Lagrangian Framework for Semantic Inference},
  note   = {Conservative Potentials, Non-Conservative Memory, and the Shared-Potential Separator},
  year   = {2026}
}

Card generated from _ladder/ladder.json on 2026-09-27.

Configuration

Vocabulary size
50,257

Identity and Version

Repository
dimitarpg13/semsimula-ladder-owt-d384-l2-gpt2-matched
Publisher
Dimitar Gueorguiev
Task
Text generation
Modality
Text
Library
pytorch
Parameters
Not stated by the source
Languages
en
Revision
b92ef4b55c50d976ce63fd1adbf183861c836785
First published
2026-09-28
Last updated
2026-09-28

Files and Weights

10 files, 286.5 MB in total. The weights are 2 files totalling 286.4 MB in pt.

Weights2 files · 286.4 MB
Configuration2 files · 2.0 KB
Documentation2 files · 11.0 KB
Other3 files · 102.1 KB
Repository1 file · 1.5 KB
Every file
FileTypeSizeSHA-256
checkpoints/gpt2_baseline_best.ptWeights143.2 MB 0839f0b9105d
checkpoints/gpt2_baseline_step25000.ptWeights143.2 MB e85dc7e98e63
config.jsonConfiguration1.4 KB —
results/gpt2_baseline_summary.jsonConfiguration655 B —
README.mdDocumentation9.5 KB —
results/NOTE_summary_json_fock_fields.mdDocumentation1.6 KB —
code/colab_matched_gpt2_baseline_openwebtext.ipynbOther38.6 KB —
results/matched_gpt2_training_output.txtOther23.7 KB —
results/training_log.jsonlOther39.8 KB —
.gitattributesRepository1.5 KB —

License and Download

License
cc-by-4.0
Access
Open weights, no gate
Download size
286.4 MB
Download from Dimitar Gueorguiev

Released by Dimitar Gueorguiev through its official repository on Hugging Face. Read the license.

Built From

  • Trained on (disclosed) Skylion007/openwebtext

Evaluations

Each result is shown as reported, with the conditions its reporter stated. None is a SAVRN measurement. A comparison lines two results up only when their configuration, unit and setup are all stated and identical.

BenchmarkConditionsResultReported byRevisionDate
OpenWebText Task text-generationMetric Validation perplexity at block 512, settled (mean of the…Comparison conditions not established 49.81 dimitarpg13
Publisher reported
Evaluated revision not stated —

Memory Requirements

PrecisionWeights in memory
As published286.4 MB

Weights only, from the published parameter count; the key-value cache and runtime add to this.

Questions About semsimula-ladder-owt-d384-l2-gpt2-matched

Can I use semsimula-ladder-owt-d384-l2-gpt2-matched commercially?

Yes. semsimula-ladder-owt-d384-l2-gpt2-matched is released under Creative Commons Attribution 4.0. CC BY 4.0 permits sharing and adapting the work, including commercially, provided the creator is credited and changes are indicated.

Similar Models

Model · Text generation

opt-125m

AI at Meta

OPT was first introduced in Open Pre-trained Transformer Language Models and first released in metaseq's repository on May 3rd 2022 by Meta AI. Disclaimer: The team releasing OPT wrote an official model card, which is available in Appendix D of the paper. Content from this model card has been written by the Hugging Face team. To quote the first two paragraphs of the official paper OPT was predominantly pretrained with English text, but a small amount of non-English data is still present within the training corpus via CommonCrawl. The model was pretrained using a causal language modeling (CLM) objective. OPT belongs to the same family of decoder-only models like GPT-3. As such, it was…

Open weights other 2,048 tokens transformers

Model · Text generation

Ornith-1.5-9B-GGUF

Ornith

Chirp Chirp! We are introducing Ornith-1.5, a major step toward building foundation models through end-to-end self-improvement. Ornith-1.5 extends Ornith-1.0 (which was developed on top of Qwen3.5 and Gemma4 with additional continued pretraining, mid-training, and post-training) by expanding the self-improvement loop from scaffold and rollout optimization to jointly optimizing task generation, scaffold construction, and solution rollouts. Rather than relying on a fixed set of human-curated tasks and manually designed harnesses, Ornith-1.5 continuously generates new training tasks, discovers effective strategies for solving them, and improves the policy through reinforcement learning. For…

Open weights mit transformers

Model · Text generation

Ternary-Bonsai-2-27B-gguf

Prism ML

Full 27B-class reasoning in ternary transformer weights, for llama.cpp (CUDA, Metal, CPU) - \~5.9 GB language model (down from \~54 GB FP16) — full 27B-class reasoning on a standard laptop or a single GPU - 98.2% of FP16 intelligence retained: 84.78 average across 14 thinking-mode benchmarks — far above the conventional IQ2XXS build (72.59) at about 82% of its footprint, and within 0.4 points of UD-Q4KXL at three times the footprint - Retains thinking, reasoning, and agentic behavior deep in the sub-4-bit regime, where conventional low-bit representations collapse: math within half a point of full precision (96.57), coding level with the baseline (89.42), agentic tool calling at 74.92…

Open weights apache-2.0 llama.cpp

Model · Text generation

Ornith-1.5-35B-A3B-GGUF

Ornith

Chirp Chirp! We are introducing Ornith-1.5, a major step toward building foundation models through end-to-end self-improvement. Ornith-1.5 extends Ornith-1.0 (which was developed on top of Qwen3.5 and Gemma4 with additional continued pretraining, mid-training, and post-training) by expanding the self-improvement loop from scaffold and rollout optimization to jointly optimizing task generation, scaffold construction, and solution rollouts. Rather than relying on a fixed set of human-curated tasks and manually designed harnesses, Ornith-1.5 continuously generates new training tasks, discovers effective strategies for solving them, and improves the policy through reinforcement learning. For…

Open weights mit transformers

Uncensored Qwen3.8-27B, published as GGUF quantizations with the multi token prediction (MTP) head retained and verified. Refusal behaviour has been substantially reduced, not eliminated. See Measured behaviour for the numbers. Capabilities, training data, and architecture are otherwise unchanged. - Refusal directions removed with Heretic, which co minimizes refusal count against KL divergence from the base model. No handwritten refusal removal code, no finetuning, no additional training data. - Abliteration runs at bf16 (no 4 bit quantization). the resulting LoRA is merged into the bf16 base, so the published weights are not a quantized round trip. - mtp. tensors are copied verbatim from…

Open weights apache-2.0 llama.cpp

Model · Text generation

Ornith-1.0-9B-GGUF

Ornith

Aloha! Today, we are releasing Ornith-1.0, a self-improving family of open-source models for agentic coding. This model card documents Ornith-1.0-9B, the most lightweight member of the Ornith family, designed for efficient single-GPU deployment. Ornith-1.0-9B is a dense ~9B model (≈19 GB in bf16), so it serves comfortably on a single 80GB GPU. The recipes below stand up an OpenAI-compatible server; add --tensor-parallel-size / --tp if you want to shard across more GPUs. For a quick local test (or to script offline generation), load the model directly with Transformers. Make sure you have a recent release installed — see the Transformers installation guide; Ornith-1.0-9B requires…

Open weights mit transformers