arXiv:2602.02025 · v3

Hippasus: Accurate and Cost-Efficient Feature Augmentation over Relational Tables

首次提交 2026-02-02 20:21

版本更新 2026-11-11 23:57

雷达观测 2026-11-13 14:16

摘要

ML models critically depend on feature quality, yet in real-world settings, useful features are often distributed across multiple relational tables rather than a single dataset. Feature augmentation addresses this problem by automatically discovering and joining additional tables to enrich a base table with predictive features. However, scaling feature augmentation to complex schemas with many tables and multi-hop relationships is challenging. It requires exploring a large space of join paths, executing costly joins, and selecting useful features from noisy results. Existing approaches suffer from either limited effectiveness or efficiency. Restricting exploration to simple joins limits predictive performance, while more expressive methods rely on expensive training data, lack scalability, or fail to fully exploit schema-level semantics. We present Hippasus, a cost-aware, LLM-guided feature augmentation framework over relational schemas, that addresses these challenges. Hippasus ranks candidate join paths before executing any join, by combining lightweight statistical signals with adaptive semantic analysis, invoking an LLM only when necessary. It further introduces efficient multi-way join execution with cross-path feature consolidation, and a hybrid feature selection strategy that integrates statistical relevance with semantic refinement. Experiments on 13 real-world datasets show that Hippasus improves predictive performance by up to 15.7% on average over state-of-the-art methods, while running on par with the fastest of them and keeping its LLM token cost low.