← Back to all news
arXiv AI By Yalda Taheri, Mohammad Hassan Heydari, Armon Rasooli

Yalda-Embedding: Open Development of a Competitive Persian Retrieval Model

Read the original on arXiv AI →

Yalda-Embedding is a 595.8‑million‑parameter Persian retrieval model built by adapting Qwen3‑Embedding‑0.6B and trained on over one million query‑document pairs. It achieves the highest macro‑average score (0.5488) among 0.6B models on eight FaMTEB Persian retrieval tasks, outperforming Qwen3‑Embedding‑0.6B and F2LLM‑v2‑0.6B on every task and approaching the performance of the larger Qwen3‑Embedding‑4B. The authors also conduct an ablation study on contrastive batch size, optimization stabilization, and relational knowledge distillation, showing that the distilled configuration improves all tasks without increasing inference‑time model size and includes hard‑negative evaluation gains despite no explicit hard‑negative mining.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Aug 19

DEPT: Document Embedding Preservation Tuning for Unified Query Expansion and Retrieval

The paper introduces DEPT, a method that trains a single decoder-only large language model to both expand queries and encode documents for retrieval. By preserving document embeddings close to their initial cached values while allowing gradients to flow through the generator, DEPT stabilizes retrieval targets and enables efficient index reuse and online hard‑negative mining. Experiments on the BEIR benchmark with Qwen3‑4B‑Instruct‑2507 and LLaMA‑3.2‑3B‑Instruct show that DEPT outperforms training‑free, independently trained, and staged unified baselines, with ablations confirming the benefits of preservation, whitening, end‑to‑end expansion training, and online negatives.

By Jingyuan Wang, Richong Zhang, Zhijie Nie, Mingxin Li, Yanzhao Zhang
llmsragbenchmarks
More like this →
arXiv Computation and Language
Aug 28

MoganColBERT-TR: A Late-Interaction Multi-Vector Retrieval Model for Turkish

MoganColBERT-TR is a Turkish multi‑vector retrieval model that projects token embeddings from 768 to 128 dimensions and uses MaxSim late interaction for scoring. It builds on the previously trained MoganBERT‑TR encoder, adapting it to the ColBERT objective with a single‑epoch distillation phase using cross‑encoder teacher scores. Evaluated on five Turkish BEIR datasets in a zero‑shot setting, it achieves an overall score of 37.36, outperforming larger models on most datasets.

By Furkan Yilmaz, Habibe Aleyna Tasdemir, Muhammed Faruk Gozay
ragefficiencybenchmarks
More like this →
arXiv Machine Learning
Jun 15

Efficient Rationale-based Retrieval: On-policy Distillation from Generative Rerankers based on JEPA

arXiv:2604. 23336v3 Announce Type: replace-cross Abstract: Unlike traditional fact-based retrieval, rationale-based retrieval typically necessitates cross-encoding of query-document pairs using large language models, incurring substantial computational costs.

By Teng Chen, Sheng Xu, Feixiang Guo, Xiaoyu Wang, Qingqing Gu, Hongyan Li, Luo Ji
llmsragroboticsefficiencybenchmarks
More like this →