Sign inGet started
Paper · arXiv

Hierarchical and Permutation-Invariant Feature Transformation Learning via Policy-Guided Embedding Search

Feature transformation improves predictive performance on tabular data by constructing informative abstractions from raw features. Recent generative approaches encode transformation knowledge into continuous embedding spaces for efficient exploration of candidate strategies, but face three key limitations: (1) overlooking hierarchical relationships between low-level features, operations, and high-level abstractions; (2) enforcing order-sensitive embeddings on inherently permutation-invariant transformation sequences, thereby introducing systematic bias; and (3) relying on gradient-based search, which is ill-suited to non-convex transformation spaces. We propose a framework with two comple...

AuthorsRui Liu, Tao Zhe, Yanyong Huang et al.
Primary categorycs.LG
Published9 September 2026
Last updated at source9 September 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/763c3ca9-5c42-4a73-bd6b-cc39076a88a3" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.