SAVRN
Search Contact SAVRN

Open-weight model · Text generation

cRia-LM-75M

by Shreyan Mohanty sz14/cRia-LM-75M

cRia-LM-75M is an open-weight model for text generation from Shreyan Mohanty, released under Apache License 2.0. It has 76M parameters and a 4,096-token context. At 16-bit it needs about 0.2 GB of GPU memory, which fits on 1x MI300X from $1.85 an hour, at the lowest prices in the SAVRN Index. It draws 6.9k downloads a month.

cRia-LM-75M is a 75.7M-parameter base language model built as a Relaxed Recursive Transformer (RRT). It uses a shared 11-layer recurrent block evaluated twice, with pass-specific LoRA parameters on the second traversal.

Parameters76M
Context4,096
Weights302.9 MB
Licenseapache-2.0
AccessOpen weights
Monthly Downloads6.9k

Runs On

What it takes to serve cRia-LM-75M (76M parameters): the memory its weights need at each precision, and the cheapest way to rent enough data-center GPUs to hold them.

PrecisionWeightsMemory neededCheapest setupPer hourAlso fits
16-bit 0.2 GB 0.2 GB 1x MI300X (192 GB)
Vultr
$1.85 1x H100 $1.99 · 1x MI325X $2.00
8-bit 0.1 GB 0.1 GB 1x MI300X (192 GB)
Vultr
$1.85 1x H100 $1.99 · 1x MI325X $2.00
4-bit 0.0 GB 0.0 GB 1x MI300X (192 GB)
Vultr
$1.85 1x H100 $1.99 · 1x MI325X $2.00

Memory is the weights at that precision plus 20% for the runtime and a short context; a long context needs more. Prices are the lowest on-demand hourly rates in the SAVRN Index, read Sep 19, 2026.

cRia-LM-75M on every accelerator the SAVRN Index prices, at every precision

Model Card

By Shreyan Mohanty, published under apache-2.0, revision a424901d152c.

cRia-LM-75M is a 75.7M-parameter base language model built as a Relaxed Recursive Transformer (RRT). It uses a shared 11-layer recurrent block evaluated twice, with pass-specific LoRA parameters on the second traversal. Training was carried out in three stages. Stage 1 established the 2K base model over 10B tokens. Stage 2 continued training with a 2B-token budget and a capability-focused data curriculum; the released Stage 2 checkpoint is step 10,000, corresponding to about 1.31B continuation tokens. Stage 3 extended the context window from 2,048 to 4,096 tokens with a 50M-token run on codelion/sutra-1B. The released checkpoint continues from that long-context stage with 35 learned…

Read Shreyan Mohanty's full model card

Cria (noun): a baby llama, alpaca, vicuña, or guanaco. Pronounced ˈkrē-ə.

~ Merriam-Webster



cRia-LM-75M is a 75.7M-parameter base language model built as a Relaxed Recursive Transformer (RRT). It uses a shared 11-layer recurrent block evaluated twice, with pass-specific LoRA parameters on the second traversal.

Training was carried out in three stages. Stage 1 established the 2K base model over 10B tokens. Stage 2 continued training with a 2B-token budget and a capability-focused data curriculum; the released Stage 2 checkpoint is step 10,000, corresponding to about 1.31B continuation tokens. Stage 3 extended the context window from 2,048 to 4,096 tokens with a 50M-token run on codelion/sutra-1B. The released checkpoint continues from that long-context stage with 35 learned residual-gain scalars and one epoch over the HellaSwag, ARC-Easy, ARC-Challenge, PIQA, SciQ and SWAG training splits.

This is a base model. It has not been instruction tuned and does not use a chat template. The Transformer layer design follows HuggingFaceTB/SmolLM2-135M, with QK-Norm added for training stability.

Model Details

Specification Value
Parameters 75.7M
Architecture Relaxed Recursive Transformer
Unique Transformer layers 13
Effective depth 24
Prelude layers 1
Shared recurrent layers 11
Recurrent passes 2
Coda layers 1
Hidden size 576
MLP intermediate size 1,536
Attention heads 9 query heads
KV heads 3
Attention type Grouped-query attention
Head dimension 64
MLP SwiGLU
Normalization RMSNorm
Attention normalization QK-Norm
Position encoding RoPE
RoPE theta 100,000
Context length 4,096 tokens
Vocabulary size 49,152
Tokenizer SmolLM2 BPE tokenizer, per-digit tokenized
Token embedding Tied, factorized
Embedding rank 210
Recurrent LoRA rank 172
Residual gains 35 learned scalars
KV cache Recursion-wise, one slot per effective layer/pass
Model type Base causal language model

