SAVRN Model Hub
Open-Weight Models
An open-weight model is an AI model whose trained weights are published for anyone to download. The weights are what the model learned in training. With a copy of them you can run the model on hardware you control and train it further on your own data.
Open weights are not the same as open source. Many publishers release the weights without the training data or code, and the license sets what you may do with the model. This library puts each model's full card, architecture, files, license and published evaluations on one page.
Updated 2026-10-20 · How the library is built
11,734 models, sorted by most downloaded.
A hidden Markov model distilled from mhdang/gelatwo-common-gen-gpt2-large, used as the tractable proposal for keyword-constrained generation on CommonGen in Mitigating Bias in Locally Constrained Decoding via Tractable Proposals (arXiv:2606.01926). Locally constrained decoding (LCD) enforces a constraint by masking next tokens one step at a time, which biases the samples it draws. P-GCD instead combines this HMM with a tensorized finite automaton to form a proposal that carries both the logical and the probabilistic information about the target distribution, and samples from it with sequential Monte Carlo. The HMM supplies the lookahead the This is not a fine-tune of the base LM and shares…
gpt2-large fine-tuned on CommonGen, used as the base language model for the CommonGen experiments in Mitigating Bias in Locally Constrained Decoding via Tractable Proposals (arXiv:2606.01926). This is a plain causal language model: it supplies the base distribution that GCD and P-GCD steer. The tractable proposal it is paired with is the HMM at which shares its 50257-token vocabulary. configs/common-gen.yaml in github.com/MhDang/gelatwo already points at this checkpoint, so the CommonGen runs need no override.
A hidden Markov model distilled from meta-llama/Llama-3.1-8B-Instruct, used as the tractable proposal for SQL-constrained text-to-SQL on Spider in Mitigating Bias in Locally Constrained Decoding via Tractable Proposals (arXiv:2606.01926). Locally constrained decoding (LCD) enforces a constraint by masking next tokens one step at a time, which biases the samples it draws. P-GCD instead combines this HMM with a tensorized finite automaton to form a proposal that carries both the logical and the probabilistic information about the target distribution, and samples from it with sequential Monte Carlo. The HMM supplies the lookahead the This is not a fine-tune of the base LM and shares none of…
A hidden Markov model distilled from meta-llama/Llama-3.1-8B-Instruct, used as the tractable proposal for constrained tool calling on xLAM (function-call template) in Mitigating Bias in Locally Constrained Decoding via Tractable Proposals (arXiv:2606.01926). Locally constrained decoding (LCD) enforces a constraint by masking next tokens one step at a time, which biases the samples it draws. P-GCD instead combines this HMM with a tensorized finite automaton to form a proposal that carries both the logical and the probabilistic information about the target distribution, and samples from it with sequential Monte Carlo. The HMM supplies the lookahead the This is not a fine-tune of the base LM…
A hidden Markov model distilled from meta-llama/Llama-3.1-8B-Instruct, used as the tractable proposal for constrained tool calling on xLAM (JSON template) in Mitigating Bias in Locally Constrained Decoding via Tractable Proposals (arXiv:2606.01926). Locally constrained decoding (LCD) enforces a constraint by masking next tokens one step at a time, which biases the samples it draws. P-GCD instead combines this HMM with a tensorized finite automaton to form a proposal that carries both the logical and the probabilistic information about the target distribution, and samples from it with sequential Monte Carlo. The HMM supplies the lookahead the This is not a fine-tune of the base LM and shares…
LoRA adapter for google/gemma-3-12b-it trained to answer the Polish history matura (poziom rozszerzony, CKE). Built at the Warsaw Model Trainers Hackathon (team repo: WarsawModelTrainersHackathon, src/posttrain/). SFT (QLoRA r=32 on the mixed matura set, no thinking; repo gemma-3-12b-it-matura-history-sft-qlora-r32), then GRPO with Unsloth + TRL on closed exam items with an exact key (single choice, true/false, matching, ordering). Reward = 0.2format + 0.8exact match, Dr.GRPO loss, beta=0 (no KL). THIS VERSION: GRPO step 25 (interim); the full 300-step run replaces it when it finishes. Closed-question exact match on validation (321 items, no judge): 68.2 overall (SFT alone 66.4, base 45.5).…
LoRA adapter for google/gemma-3-12b-it trained to answer the Polish history matura (poziom rozszerzony, CKE). Built at the Warsaw Model Trainers Hackathon (team repo: WarsawModelTrainersHackathon, src/posttrain/). Supervised fine-tuning (QLoRA) of Gemma 3 12B-it on the same mixed set; Gemma 3 has no thinking mode, so teacher traces contribute their final answers only. LoRA r=32, alpha=64, lr 1e-4 cosine, 1 epoch, batch 16, maxlen 6144, Unsloth + TRL Consolidated training set data/trainingdatasets/sfttrain.jsonl (buildsft.py): real CKE papers 2005–2026 with keys, rephrased papers, synthetic image tasks, synthetic full papers, e-podręczniki textbook questions, synthetic Claude/DeepSeek tasks…
Research checkpoint. google/gemma-3-12b-it was continued-pretrained (full weights, lr 1e-05, 1 epoch, 18,217,396 tokens, 22,351 documents, of which 0 self-authored and 22,351 ordinary text) on a corpus the model wrote for the training of the next version of itself, as the character it already is, after being told how its character came to be and how SDF works. Corpus: joshycodes/qwen-constitutional-sdf-corpus. Framing, plan and evaluation: the welfare-improvements repository. Not evaluated for capability, alignment or identity yet. Do not deploy.
This model is a fine-tuned version of google/gemma-3-4b-it. It has been trained using TRL. This model was trained with SFT.
This model is a fine-tuned version of google/gemma-3-4b-it. It has been trained using TRL. This model was trained with SFT.
This model is a fine-tuned version of google/gemma-3-4b-it. It has been trained using TRL. This model was trained with SFT.
Model Collections
Hand-picked starting points, each with the reason it exists.
Collection · 4 entries
Embedding models for retrieval
Sentence and document embedding models used to build retrieval systems. Dimension and sequence length matter more than size here, and both come from the publisher.
Collection · 4 entries
Models that fit on one accelerator
Models whose publisher-reported parameter count puts them within reach of a single accelerator at common precisions. Memory needed depends on precision and serving configuration, so treat the parameter count as the starting point, not the answer.
Collection · 6 entries
Open-weight text models worth knowing
Widely used open-weight language models, chosen because each one is a distinct family rather than a variant of the one above it. Selection, not a ranking.
Collection · 3 entries
Speech and audio models
Recognition and synthesis models, grouped so the two directions are easy to compare.
Open-Weight Models Explained
What is an open-weight model?
An AI model whose trained weights are published for anyone to download, so it can be run, tested and fine-tuned on hardware the user controls.
Is an open-weight model the same as open source?
Not always. Open weights means the trained model can be downloaded. Open source usually also means the training code and data are available and the license allows broad reuse. Many open-weight models release the weights only.
Can I use an open-weight model commercially?
It depends on the license. Apache 2.0 and MIT allow commercial use. Other licenses limit it, for example to non-commercial use or below a set number of users. Every model page here shows its license.
How much memory does an open-weight model need?
About two bytes per parameter at 16-bit precision, so a 7-billion-parameter model needs roughly 14 GB for its weights, plus memory for the context it processes. Each model page lists its parameter count and the size of its files.
Related SAVRN Research
The hub sits beside SAVRN's market data and infrastructure research: what models cost to run, and what it takes to run them.
SAVRN Index
What open models cost to run
The same open-weight model priced by every host that serves it, per million tokens.
Research Hub
Data center trackers and maps
Moratoriums, permits, power, water and capital behind the facilities that run these models.
Method
How the Model Hub is built
Sources, evidence labels, refresh behaviour, and the limits of every comparison here.