paper-with-me

홈 › Papers

Field Order Should Not Matter: Permutation-Invariant Embedding Model Fine-Tuning for Structured Metadata Retrieval

2026-06-29 · Aivin V. Solatorio, Olivier Dupriez, Rafael Macalaba arxiv

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-tuning ($\textbf{PI-FT}$), which serializes each record under a freshly sampled field order with random field dropout, so meaning binds to the labels rather than to position. The change is about two lines in the data loader; it costs negligible in-distribution accuracy and cuts the order-change penalty to 0.2 points. We study this in the discovery of development statistics, a catalog of nearly 10,000 indicators that should be searchable in many languages by a model small enough to self-host. As AI assistants and agents increasingly mediate access to public data and statistics, this retrieval step decides whether an answer is grounded in the right indicator or series, making discoverability a precondition for disseminating data through AI. Because usage logs cannot provide training signal for indicators no one has searched, we generate the queries instead. $\textbf{DevDataBench}$ is a fully LLM-generated benchmark of grounded, facet-targeted queries across 15 languages, covering every indicator for both training and evaluation. A fine-tuned 118M-parameter CPU encoder outperforms every zero-shot baseline, including $\texttt{text-embedding-3-large}$ (0.707 vs.\ 0.556 nDCG@10), with the largest gains in low-resource languages. We release the benchmark, pipeline, models, and a reusable PI-FT framework.

📄 PDF Abstract BibTeX arXiv:2606.30473

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Regularizing Towards Permutation Invariance in Recurrent Models

2020-10-25 · NeurIPS 2020 12 · Edo Cohen-Karlik, Avichai Ben David, Amir Globerson

In many machine learning problems the output should not depend on the order of the input. Such "permutation invariant" functions have been studied extensively recently. Here we argue that temporal architectures such as R…

Invariant-Based Diagnostics for Graph Benchmarks

2026-05-07 · Richard von Moos, Mathieu Alain, Bastian Rieck arxiv

Progress on graph foundation models is hindered by benchmark practices that conflate the contributions of node features and graph structure, making it hard to tell whether a model actually learns from connectivity, or wh…

Permutation-equivariant neural networks applied to dynamics prediction

2016-12-14 · Nicholas Guttenberg, Nathaniel Virgo, Olaf Witkowski, Hidetoshi Aoki 외

The introduction of convolutional layers greatly advanced the performance of neural networks on image tasks due to innately capturing a way of encoding and learning translation-invariant operations, matching one of the u…

PredictionTranslation

SetRank: Learning a Permutation-Invariant Ranking Model for Information Retrieval

2019-12-12 · Liang Pang, Jun Xu, Qingyao Ai, Yanyan Lan 외

In learning-to-rank for information retrieval, a ranking model is automatically learned from the data and then utilized to rank the sets of retrieved documents. Therefore, an ideal ranking model would be a mapping from a…

Information RetrievalLearning-To-RankRetrieval

Permutation Invariant Gaussian Matrix Models

2018-09-20 · Sanjaye Ramgoolam

Permutation invariant Gaussian matrix models were recently developed for applications in computational linguistics. A 5-parameter family of models was solved. In this paper, we use a representation theoretic approach to …