Model reference · open weights

deberta

Embeddings deepvk Embeddings 1 build Open weights 731 dl/mo

deberta is an open-weight embedding model from deepvk. deberta-v1-base (FP32) weighs 248 MB; the smallest configuration that runs it is RTX 3060 12 GB.

For self-hosting, compare this build's requirements below with the GPU you plan to rent.

  • DeBERTa is a pretrained bidirectional encoder developed by deepvk for feature extraction tasks.
  • The model contains 124M parameters and supports Russian and English languages.
  • It is licensed under Apache 2.0 and has a maximum context length of 512 tokens.

Summary of the deepvk/deberta-v1-base model card, 2026-10-01

What it is

Released bydeepvk
Released2023-02-07
Parameters124M
VRAM248 MB for the weights

What it runs on

Memory and cards for deberta-v1-base (FP32)

248 MBweights, file size
1.1 GBruntime overhead
CardRunsMemory
RTX 3060 12 GBfits11.6 GB
RTX 4060 Ti 16 GBfits15.4 GB
RTX 3090 24 GBfits23.4 GB
RTX 4090 24 GBfits23.4 GB
RTX 5090 32 GBfits31.0 GB
L40S 48 GBfits44.0 GB
A100 80 GBfits78.2 GB
H100 80 GBfits78.1 GB
RTX PRO 6000 Blackwell 96 GBfits93.8 GB
DGX Spark (GB10) 128 GB unifiedfits107 GB
H200 141 GBfits138 GB
B200 180 GBfits176 GB

From the model card

What deepvk says about deberta

Read the model card

Pretrained bidirectional encoder for russian language. The model was trained using standard MLM objective on large text corpora including open social data. See Training Details section for more information.

⚠️ This model contains only the encoder part without any pretrained head.

  • Developed by: deepvk
  • Model type: DeBERTa
  • Languages: Mostly russian and small fraction of other languages
  • License: Apache 2.0

How to Get Started with the Model

from transformers import AutoTokenizer, AutoModel

tokenizer = AutoTokenizer.from_pretrained("deepvk/deberta-v1-base")
model = AutoModel.from_pretrained("deepvk/deberta-v1-base")

text = "Привет, мир!"

inputs = tokenizer(text, return_tensors='pt')
predictions = model(**inputs)

Training Details

Training Data

400 GB of filtered and deduplicated texts in total. A mix of the following data: Wikipedia, Books, Twitter comments, Pikabu, Proza.ru, Film subtitles, News websites, and Social corpus.

Deduplication procedure
  1. Calculate shingles with size of 5
  2. Calculate MinHash with 100 seeds → for every sample (text) have a hash of size 100
  3. Split every hash into 10 buckets → every bucket, which contains (100 / 10) = 10 numbers, get hashed into 1 hash → we have 10 hashes for every sample
  4. For each bucket find duplicates: find samples which have the same hash → calculate pair-wise jaccard similarity → if the similarity is >0.7 than it's a duplicate
  5. Gather duplicates from all the buckets and filter

Training Hyperparameters

ArgumentValue
Training regimefp16 mixed precision
OptimizerAdamW
Adam betas0.9,0.98
Adam eps1e-6
Weight decay1e-2
Batch size2240
Num training steps1kk
Num warm-up steps10k
LR schedulerLinear
LR2e-5
Gradient norm1.0

The model was trained on a machine with 8xA100 for approximately 30 days.

Architecture details

ArgumentValue
Encoder layers12
Encoder attention heads12
Encoder embed dim768
Encoder ffn embed dim3,072
Activation functionGeLU
Attention dropout0.1
Dropout0.1
Max positions512
Vocab size50266
Tokenizer typeByte-level BPE

Evaluation

We evaluated the model on Russian Super Glue dev set. The best result in each task is marked in bold. All models have the same size except the distilled version of DeBERTa.

ModelRCBPARusMuSeRCTERRaRUSSERWSDDaNetQAScore
vk-deberta-distill0.4330.560.6250.590.9430.5690.7260.635
vk-roberta-base0.460.560.6790.7690.9600.5690.6580.665
vk-deberta-base0.4500.610.7220.7040.9480.5780.760.682
vk-bert-base0.4670.570.5870.7040.9530.5830.7370.657
sber-bert-base0.4910.610.6630.7690.9620.5740.6780.678

Quoted from the model card on Hugging Face. The full card is behind the Hugging Face link above.

How it works

How embedding models work

Your textsentence / documentEncodermaps meaningVectorlist of numbersAn embedding model turns text into a vector, so similar meanings sit close together, which is the basis of search and RAG.
© 2026 AxForge · EU-hosted AI infrastructure Pricing Docs Trust Privacy Terms