arXiv AI By Ismail Lamaakal

Provenance Guided Incremental Learning Under Evolving Concept Definitions

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
3d ago

An Incremental Knowledge-Graph Learner Digital Twin for Evidence-Grounded Early Warning

The paper presents an incremental Learner Digital Twin that uses a lightweight knowledge graph to provide evidence‑grounded early warning in learning analytics. The twin is updated at temporal checkpoints by replaying learning traces and assessment records, enabling both feature extraction and explanation grounding. Evaluated on a public benchmark, the graph‑mediated approach preserves predictive performance while generating alerts that link risk decisions to specific evidence items and raw records.

By Ngoc Luyen Le, Marie-H\'el\`ene Abel, Bertrand Laforge
arXiv Computation and Language
Aug 25

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

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.

By Yushi Sun, Xujia Li, Nan Tang, Quanqing Xu, Chuanhui Yang, Lei Chen