Architecture

cRia-LM-75M uses 13 unique Transformer layers arranged as:

1 prelude + (11 shared layers x 2 recurrent passes) + 1 coda

This gives an effective depth of 24 Transformer layers while storing the main parameters for only 13 unique layers.

The 11-layer recurrent block is shared across both passes. On the second pass, the recurrent linear projections receive rank-172 LoRA updates. The two traversals therefore share the base weights while retaining pass-specific capacity.

Each Transformer layer uses:

  • hidden size 576
  • 9 query heads and 3 KV heads with grouped-query attention
  • head dimension 64
  • SwiGLU feed-forward network with intermediate size 1,536
  • RMSNorm
  • rotary position embeddings
  • QK-Norm

Factorized Tied Embedding

The input embedding and language-model readout are tied through a rank-210 factorization:

49,152 x 210
210 x 576

The same factors are used for token lookup and output projection. This keeps the full 49,152-token vocabulary while reducing the parameter cost of the embedding and output head.

Training

Stage 1 — Base pretraining

Stage 1 trained the model for 10B tokens at a sequence length of 2,048. The objective combined next-token cross-entropy with logit-level knowledge distillation from HuggingFaceTB/SmolLM2-360M, with dynamic CE/KD scale balancing.

The Stage 1 sampling mix was:

Data source Sampling weight
FineWeb-Edu 48%
DCLM-Edu 32%
Cosmopedia-v2 12%
FineMath-4+ 5%
StarCoder Python 3%

Stage 1 used Muon for matrix parameters and AdamW for the remaining parameter groups. The learning-rate schedule was warmup-stable-decay: 1% warmup, decay beginning at 80% of the run, and the final 20% used for decay.

Stage 2 — Capability mid-training

Stage 2 used a 2B-token training budget at 2,048-token context. The released Stage 2 checkpoint is step 10,000, or 1,310,720,000 tokens at 131,072 tokens per optimizer step.

The phase used two-teacher distillation: same-tokenizer KL from HuggingFaceTB/SmolLM2-360M and cross-tokenizer supervision from Qwen/Qwen3.5-0.8B-Base using X-Token. The run used the H-KL cross-tokenizer objective after the tokenizer-coverage audit, with dynamic CE/KD balancing retained around the combined distillation loss.

Phase 2A mix

Phase 2A is the capability-injection mix. It remains active through 65% of the planned Stage 2 run. The original configuration assigned 8% to Nemotron QA, but that source was unavailable when the run started. The loader dropped it and renormalized the remaining weights; the table below shows the effective mix that was actually sampled.

Data source Effective sampling weight
FineWeb-Edu 19.57%
DCLM-Edu 13.04%
Cosmopedia-v2 10.87%
Cosmopedia Stories 8.70%
Cosmopedia WikiHow 7.61%
Cosmopedia Science 9.78%
Wikipedia 10.87%
FineMath 5.43%
Nemotron Math 3.26%
InfiWebMath 3.26%
StarCoder Python 4.35%
FineWeb-HQ 3.26%
Phase 2B mix

Phase 2B is the cooldown mix. It removes the noisier sources and shifts more weight toward higher-quality web, educational, encyclopedic, science, and math data.

Data source Sampling weight
FineWeb-HQ 18%
Cosmopedia-v2 14%
Cosmopedia Science 14%
Wikipedia 14%
FineMath 12%
Cosmopedia WikiHow 8%
Cosmopedia Stories 8%
DCLM-Edu 8%
StarCoder Python 4%
Stage 2 WSD schedule

Stage 1 had already completed a full decay, so Stage 2 re-warmed to a lower peak rather than returning to the original Stage 1 learning rate.

Setting Value
Stage 2 token budget 2.00B
Tokens per optimizer step 131,072
Planned optimizer steps 15,258
AdamW base LR 1e-4
Muon base LR 0.006
Re-warm first 3%
Stable region through 55%
WSD decay start 55% (~1.10B tokens)
Phase 2B mix switch 65% (~1.30B tokens)
Minimum LR fraction 2% of the Stage 2 base LR
Released checkpoint step 10,000 (~1.31B tokens)

After the stable region, the LR multiplier follows the run's square-root WSD decay:

