AI Agents 相关度: 8/10

Causally-Guided Automated Feature Engineering with Multi-Agent Reinforcement Learning

Arun Vignesh Malarkkan, Wangyang Ying, Yanjie Fu
arXiv: 2602.16435v1 发布: 2026-02-18 更新: 2026-02-18

AI 摘要

CAFE框架利用因果图指导自动特征工程,提高特征的鲁棒性和效率。

主要贡献

  • 提出CAFE框架,结合因果发现和强化学习进行特征工程
  • 使用多智能体深度Q学习架构选择特征组和转换算子
  • 验证了因果结构作为软性归纳偏置可以提升 AFE 的鲁棒性和效率

方法论

分为两个阶段:因果图学习和基于多智能体强化学习的特征构建,并采用分层奖励塑造和因果组级别探索策略。

原文摘要

Automated feature engineering (AFE) enables AI systems to autonomously construct high-utility representations from raw tabular data. However, existing AFE methods rely on statistical heuristics, yielding brittle features that fail under distribution shift. We introduce CAFE, a framework that reformulates AFE as a causally-guided sequential decision process, bridging causal discovery with reinforcement learning-driven feature construction. Phase I learns a sparse directed acyclic graph over features and the target to obtain soft causal priors, grouping features as direct, indirect, or other based on their causal influence with respect to the target. Phase II uses a cascading multi-agent deep Q-learning architecture to select causal groups and transformation operators, with hierarchical reward shaping and causal group-level exploration strategies that favor causally plausible transformations while controlling feature complexity. Across 15 public benchmarks (classification with macro-F1; regression with inverse relative absolute error), CAFE achieves up to 7% improvement over strong AFE baselines, reduces episodes-to-convergence, and delivers competitive time-to-target. Under controlled covariate shifts, CAFE reduces performance drop by ~4x relative to a non-causal multi-agent baseline, and produces more compact feature sets with more stable post-hoc attributions. These findings underscore that causal structure, used as a soft inductive prior rather than a rigid constraint, can substantially improve the robustness and efficiency of automated feature engineering.

标签

自动特征工程 因果推断 强化学习 多智能体

arXiv 分类

cs.AI cs.LG cs.MA