Non-record: Causal Bigram Blending — eval-time BPB improvement (1×H20…#2088
Open
MaxIv25 wants to merge 1 commit intoopenai:mainfrom
Open
Non-record: Causal Bigram Blending — eval-time BPB improvement (1×H20…#2088MaxIv25 wants to merge 1 commit intoopenai:mainfrom
MaxIv25 wants to merge 1 commit intoopenai:mainfrom
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Non-record: Causal Bigram Blending — eval-time BPB improvement (1×H200, 3-seed)
Summary
This submission introduces Causal Bigram Blending — a zero-cost eval-time technique that blends neural model log-probabilities with an online causal bigram prior, yielding a consistent ~0.011 BPB improvement at no additional training cost or artifact size increase.
Architecture
Base architecture is the PR #1855 / #1868 lineage:
Novel Technique: Causal Bigram Blending
At eval time, we maintain a running bigram count matrix
P(next_token | prev_token)that is updated after each batch is scored (score-before-update = compliant with competition rules).For each token position, the model's log-probabilities are blended with the bigram prior:
Where:
λ = 0.03— blend strengthc = count / (count + 10)— adaptive confidence (0→1 as observations grow)log((count + 1) / (total + V))Key properties:
Results
1×H200, 5000 steps, 3-seed
Trained without CaseOps, 5/128 training shards (subset of FineWeb-10B SP8192).
Ablation: Bigram Blend ON vs OFF (1×H200, 3000 steps)
Controlled comparison with identical training — no TTT, no CaseOps, 5/128 training shards (subset of FineWeb-10B SP8192).
8×H100 RunPod, 600s wallclock (1 seed, no TTT)
Reproduction
Files
train_gpt_sota_exp.py— training script with Causal Bigram Blending (eval-time, lines 2792–2864)train_h200_seed{42,314,0}.log— 3-seed training logs on 1×H200Compliance Notes
Built Upon
This work builds on the following PRs:
train_gpt_sota_exp.py.