Magneto: Combining Small and Large Language Models for Schema Matching
Yurong Liu, Eduardo Pena, Aecio Santos, Eden Wu, Juliana Freire

TL;DR
Magneto is a cost-effective schema matching approach that combines small and large language models through a two-phase pipeline, improving accuracy and efficiency across diverse datasets.
Contribution
It introduces a novel two-phase schema matching pipeline combining SLMs and LLMs, along with a self-supervised fine-tuning method and a new biomedical benchmark.
Findings
Magneto reduces runtime while maintaining high accuracy.
The self-supervised fine-tuning improves SLM performance.
Magneto performs well across multiple domain datasets.
Abstract
Recent advances in language models opened new opportunities to address complex schema matching tasks. Schema matching approaches have been proposed that demonstrate the usefulness of language models, but they have also uncovered important limitations: Small language models (SLMs) require training data (which can be both expensive and challenging to obtain), and large language models (LLMs) often incur high computational costs and must deal with constraints imposed by context windows. We present Magneto, a cost-effective and accurate solution for schema matching that combines the advantages of SLMs and LLMs to address their limitations. By structuring the schema matching pipeline in two phases, retrieval and reranking, Magneto can use computationally efficient SLM-based strategies to derive candidate matches which can then be reranked by LLMs, thus making it possible to reduce runtime…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling
