QuerynAi/queryn-adapter-ada-002_to_fastembed-bge-small
Queryn adapter — ada-002 → fastembed-bge-small
Translates an embedding produced by ada-002 into the embedding space of fastembed-bge-small, so a corpus already embedded with ada-002 can be served against a fastembed-bge-small index without re-embedding it. Part of the Queryn embedding-translation engine.
Specs
Architecture ablation (best test cosine): linear 0.9039 ← saved, deep 0.8973.
Input / output contract
- Input
source_embedding— float32, shape[batch, 1536]. Rawada-002embeddings; the graph L2-normalizes them itself, so pre-normalization is neither required nor harmful. - Output
target_embedding— float32, shape[batch, 384], unit-normalized, infastembed-bge-smallspace. - Batch axis is dynamic.
Usage
import numpy as np, onnxruntime as ort
from huggingface_hub import hf_hub_download
path = hf_hub_download("QuerynAi/queryn-adapter-ada-002_to_fastembed-bge-small", "model.onnx")
sess = ort.InferenceSession(path, providers=["CPUExecutionProvider"])
src = np.random.rand(4, 1536).astype(np.float32) # your ada-002 embeddings
tgt = sess.run(["target_embedding"], {"source_embedding": src})[0]
assert tgt.shape == (4, 384) # unit vectors in fastembed-bge-small spaceTraining
Trained on paired embeddings over a unified multi-domain corpus — arXiv abstracts, Australian case law, SQuAD passages, PubMed abstracts, and crypto/markets news (~350k rows spanning science, legal, QA, medical, and finance). Loss: 1 - mean cosine similarity, Adam, ReduceLROnPlateau, best-epoch checkpoint. Both a linear baseline and the MLP are trained for every pair; the higher-scoring one is published (ties go to linear).
Plots
`ada-002` → all targets: learning curves and best scores (this pair included).
Linear vs. deep for every pair (black ring = saved architecture).
Full adapter set: Queryn Embedding Adapters
Provenance
- Source checkpoint:
models/v1/ada-002_to_fastembed-bge-small.pt(sha25603a7340716cbcf05…) - Converted: 2026-08-30T20:45:22+00:00 · torch 2.13.0 ·
ptConverter.py
License
Released under the MIT license.
