deberta-v3-xsmall-zeroshot-v1.1-all-33

Classifies text into arbitrary user-defined categories without requiring labeled training data, using DeBERTa-v3's contrastive learning architecture to map input text and candidate labels into a shared embedding space, then computing similarity scores to determine the most probable class. The model was fine-tuned on 33 diverse NLI datasets to generalize across domain-specific classification tasks, enabling dynamic category definition at inference time without retraining.

Provides pre-quantized weights and ONNX Runtime-compatible serialization to enable sub-100ms inference on CPU and edge devices. The xsmall variant (22M parameters) is quantized to int8 precision, reducing model size from ~90MB to ~45MB while maintaining classification accuracy within 1-2% of full precision. ONNX export enables hardware-accelerated inference across CPU, GPU, and specialized accelerators (TPU, NPU) without PyTorch dependency.

Scores each candidate label independently against input text, enabling multi-label classification where a single text can be assigned multiple categories simultaneously. Unlike single-label classification, the model computes similarity scores for each label without forcing a winner-take-all decision, allowing downstream applications to set custom thresholds per label or use all scores for ranking-based decisions.

While trained exclusively on English NLI data, the model can perform zero-shot classification on non-English text through cross-lingual transfer, leveraging multilingual token embeddings in the DeBERTa-v3 tokenizer. When given non-English input text and English candidate labels, the model maps both to a shared semantic space, enabling classification in languages not explicitly seen during training. Performance degrades gracefully with language distance from English.

Processes multiple text samples in a single batch while allowing each sample to have a different set of candidate labels, without requiring padding or masking of label sets. The model computes classification scores for each (text, label) pair independently, enabling efficient vectorized inference where batch size and label set heterogeneity do not impact computational complexity. Useful for scenarios where label sets vary by sample (e.g., product categorization where different products have different valid categories).