Most teams consume AI models. AltSlate Labs also trains them. Our Jugnu family of compact language models is built from scratch, and the same discipline shapes the custom and fine-tuned models we deliver for clients.
Model capabilities we offer
Pretraining from scratch
We build models from the tokenizer up — architecture, data pipeline, and training loop — not just prompt wrappers.
Fine-tuning & distillation
Adapt frontier or compact models to your domain, then distill into something small enough to run cheaply in production.
Evaluation & benchmarking
Reproducible harnesses, honest baselines, and the eval discipline to know a model is actually better before it ships.
The Jugnu Research Family
An open, reproducible line of sub-150M models exploring how much capability fits into a small budget. Our 110M flagship reaches 81.25% on BLiMP, a standard test of grammatical understanding — matching a larger baseline with fewer parameters — and our 53M ranks #3 on the sub-150M Tiny-ML Leaderboard.
These are base research models — Tiny-ML leaderboard entries under a permissive license, not instruction-tuned production assistants. Client systems use whichever model best meets their quality, cost, latency, and privacy needs.
Decision APIs return a probability per option, but those numbers describe the options only if the model ignores irrelevant alternatives. In a pre-registered study of 299,463 calls to a hosted decision model, every added option shifted the odds between the right answer and its strongest rival by 0.20–0.52 nats, growing with the log of the option count — so its probabilities are best read as relative to the list they were computed over.
Encoding each candidate once and reusing it across states makes a decision model about 5× cheaper at 77 candidates, but the tested conversion lost nearly all rule-sensitivity (recall@1 1.00 → 0.24) while the joint scorer held 1.00. Targeted counterfactual supervision restores it on held-out synthetic rules; on real rules the joint scorer still wins (0.861 vs 0.500 on the short tier), so transfer is not established.
Can a shared backbone’s prefill KV cache be reused across already-trained LoRA specialists? On Qwen3-1.7B, full-prefix reuse cuts warm-cache time-to-first-token by up to ~16× at 8K context, at a small and inconsistent quality cost — with an honest account of where the memory savings did not materialise.
A clean scaling control for the Jugnu family: holding the recipe fixed and moving to a deep-and-thin 110M geometry lifts BLiMP from 78.1 to 81.3 on fewer training tokens. The ablation ladder that follows keeps value residuals and Muon, and reports the data-blend and distillation rungs as honest negatives.
Inference cascades that escalate to a verifier have a blind spot that grows with student capability and shrinks only by paying the frontier price. Corrective fine-tuning on the rejected tail collapses the student, and every in-loop metric stays flat while true error climbs — the system cannot see its own degradation.
Decision APIs return a probability per option, but those numbers describe the options only if the model ignores irrelevant alternatives. In a pre-registered study of 299,463 calls to a hosted decision model, every added option shifted the odds between the right answer and its strongest rival by 0.20–0.52 nats, growing with the log of the option count — so its probabilities are best read as relative to the list they were computed over.
Encoding each candidate once and reusing it across states makes a decision model about 5× cheaper at 77 candidates, but the tested conversion lost nearly all rule-sensitivity (recall@1 1.00 → 0.24) while the joint scorer held 1.00. Targeted counterfactual supervision restores it on held-out synthetic rules; on real rules the joint scorer still wins (0.861 vs 0.500 on the short tier), so transfer is not established.
Can a shared backbone’s prefill KV cache be reused across already-trained LoRA specialists? On Qwen3-1.7B, full-prefix reuse cuts warm-cache time-to-first-token by up to ~16× at 8K context, at a small and inconsistent quality cost — with an honest account of where the memory savings did not materialise.
A clean scaling control for the Jugnu family: holding the recipe fixed and moving to a deep-and-thin 110M geometry lifts BLiMP from 78.1 to 81.3 on fewer training tokens. The ablation ladder that follows keeps value residuals and Muon, and reports the data-blend and distillation rungs as honest negatives.
Inference cascades that escalate to a verifier have a blind spot that grows with student capability and shrinks only by paying the frontier price. Corrective fine-tuning on the rejected tail collapses the student, and every in-loop metric stays flat while true error climbs — the system cannot see its own degradation.