Skip to content
Other

ProofKV-scorer

a model for compiling proof chains into KV memory

2 min readupdated

ProofKV-scorer is a set of cross-encoder checkpoints built on microsoft/MiniLM-L12-H384-uncased with roughly 33 million parameters, created for the ProofKV research project from an EACL 2027 paper. The model reads a document once, finds and scores relevant text spans and the links between them, and builds a reusable evidence base for question-answering (QA) systems. Unlike standard full-context scanning methods, it selects chains of facts under a strict KV memory budget and passes them to a decoder. It is useful for researchers and developers working on multi-hop retrieval across long documents and LLM optimization.

Key features

  • Three specialized heads: start and end heads for scoring text spans against a question, plus a nine-position linking head for paired spans.
  • Compact size: a 12-layer architecture with 384 hidden states (~33M parameters), initialized from MiniLM.
  • Ready-to-use checkpoints: a final interpolated version for broad task coverage and a separate checkpoint trained on MuSiQue replays.
  • Repository integration: full compatibility with the ProofKV release scripts for selector verification and testing.

What you can do

  • QA research: reproduce experiments from the paper on compiling proof chains for structured answer retrieval.
  • Decoder integration: pair the scorer with models like Qwen2.5-14B to test packed contexts and distractor handling.
  • Retrieval analysis: run missing-hop evaluations, iterative search, and fixed-byte-budget matrix generation.

Example

from huggingface_hub import snapshot_download

snapshot_download("XingjianZhangDev/ProofKV-scorer", local_dir="checkpoints",
                  allow_patterns=["proofkv_scorer_*/*"])

from proofkv.proofcache.model import TypedRelationScorer
scorer, tokenizer = TypedRelationScorer.load_checkpoint("checkpoints/proofkv_scorer_final", device="cuda")
Read moreDetails
Benchmarks: five-task suite from the paper, including HotpotQA, 2WikiMultiHopQA, and MuSiQue.
Training: AdamW optimizer with a 2e-5 learning rate, 0.01 weight decay, batch size 48, and 1.0 gradient clipping.
Limitations: maximum input length is 320 tokens; the model is designed for English.
License: MIT.
Discuss Telegram 1

Will it run?

Runs in BF16

Fits without quantisation.

  • BF16weights 0.1 GB · ready files0.6 GB
  • FP8 / INT8recommendedweights 0.1 GB0.6 GB
  • 4-bitweights 0.0 GB0.5 GB

Tip: go 8-bit.FP8 / INT8 is within about a percent of full precision in quality, takes half the memory and runs faster on RTX 40/50 and H100. Full precision only pays off for fine-tuning.

What to get for this model

Massed ComputeOpen Massed Compute

Your own GPU: FP8 / INT8 — from RTX 2060 · BF16 — from RTX 2060

Massed Compute hourly prices, November 2026. The discounted price applies with the coupon at checkout.

Estimate: weights plus working memory. Long videos, high resolutions and long contexts need more.

Run it on Massed Compute

The script downloads the model to the rented machine. How to run it is in the model card.

  1. 1. Rent a machine with a fitting GPU

    Open Massed Compute
  2. 2. Paste the script into the machine's terminal

    Connect over SSH (the Massed Compute panel shows the command) or open a terminal on the machine's desktop.

    HF_TOKEN / CIVITAI_TOKENThe script starts with token lines: paste yours between the quotes. The Hugging Face token is for gated models, the Civitai one for Civitai models.

    # XingjianZhangDev/ProofKV-scorer
    mkdir -p ~/models
    curl -LsSf https://astral.sh/uv/install.sh | sh
    source "$HOME/.local/bin/env"
    uv tool install "huggingface_hub[cli]"
    hf download XingjianZhangDev/ProofKV-scorer --local-dir ~/models/ProofKV-scorer
    # The model is in ~/models. How to run it is in the model card (link above).
    Add more LoRAs to ProofKV-scorer
  3. 3. Use it

    The model is in ~/models. How to run it is in the model card (link above).

Stop the machine in the panel when you are done: it bills by the minute while it runs.

How to speed it up

Picked for this model type. Choose your hardware above to see what fits you exactly.

  • FlashAttention 44.0.0b40from November 18, 2026new release

    fastest exact attention on B200

    Kernels for Blackwell (beta). Exact attention without quantisation — fine for everything, LLMs included.

    How to enable: pip install flash-attn-4; vLLM and SGLang pick it up themselves.

    Earlier generations (2)
    • FlashAttention 3 — The Hopper (H100/H200) version with FP8.
    • FlashAttention 2 — The standard for RTX 30/40/50 and A100: exact attention without the memory cost of long contexts.
  • torch.compile2.15.0from October 28, 2026new release

    10–30% for free

    Compiles the model for your GPU. Slower first run, faster afterwards.

    How to enable: model = torch.compile(model); in ComfyUI the TorchCompileModel node.

Model family

New posts about versions of MiniLM-L12-H384-uncased (quants, finetunes, LoRAs) will show up under the bell.

Quantised versions 11All on Hugging Face
Fine-tunes 12All on Hugging Face

About the model

XingjianZhangDev/ProofKV-scorer
Author
XingjianZhangDev
Category
Other
Released
Posted

On NeyroLearn

Hugging Face

01

Ask AI about this model

Answered by Gemini 4 · the chat is kept only in this tab

Comments