lr_scale = max(0.02, 1 - sqrt(decay_progress))

Because the data-mix switch occurs at 65%, the final portion of Phase 2A already runs under LR decay. The selected step-10,000 checkpoint lands just after the switch to Phase 2B.

Stage 3 — 2K to 4K context extension

Stage 3 increases the supported context length from 2,048 to 4,096 tokens. The run was configured for 50M tokens on codelion/sutra-1B, with the long-context checkpoint used for this release selected at step 100, roughly 15M tokens into the run. The released model then continued with 35 learned residual-gain scalars for one epoch over the HellaSwag, ARC-Easy, ARC-Challenge, PIQA, SWAG, and SciQ training splits.

The context-length curriculum used the following token fractions:

Sequence length Token fraction
1,024 25%
2,048 40%
4,096 35%

The training path uses Apple's Cut Cross Entropy directly against cRia's factorized tied output head. The cce_exact implementation was used to avoid gradient filtering while reducing the memory cost of materializing full-vocabulary logits for CE computation.

RoPE theta remains 100,000 and no RoPE scaling is applied. The model has no learned absolute position table, so moving from 2K to 4K does not add parameters.

Evaluation

The complete standard suite was evaluated zero-shot with FP32 model tensors and FP32 log-softmax. CUDA TF32 matmuls were enabled.

Benchmark Metric Score Std. error
ARC-Challenge acc_norm 30.46 0.0134
ARC-Easy acc_norm 58.16 0.0101
ArithMark-3 acc_norm 37.30 0.0153
Balanced COPA acc 58.70 0.0156
BananaMind Base Bench 1.1 raw accuracy 60.86
BLiMP acc 79.06 0.0015
BoolQ acc 53.82 0.0087
CommonsenseQA acc 20.48 0.0116
HellaSwag acc_norm 38.95 0.0049
LAMBADA acc 38.17 0.0068
LAMBADA perplexity 43.67 1.9797
MMLU (continuation) acc 26.66 0.0037
OpenBookQA acc_norm 34.20 0.0212
PIQA acc_norm 64.74 0.0111
SciQ acc_norm 90.00 0.0095
TruthfulQA MC2 acc 41.74 0.0153
Winogrande acc 52.17 0.0140
Average (accuracy metrics only) 49.09

The average is the unweighted arithmetic mean of the 14 standard accuracy scores, ArithMark-3 normalized accuracy, and BananaMind raw accuracy.

Comparison with established small language models

Benchmark Metric GPT-2 OPT-125M AMD-Llama-135M SmolLM-135M SmolLM2-135M
ARC-Challenge acc_norm 22.70 22.53 26.02 28.75 29.61
ARC-Easy acc_norm 39.52 40.03 31.82 56.48 58.54
ArithMark-3 acc_norm 37.00 35.30 35.70 36.80 38.80
Balanced COPA acc 54.80 56.90 50.50 58.10 61.20
BananaMind Base Bench 1.1 raw accuracy 50.57 47.71 53.14 67.71 66.00
BLiMP acc 82.13 81.64 58.16 78.53 78.96
BoolQ acc 49.11 56.21 61.83 60.18 60.31
CommonsenseQA acc 19.57 19.98 19.57 19.90 19.57
HellaSwag acc_norm 31.12 31.60 27.15 42.61 43.08
LAMBADA acc 32.56 38.81 21.19 37.73 42.89
LAMBADA perplexity 40.07 23.13 1,074.67 32.33 19.26
MMLU (continuation) acc 25.47 25.15 25.42 28.92 29.90
OpenBookQA acc_norm 27.20 28.80 26.00 34.40 33.40
PIQA acc_norm 62.57 62.02 60.66 68.17 68.50
SciQ acc_norm 64.30 70.40 47.20 74.80 78.20
TruthfulQA MC2 acc 40.68 42.87 42.73 39.28 38.79
Winogrande acc 51.46 51.38 51.93 53.28 53.04
Average (accuracy metrics only) 43.17 44.46 39.94 49.10 50.05

We don't make any claims about inferiority or superiority of any model. While we took care of avoiding leakage from validation and test sets, we DID use the train splits of several of these benchmarks in our pre-training corpus. Compared to other models who had a longer training regime on non-benchmark data, it is possible real performance may lag behind what these benchmarks indicate (LAMBADA perplexity and MMLU already shows this trend somewhat).

Inference Performance

