LakeHopper is a method for adapting column type annotators (CTA) from one data lake to another by treating cross‑lake adaptation as a knowledge‑management problem. It decomposes the source annotator’s knowledge into source‑specific, shared, and target‑specific parts, and then uses three mechanisms—label‑set realignment, LLM‑verified gap discovery, and cluster‑based propagation with rehearsal fine‑tuning—to adapt the annotator under a limited annotation budget. The approach achieves up to a 71.4% relative macro‑F1 improvement over three PLM backbones, reaches near‑full data quality with less than 6% of target labels, and trains 27–131 times faster than fine‑tuned table LLMs.
arXiv:2603.20004v4 Announce Type: replace-cross Abstract: Translating natural language questions to SQL queries (Text-to-SQL) is a long-standing problem in database research. Recent efforts have focu...
arXiv:2608. 11889v1 Announce Type: cross Abstract: Prompting-based (\textit{i}.
arXiv:2606. 12387v1 Announce Type: cross Abstract: Large Language Models (LLMs) have democratized database access through Text-to-SQL, but moving from prototypes to production remains difficult.
arXiv:2606. 08090v1 Announce Type: cross Abstract: Evaluating a natural-language yes/no predicate over a document corpus under an accuracy target - the semantic filter - is a cornerstone of LLM-based data processing.
arXiv:2606. 24734v1 Announce Type: cross Abstract: High-quality annotations of structured representations are expensive to collect over large corpora.
arXiv:2606. 28601v1 Announce Type: cross Abstract: Recent progress in Text-to-SQL has been driven by stronger language models and prompting strategies, yet performance on real enterprise benchmarks such as Spider 2.
arXiv:2607. 28680v1 Announce Type: cross Abstract: Entity linking in tables matches short and ambiguous cell mentions to their corresponding knowledge-base entities.
The paper introduces a provenance-guided incremental learning framework that handles rule-induced concept shift, where target definitions are explicitly revised and previously stored instances receive new semantic labels. By compiling concept changes into structured rule deltas, tracing affected records through historical provenance, and selectively re-evaluating only a localized candidate region, the method automatically relabels executable revisions, manages ambiguous cases with selective supervision, and repairs predictors incrementally. Evaluation on the RuleShift-Bench benchmark—covering financial, demographic, cybersecurity, and graph-structured data—shows 92.3% accuracy and 90.2% Macro‑F1, reprocessing only 14.7% of the historical collection and achieving an average update latency of 179 s versus 993 s for full relabeling and retraining.
arXiv:2608.30627v1 Announce Type: new Abstract: As language-model compute continues to scale, high-quality training data is becoming an increasingly important bottleneck. Conventional next-token pred...
arXiv:2607. 06799v1 Announce Type: cross Abstract: Evaluating uncertainty in AI-generated SQL queries requires estimating whether a query is correct, where correct means it executes to the same result as a human-written reference.
arXiv:2608. 08056v1 Announce Type: new Abstract: Medical data, by its nature, exhibit a high degree of heterogeneity on multiple levels ranging from (a) different modalities like images, text and time series, (b) diverse tabular schemata introduced by institutions and (c) completely unstructured textual information data provided by healthcare professionals.
arXiv:2607. 15232v1 Announce Type: cross Abstract: A tokenizer fixed at the start of pre-training allocates vocabulary in proportion to the pre-training corpus, reflecting the deployment priorities at that time.