Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCercetare AI

analiza aiqbench

LakeHopper addresses the critical challenge of adapting pre-trained language models for column type annotation across different data lakes without prohibitive retraining costs. By decomposing knowledge transfer into shared, source-specific, and target-specific components, it leverages an LLM as a verifier to maintain output integrity while achieving significant performance gains with minimal supervision. This approach offers a practical solution for scaling data integration pipelines in heterogeneous environments where expert labeling is scarce.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

LakeHopper: Knowledge-Aware Adaptation of Column Type Annotators across Data Lakes

arXiv3 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2602.08793v2 Announce Type: replace Abstract: Column Type Annotation (CTA), which assigns a semantic type to a table column, underpins data integration, cleaning, and search over data lakes. State-of-the-art annotators are pre-trained language models (PLMs) fine-tuned on one particular corpus of tables, i.e., a source data lake, and they degrade sharply once deployed on a new (i.e., target) lake, whose tables and semantic type set both differ. Retraining per lake is prohibitive because it demands large volumes of expert annotations. We recast cross-lake adaptation as a knowledge management problem and make the resulting decomposition explicit: relative to a target annotator, a source annotator holds knowledge that must be discarded (source-specific), realigned and reused (shared), or acquired (target-specific). This decomposition exposes which part of the gap a general-purpose LLM can close and which part only target supervision can. Guided by it, we present LakeHopper, which adapts a source annotator under a fixed annotation budget through three coupled mechanisms: label-set realignment that transplants the output layer for shared types, LLM-verified gap discovery that localizes columns the annotator handles unreliably, and cluster-based propagation plus rehearsal fine-tuning that generalizes each flagged column into a labeling batch without erasing shared knowledge. Casting the LLM as a verifier of the annotator's own predictions rather than an annotator keeps every output inside the target type set, so LakeHopper structurally emits no out-of-domain labels, whereas prompted LLMs hallucinate types on 2.7-47.6% of columns. Across three data lake transfers of differing difficulty, LakeHopperlifts three PLM backbones by up to 71.4% relative macro-F1, reaches near-full-data quality with under 6% of the target labels, and matches fine-tuned table LLMs while training 27-131 times faster.

Abstract:Column Type Annotation (CTA), which assigns a semantic type to a table column, underpins data integration, cleaning, and search over data lakes. State-of-the-art annotators are pre-trained language models (PLMs) fine-tuned on one particular corpus of tables, i.e., a source data lake, and they degrade sharply once deployed on a new (i.e., target) lake, whose tables and semantic type set both differ. Retraining per lake is prohibitive because it demands large volumes of expert annotations. We recast cross-lake adaptation as a knowledge management problem and make the resulting decomposition explicit: relative to a target annotator, a source annotator holds knowledge that must be discarded (source-specific), realigned and reused (shared), or acquired (target-specific). This decomposition exposes which part of the gap a general-purpose LLM can close and which part only target supervision can. Guided by it, we present LakeHopper, which adapts a source annotator under a fixed annotation budget through three coupled mechanisms: label-set realignment that transplants the output layer for shared types, LLM-verified gap discovery that localizes columns the annotator handles unreliably, and cluster-based propagation plus rehearsal fine-tuning that generalizes each flagged column into a labeling batch without erasing shared knowledge. Casting the LLM as a verifier of the annotator's own predictions rather than an annotator keeps every output inside the target type set, so LakeHopper structurally emits no out-of-domain labels, whereas prompted LLMs hallucinate types on 2.7-47.6% of columns. Across three data lake transfers of differing difficulty, LakeHopperlifts three PLM backbones by up to 71.4% relative macro-F1, reaches near-full-data quality with under 6% of the target labels, and matches fine-tuned table LLMs while training 27-131 times faster.

Computation and Language (cs.CL); Databases (cs.DB)

arXiv:2602.08793 [cs.CL]

(or arXiv:2602.08793v2 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2602.08793 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 362 cuvinte

Subiecte conexe