Measurements used FP32 weights, batch size 1, synchronized CUDA medians, PyTorch 2.12.0+cu130, WSL2, and an RTX 4070 Ti.

Measurement Result
128-token cached prefill 17.85 ms
512-token cached prefill 17.49 ms
2,048-token cached prefill 49.54 ms
128-token prompt + 128-token decode 62.97 tokens/s
Resident CUDA allocation after warm-up 305.20 MiB
Incremental peak CUDA allocation, 128 + 128 10.358 MiB
Reserved CUDA memory 328 MiB

For repeated unpadded greedy requests of one fixed shape, the reusable CUDA graph runner reached 318.77 tokens/s with a 128-token prompt and 64 generated tokens. The graph is inference-only, is fixed to its configured batch/prompt/output shape, and must be rebuilt after training changes model parameters.

Usage

The model ships with a custom Transformers implementation, so trust_remote_code=True is required for the model. The tokenizer is loaded directly from the cRia repository.

model.generate() uses the recursion-wise KV cache by default. use_cache=True is shown explicitly below so the inference path is clear.

import torch
from transformers import AutoModelForCausalLM, AutoTokenizer

model_id = "sz14/cRia-LM-75M"
device = "cuda" if torch.cuda.is_available() else "cpu"

tokenizer = AutoTokenizer.from_pretrained(model_id)
model = AutoModelForCausalLM.from_pretrained(
    model_id,
    trust_remote_code=True,
    dtype=torch.float32,
).to(device).eval()

prompt = "In mathematics, a vector is"
inputs = tokenizer(prompt, return_tensors="pt").to(device)

with torch.no_grad():
    output = model.generate(
        **inputs,
        max_new_tokens=64,
        do_sample=False,
        use_cache=True,
    )

print(tokenizer.decode(output[0], skip_special_tokens=True))

Explicit KV-cache usage

For custom decode loops, a cache can also be created and passed through past_key_values directly:

prompt = "In mathematics, a vector is"
inputs = tokenizer(prompt, return_tensors="pt").to(device)
cache = model.new_cache(batch=inputs.input_ids.shape[0])

with torch.no_grad():
    # Prefill the prompt and populate the cache.
    out = model(
        **inputs,
        past_key_values=cache,
        use_cache=True,
    )

    # Decode one token using only the new token plus cached K/V states.
    next_token = out.logits[:, -1].argmax(dim=-1, keepdim=True)
    out = model(
        input_ids=next_token,
        past_key_values=cache,
        use_cache=True,
    )

print("cached positions:", cache.pos)

Pass use_cache=False to model.generate() to fall back to full-prefix recomputation.

KV-cache implementation

The recurrent block shares weights across passes, but the two passes do not share keys and values. The second traversal uses its own LoRA-adapted projections, so each recurrent pass receives a separate cache slot. With the current architecture this produces 24 cache slots, matching the model's 24 effective layers.

The current implementation supports:

  • cached prompt prefill and token-by-token decode
  • batched generation with left padding
  • attention masks over the full cached key length
  • RoPE positions derived from the cumulative attention mask for padded batches
  • beam-search cache reordering
  • explicit cache cropping/resetting
  • a hard 4,096-token cache/context bound with clear errors beyond the configured window

A standalone model.generate_cached(...) helper is also available for direct incremental decoding outside the standard Transformers generation path.

Intended Use

cRia-LM-75M is intended primarily for:

  • research on recursive parameter sharing
  • experiments with compact language models
  • further pretraining and domain adaptation
  • supervised fine-tuning
  • small language-model backbones
  • architecture and knowledge-distillation research

Because this is a base model, prompts are treated as ordinary text continuation rather than instructions.

Limitations

cRia-LM-75M is a small base language model and should not be expected to match substantially larger pretrained models.

Known limitations include:

  • weak multi-step reasoning
  • limited factual knowledge
  • potential factual errors and hallucinations
  • no instruction-following training
  • no chat template
  • English-focused training
  • a 4,096-token maximum context window

The model should not be treated as a reliable source of factual information or used without additional validation in high-stakes applications.

Architecture and Training Lineage

The Transformer layer design follows HuggingFaceTB/SmolLM2-135M, released by Hugging Face under the Apache 2.0 license.

HuggingFaceTB/SmolLM2-360M was used for same-tokenizer logit distillation in the initial training and Stage 2. Stage 2 additionally used Qwen/Qwen3.5-0.8B-Base for cross-tokenizer X-Token distillation.

