arXiv AI

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

The paper introduces a framework for learning feature transformations on tabular data that addresses three limitations of prior generative methods: neglect of hierarchical feature relationships, bias from order-sensitive embeddings, and reliance on gradient-based search. It combines a permutation‑invariant hierarchical module using self‑attention pooling to capture interactions across features, operations, and abstraction levels, with a policy‑guided multi‑objective reinforcement learning strategy that starts from strong seeds and optimizes both predictive accuracy and transformation efficiency. Experiments on diverse tabular benchmarks show the approach outperforms strong baselines, and the authors provide public code and data.

arXiv AI
Sep 3

Adaptive Graph-of-Islands Evolution for Automatic Feature Engineering with LLMs

The paper introduces TOPOFE, a framework that treats automatic feature engineering for tabular data as a graph-structured multi-island evolutionary search. Each island explores a semantically coherent family of transformations using LLM-guided mutation and crossover, while a Prompt Adaptation Memory steers proposals based on accept/reject feedback. TOPOFE dynamically learns a directed topology graph to coordinate cross-island transfer, enabling the discovery of compositional feature programs that outperform state‑of‑the‑art methods on 29 datasets and produce lower redundancy and higher representational coverage.

By Sha Li, Naren Ramakrishnan
arXiv Machine Learning
Sep 21

LLMs as Feature Engineers for Text-and-Tabular Prediction

The paper presents an iterative framework that uses large language models (LLMs) to automatically extract interpretable, schema‑bound categorical features from unstructured text for use in tabular prediction models. A generator LLM proposes semantic definitions, an extractor LLM materializes the features, and a downstream tabular model evaluates their predictive performance, with error‑driven natural‑language feedback guiding the search. Across three public datasets, the error‑driven loop speeds up feature discovery up to three times and the resulting features outperform any subset when combined with TF‑IDF and dense embeddings, while also providing instance‑level interpretability through SHAP importance rankings and a semantic audit trail.

By Merwan Barlier, Blaz Skrlj
arXiv AI
Aug 17

ArGEnT: Arbitrary Geometry-encoded Transformer for Operator Learning

arXiv:2602. 11626v3 Announce Type: replace-cross Abstract: Learning solution operators on arbitrary geometries remains a central challenge in scientific machine learning, especially for many-query simulation, physics-informed learning, and evolving geometries requiring accurate, geometry-aware predictions at arbitrary spatial locations.

By Wenqian Chen, Zhi-Feng Wei, Yucheng Fu, Michael Penwarden, Pratanu Roy, Panos Stinis
arXiv Machine Learning
Oct 15

OrionMoE-v1.0: A Mixture-of-Experts Foundation Model for Tabular In-Context Learning

OrionMoE-v1.0 is a compact tabular foundation model that uses a dual‑axis Transformer and a sparse mixture‑of‑experts architecture to perform in‑context learning on labeled support tables. It selectively activates experts along the feature axis, guided by both individual feature representations and overall dataset context, enabling adaptive computation across diverse tabular problems. Pretrained on synthetic classification tasks, it achieves competitive performance on multiple benchmarks, especially on small‑context, high‑dimensional, and class‑imbalanced datasets.

By Mohamed Bouadi, Nassim Bouarour, Aditya Tanna, Vinay Kumar Sankarapu
arXiv AI
Sep 30

LoopICL: Looping a single transformer block to solve tabular tasks

LoopICL is a transformer architecture that loops a single block to address tabular tasks. It separates parameter count from computational depth by using a cell stream for per‑cell features and a row stream for in‑context examples, refined via within‑column and cross‑column attention. During pre‑training, varying loop counts and a learned exit‑gate allow the model to adjust inference depth at test time, achieving competitive performance with TabICLv2 while using about 90% fewer parameters.

By Amir Rezaei Balef, Katharina Eggensperger