Field Order Should Not Matter: Permutation-Invariant Embedding Model Fine-Tuning for Structured Metadata Retrieval
We study retrieval over catalogs of structured metadata, where each record is a small schema whose fields answer different kinds of query. Embedding a record with a text encoder first serializes its fields into a string, which forces a choice of field order. We show this choice, usually treated as an implementation detail, silently controls retrieval quality once the encoder is fine-tuned. A standard fine-tune loses 7.4 nDCG@10 points when the index is rebuilt under a different field order, because it reads absolute position instead of the field labels. We propose permutation-invariant fine-tu
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- LinkedLinked via unknownEmbedMax →
- LinkedLinked via unknownEmbedex →
- LinkedLinked via unknownSet up a retrieval pipeline →
- FuzzySimilar title/name (fuzzy) · 59%halfrost/Halfrost-Field →
“Fuzzy title match (0.73): “Field Order Should Not Matter: Permutation-Invariant Embeddi” ≈ “halfrost/Halfrost-Field””