The recursive parameter-sharing approach is based on:

Bae et al., "Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRA," arXiv:2410.20672.

Stage 2 cross-tokenizer distillation uses:

Sreenivas et al., "X-Token: Projection-Guided Cross-Tokenizer Knowledge Distillation," arXiv:2605.21699.

Stage 3 uses Apple's Cut Cross Entropy implementation from Wijmans et al., "Cut Your Losses in Large-Vocabulary Language Models," arXiv:2411.09009v2.

License

cRia-LM-75M is released under the Apache License 2.0.

Configuration

Architecture
RRTForCausalLM
Context length (tokens)
4,096
Layers
13
Hidden size
576
Attention heads
9
Key/value heads
3
Head dimension
64
Vocabulary size
49,152
RoPE base
100000
Model type
rrt

Identity and Version

Repository
sz14/cRia-LM-75M
Publisher
Shreyan Mohanty
Task
Text generation
Modality
Text
Library
transformers
Parameters
76M parameters
Languages
en
Revision
a424901d152c9275eee735101b1e5054b3f22f55
First published
2026-08-20
Last updated
2026-09-19

Files and Weights

15 files, 306.7 MB in total. The weights are 1 file totalling 302.9 MB in safetensors.

Weights1 file · 302.9 MB
Configuration8 files · 83.8 KB
Tokenizer2 files · 3.5 MB
Documentation2 files · 21.6 KB
Other1 file · 122.4 KB
Repository1 file · 97 B
Every file
FileTypeSizeSHA-256
model.safetensorsWeights302.9 MB 28ef0d085a1f
benchmark_results.jsonConfiguration1.9 KB
calculate_axiomic_index.pyConfiguration2.5 KB
config.jsonConfiguration1.5 KB
evaluate_arithmark3.pyConfiguration6.5 KB
generation_config.jsonConfiguration215 B
modeling_rrt.pyConfiguration55.0 KB
residual_gain_training_report.jsonConfiguration15.7 KB
run_phase3_lm_eval.pyConfiguration466 B
README.mdDocumentation17.1 KB
generation_comparison.mdDocumentation4.5 KB
banner.pngOther122.4 KB d037c8da3a83
.gitattributesRepository97 B
tokenizer.jsonTokenizer3.5 MB
tokenizer_config.jsonTokenizer752 B

License and Download

License
apache-2.0
Access
Open weights, no gate
Download size
302.9 MB
Download from Shreyan Mohanty

Released by Shreyan Mohanty through its official repository on Hugging Face. Read the license.

Built From

  • Described by arXiv:2410.20672
  • Described by arXiv:2411.09009
  • Described by arXiv:2605.21699
  • Trained on (disclosed) HuggingFaceFW/fineweb-edu
  • Trained on (disclosed) HuggingFaceTB/cosmopedia
  • Trained on (disclosed) HuggingFaceTB/dclm-edu
  • Trained on (disclosed) HuggingFaceTB/finemath
  • Trained on (disclosed) HuggingFaceTB/smollm-corpus
  • Trained on (disclosed) bigcode/starcoderdata
  • Trained on (disclosed) codelion/sutra-1B
  • Trained on (disclosed) epfml/FineWeb-HQ
  • Trained on (disclosed) nvidia/Nemotron-CC-Math-v1
  • Trained on (disclosed) wikimedia/wikipedia

Memory Requirements

PrecisionWeights in memory
As published302.9 MB
16-bit0.2 GB
8-bit0.1 GB
4-bit0.0 GB

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

Built on This Model

Questions About cRia-LM-75M

How much GPU memory does cRia-LM-75M need?

About 0.2 GB at 16-bit and 0 GB at 4-bit: the weights (76M parameters) plus a working margin. A long context needs more.

What is the cheapest GPU to run cRia-LM-75M on?

At 16-bit, 1x MI300X from $1.85 an hour; at 4-bit, 1x MI300X from $1.85 an hour, at the lowest on-demand prices the SAVRN Index lists.

Can I use cRia-LM-75M commercially?

Yes. cRia-LM-75M is released under Apache License 2.0. The Apache License 2.0 is a permissive open-source license. It permits commercial use, modification and redistribution. It requires keeping the license and copyright notices and any NOTICE file, stating significant changes, and it includes an express patent grant from contributors.

What is cRia-LM-75M's context length?

