Downloads · 30 days
365
85% of all-time downloads
Bochkov/llm-fix-min-baseline-learned-input-table-model-classic
llm-fix-min-baseline-learned-input-table-model-classic is a text generation model from Bochkov. Use it when you need the model to write or continue text. It is set up for transformers. The card lists the license as apache-2.0.
Downloads · 30 days
365
85% of all-time downloads
All-time downloads
427
Public
Parameters
537M
2.1 GB on disk
Likes
0
Public
Click a slice to open those files.
.safetensors2.1 GB · 100%
From the Hugging Face model README
Research checkpoint for the paper:
Language Models Without a Trainable Input Embedding Table: Learning from Fixed Minimal Binary Token Codes
This repository contains the learned input table baseline.
The model is a 32-layer decoder-only Transformer with:
This baseline uses a standard trainable input embedding table of size:
65,536 x 1024 = 67,108,864 trainable input parameters
This checkpoint is provided for reproducibility of the paper's controlled comparison. It is intended for research use only.
import torch
from transformers import AutoTokenizer, AutoModelForCausalLM
repo_id = "Bochkov/llm-fix-min-baseline-learned-input-table-model-classic"
tokenizer = AutoTokenizer.from_pretrained(repo_id, trust_remote_code=True)
model = AutoModelForCausalLM.from_pretrained(repo_id, trust_remote_code=True)
model.eval()
prompt = "Question: What is the capital of United Kingdom?\nAnswer:"
input_ids = torch.tensor([tokenizer.encode(prompt)], dtype=torch.long)
with torch.no_grad():
output_ids = model.generate(input_ids, max_new_tokens=3, do_sample=False)
print(tokenizer.decode(output_ids[0].tolist()))
The checkpoint was evaluated as a base causal language model with
EleutherAI LM Evaluation Harness v0.4.10.
Evaluation protocol:
hfadd_bos_token=False0,1234,1234,1234| Metric | Learned input table | Fixed Binary-16 | Affine GF(2), table-free | SmolLM2-135M | SmolLM2-360M |
|---|---|---|---|---|---|
| HellaSwag acc | 28.49 ± 0.45 | 29.04 ± 0.45 | 29.04 ± 0.45 | 35.36 ± 0.48 | 43.05 ± 0.49 |
| HellaSwag acc_norm | 31.32 ± 0.46 | 32.32 ± 0.47 | 31.80 ± 0.46 | 43.02 ± 0.49 | 56.28 ± 0.50 |
| ARC-Easy acc | 46.38 ± 1.02 | 47.90 ± 1.03 | 47.64 ± 1.02 | 64.44 ± 0.98 | 70.24 ± 0.94 |
| ARC-Easy acc_norm | 40.70 ± 1.01 | 40.87 ± 1.01 | 41.20 ± 1.01 | 58.75 ± 1.01 | 68.18 ± 0.96 |
| ARC-Challenge acc | 20.39 ± 1.18 | 19.62 ± 1.16 | 21.33 ± 1.20 | 28.07 ± 1.31 | 36.26 ± 1.40 |
| ARC-Challenge acc_norm | 25.85 ± 1.28 | 26.19 ± 1.28 | 24.83 ± 1.26 | 29.61 ± 1.33 | 38.05 ± 1.42 |
| PIQA acc | 62.35 ± 1.13 | 62.57 ± 1.13 | 62.68 ± 1.13 | 68.44 ± 1.08 | 71.38 ± 1.05 |
| PIQA acc_norm | 60.61 ± 1.14 | 62.08 ± 1.13 | 60.94 ± 1.14 | 68.39 ± 1.08 | 71.82 ± 1.05 |
| WinoGrande acc | 50.20 ± 1.41 | 50.12 ± 1.41 | 50.43 ± 1.41 | 52.57 ± 1.40 | 59.35 ± 1.38 |
| OpenBookQA acc | 18.40 ± 1.73 | 17.20 ± 1.69 | 17.60 ± 1.70 | 22.00 ± 1.85 | 24.80 ± 1.93 |
| OpenBookQA acc_norm | 29.20 ± 2.04 | 31.00 ± 2.07 | 29.40 ± 2.04 | 32.60 ± 2.10 | 37.80 ± 2.17 |
| CommonsenseQA acc | 20.31 ± 1.15 | 19.90 ± 1.14 | 20.23 ± 1.15 | 19.90 ± 1.14 | 21.05 ± 1.17 |
| MMLU 0-shot | 24.13 ± 0.36 | 23.86 ± 0.36 | 24.11 ± 0.36 | 24.24 ± 0.36 | 25.47 ± 0.37 |
| MMLU 5-shot | 25.68 ± 0.37 | 25.60 ± 0.37 | 25.66 ± 0.37 | 25.39 ± 0.37 | 25.05 ± 0.37 |
| LAMBADA accuracy | 22.38 ± 0.58 | 21.23 ± 0.57 | 21.99 ± 0.58 | 42.97 ± 0.69 | 53.31 ± 0.70 |
| LAMBADA perplexity | 95.14 ± 4.01 | 101.74 ± 4.27 | 100.61 ± 4.17 | 19.06 ± 0.63 | 9.38 ± 0.27 |
| WikiText word perplexity | 81.04 | 74.87 | 76.17 | 25.53 | 18.84 |
| WikiText byte perplexity | 2.27 | 2.24 | 2.25 | 1.83 | 1.73 |
| WikiText bits/byte | 1.19 | 1.16 | 1.17 | 0.87 | 0.79 |
The three paper checkpoints form the controlled architectural comparison. SmolLM2-135M and SmolLM2-360M are external reference models, not matched baselines: they use different architectures, tokenizers, training mixtures, and much larger pretraining budgets. SmolLM2-135M was trained on approximately 2T tokens and SmolLM2-360M on approximately 4T tokens, whereas the paper checkpoints saw approximately 16–17B tokens. Their scores therefore provide context for absolute capability and must not be interpreted as isolating the effect of the input parameterization.
Perplexity values should be interpreted especially cautiously across different tokenizers. The primary controlled comparison is among the three paper models, which share the same tokenizer, data pipeline, and architecture.
Unlike the two fixed-code variants, this control model uses a standard learned input embedding table. The table contains 67,108,864 trainable parameters and is expected to contain general real-valued entries rather than binary codes.
import torch
from transformers import AutoModelForCausalLM
repo_id = (
"Bochkov/"
"llm-fix-min-baseline-learned-input-table-model-classic"
)
model = AutoModelForCausalLM.from_pretrained(
repo_id,
trust_remote_code=True,
torch_dtype=torch.float32,
).cpu().eval()
embedding = model.get_input_embeddings()
weight = embedding.weight.detach()
print("shape:", tuple(weight.shape))
print("requires_grad:", embedding.weight.requires_grad)
print(
"all entries binary:",
bool(torch.all((weight == 0) | (weight == 1))),
)
assert tuple(weight.shape) == (65536, 1024)
assert embedding.weight.requires_grad is True
assert not torch.all((weight == 0) | (weight == 1))
Expected audit properties:
shape: (65536, 1024)
requires_grad: True
all entries binary: False
This is a small research language model trained for architectural comparison. It is not instruction-tuned for safe deployment and should not be used as a production system.
The model was trained on the same FineWeb-Edu + Cosmopedia mixture used for the matched comparisons in the paper. Dataset terms and licenses are those of the original datasets.
If you use this model or the underlying concepts in your research, please cite our work:
@misc{bochkov2026languagemodelstrainableinput,
title={Language Models Without a Trainable Input Embedding Table: Learning from Fixed Minimal Binary Token Codes},
author={A. Bochkov},
year={2026},
eprint={2605.09751},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2605.09751},
}