Yalda Embedding, a 595.8-million-parameter Persian retrieval model adapted from Qwen3-Embedding-0.6B, is presented, a 595.8-million-parameter Persian retrieval model using more than one million query-document pairs and achieves the highest macro-average among the evaluated 0.6B models.
Abstract
Despite advances in multilingual text representations, effective dense retrieval for Persian remains constrained by the limited availability of language-specific training resources and compact embedding models. We present Yalda Embedding, a 595.8-million-parameter Persian retrieval model adapted from Qwen3-Embedding-0.6B using more than one million query-document pairs. On eight Persian retrieval tasks from FaMTEB, the model achieves the highest macro-average among the evaluated 0.6B models, scoring 0.5488 and outperforming Qwen3-Embedding-0.6B and F2LLM-v2-0.6B on every task. It also approaches Qwen3-Embedding-4B, winning on four tasks, tying on one, and trailing by 0.0075 in macro-average. An incremental ablation study examines contrastive batch size, optimization stabilization, and relational knowledge distillation from F2LLM-v2-8B. Under the one-epoch training setup, contrastive fine-tuning alone yields a modest mean improvement over initialization and regressions on two tasks. The final distilled configuration improves all eight tasks over the non-distilled model, raising the mean from 0.4813 to 0.5488 without increasing inference-time model size. These gains include hard-negative evaluation tasks despite training without explicitly mined or supplied hard negatives. We release model weights, training and evaluation code, the pairwise dataset, and its teacher-embedded counterpart, enabling inspection of data composition and training procedures, independent evaluation, and reuse without repeating expensive teacher inference.
CharBM25 is established as an effective, GPU-free retrieval strategy that matches or exceeds dense retrieval at negligible computational cost, and combining it with a general-purpose LLM of 12B+ parameters delivers reliable, training-free Devanagari post-OCR correction without task-specific fine-tuning.
Indonesian search systems rarely have labeled data for fine-tuning dense retrievers, yet it is unclear which ready-to-use multilingual encoders can beat a properly configured lexical baseline. This study compares LaBSE, paraphrase-multilingual-mpnet-base-v2, and multilingual-e5-large, used without fine-tuning by the au...
Shinvi Nur Najmil Jannah, Alam Rahmatulloh· Jurnal Aplikasi dan Teori Il...· 0 citations
The approach builds a shared FAISS retrieval index from the official public Task 1 Hugging Face release after normalizing heterogeneous dataset schemas into a unified multiple-choice format.
D. Thenmozhi, Amrit Gopinath, Adithya Sivakumar et al.· 1 citation
GoiBERT, a family of two compact Vietnamese encoders with 26M and 49M parameters that operate directly on raw text, shows that compression is nearly lossless for sentiment and classification tasks but remains costly for inference and entity recognition, which points to clear directions for future work.
Quang Anh Kiet Tran, Nam Anh Tran, Manh-Hung Trinh et al.· 0 citations
The combination of domain adaptation and architectural rigour establishes MythoBERT as a foundational model for computational mythology and opens new avenues in cultural heritage NLP research.
We describe the GHADAI approach to the Ara-Genre 2026 shared task, which requires classifying Arabic text into broad and specific genre categories, including specific genres unseen during training. Our approach is a two-stage pipeline: a fine-tuned multilingual bi-encoder scores all 27,972 test sentences against the 74...
Manar Ali, Ghader Kurdi· Proceedings of The Fourth Ar...· 1 citation