4,096 tokens, from the maximum position embeddings in its published configuration.

Similar Models

Model · Text generation

cRia-LM-75M-Instruct

Shreyan Mohanty

cRia-LM-75M-Instruct is a 75.7M-parameter instruction-tuned language model built as a Relaxed Recursive Transformer (RRT). It uses a shared 11-layer recurrent block evaluated twice, with pass-specific LoRA parameters on the second traversal. The model starts from cRia-LM-75M, then adds supervised instruction tuning and preference optimization. It ships with a native chat template using and markers. cRia-LM-75M-Instruct keeps the base model's 13 unique Transformer layers: src="https://hfviewer.com/api/card.svg?source=sz14%2FcRia-LM-75M-Instruct&granularity=auto&v=20260516-title-pills-card" alt="Architecture graph for sz14/cRia-LM-75M-Instruct. Open in hfviewer" width="100%" This gives an…

Open weights apache-2.0 76M parameters 4,096 tokens transformers

Model · Text generation

Discovery

Convergent Intelligence

A 70M parameter causal language model built on the Mixture-of-Attentions (MoA) architecture — distance-based metric attention that respects the triangle inequality by construction, not approximation. Every attention head operates in a proper metric space. The geometry is enforced, not hoped for. Standard transformers compute attention as a dot product: Q·Kᵀ. This has no geometric meaning — it's a bilinear form, not a distance. Two tokens can be "close" by dot product while violating basic metric properties. MoA replaces this with negative squared distance under a learned diagonal Mahalanobis metric, then enforces the triangle inequality through a regularizer over random triples sampled…

Open weights cc 71M parameters 2,048 tokens transformers

Model · Text generation

DiscoverLM-70M

Convergent Intelligence

A 69M parameter causal language model built on the Mixture-of-Attentions (MoA) architecture — distance-based metric attention that respects the triangle inequality by construction, not approximation. Every attention head operates in a proper metric space. The geometry is enforced, not hoped for. Standard transformers compute attention as a dot product: Q·Kᵀ. This has no geometric meaning — it's a bilinear form, not a distance. Two tokens can be "close" by dot product while violating basic metric properties. MoA replaces this with negative squared distance under a learned diagonal Mahalanobis metric, then enforces the triangle inequality through a regularizer over random triples sampled…

Open weights cc 69M parameters 1,024 tokens transformers

Model · Text generation

distilgpt2

DistilBERT community

DistilGPT2 (short for Distilled-GPT2) is an English-language model pre-trained with the supervision of the smallest version of Generative Pre-trained Transformer 2 (GPT-2). Like GPT-2, DistilGPT2 can be used to generate text. Users of this model card should also consider information about the design, training, and limitations of GPT-2. CONTENT WARNING: Readers should be aware this section contains content that is disturbing, offensive, and can propagate historical and current stereotypes. As the developers of GPT-2 (OpenAI) note in their model card, “language models like GPT-2 reflect the biases inherent to the systems they were trained on.” Significant research has explored bias and…

Open weights apache-2.0 88M parameters transformers

Model · Text generation

pythia-70m-deduped

EleutherAI

The Pythia Scaling Suite is a collection of models developed to facilitate interpretability research (see paper). It contains two sets of eight models of sizes 70M, 160M, 410M, 1B, 1.4B, 2.8B, 6.9B, and 12B. For each size, there are two models: one trained on the Pile, and one trained on the Pile after the dataset has been globally deduplicated. All 8 model sizes are trained on the exact same data, in the exact same order. We also provide 154 intermediate checkpoints per model, hosted on Hugging Face as branches. The Pythia model suite was designed to promote scientific research on large language models, especially interpretability research. Despite not centering downstream performance as a…

Open weights apache-2.0 96M parameters 2,048 tokens transformers

Model · Text generation

SAGI

Convergent Intelligence

SAGI is a novel causal language model that integrates swarm intelligence dynamics with transformer architecture. The model treats cognition as a dynamic, adaptive system where multiple internal "agents" collaborate through differentiable routing, trust mechanisms, and shared memory. - Episodic + Semantic Memory: Dual memory system with trainable retrieval utility The swarm processes observations derived from token embeddings, updating its internal state S. This state conditions the transformer's attention patterns and feed-forward activations via learned projections, creating bidirectional information flow between symbolic (tokens) and subsymbolic (swarm dynamics) processing. - Educational…

Open weights apache-2.0 53M parameters 2,048 tokens transformers