mlsanityData to 7 Oct 2026

Unsupervised Generative Feature Transformation via Graph Contrastive Pre-training and Multi-objective Fine-tuning

arXiv 2405.16879 ↗First posted 27 May 2024cs.LG cs.AIcited by 21

Not on the map. Why?

Abstract (arXiv)

Feature transformation is to derive a new feature set from original features to augment the AI power of data. In many science domains such as material performance screening, while feature transformation can model material formula interactions and compositions and discover performance drivers, supervised labels are collected from expensive and lengthy experiments. This issue motivates an Unsupervised Feature Transformation Learning (UFTL) problem. Prior literature, such as manual transformation, supervised feedback guided search, and PCA, either relies on domain knowledge or expensive supervised feedback, or suffers from large search space, or overlooks non-linear feature-feature interactions. UFTL imposes a major challenge on existing methods: how to design a new unsupervised paradigm that captures complex feature interactions and avoids large search space? To fill this gap, we connect graph, contrastive, and generative learning to develop a measurement-pretrain-finetune paradigm for UFTL. For unsupervised feature set utility measurement, we propose a feature value consistency preservation perspective and develop a mean discounted cumulative gain like unsupervised metric to evaluate feature set utility. For unsupervised feature set representation pretraining, we regard a feature set as a feature-feature interaction graph, and develop an unsupervised graph contrastive learning encoder to embed feature sets into vectors. For generative transformation finetuning, we regard a feature set as a feature cross sequence and feature transformation as sequential generation. We develop a deep generative feature transformation model that coordinates the pretrained feature set encoder and the gradient information extracted from a feature set utility evaluator to optimize a transformed feature generator.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). Builds on 15 of its 41 references that are in the map. First posted on arXiv 27 May 2024.

Builds on

15 of 41 references.

References · 15

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2019AutoML: A Survey of the State-of-the-Artcited by 388
  5. 2017Feature Engineering for Predictive Modeling using Reinforcement Learningcited by 78
  6. 2019The autofeat Python Library for Automated Feature Engineering and Selectioncited by 73
  7. 2020AutoML to Date and Beyond: Challenges and Opportunitiescited by 63
  8. 2021Automated Machine Learning on Graphs: A Surveycited by 38
  9. 2022Group-wise Reinforcement Feature Generation for Optimal and Explainable Representation Space Reconstructioncited by 35
  10. 2017One button machine for automating feature engineering in relational databasescited by 32
  11. 2021AutoDS: Towards Human-Centered Automation of Data Sciencecited by 32
  12. 2023Self-optimizing Feature Generation via Categorical Hashing Representation and Hierarchical Reinforcement Crossingcited by 30
3 more
  1. 2023Reinforcement-Enhanced Autoregressive Feature Transformation: Gradient-steered Search in Continuous Space for Postfix Expressionscited by 23
  2. 2019Techniques for Automated Machine Learningcited by 17
  3. 2024Automated data processing and feature engineering for deep learning and big data applications: a surveycited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 16; 2026: 2.

21 papers.

Sort:

By area:

  1. 2025GRAVER: Generative Graph Vocabularies for Robust Graph Foundation Models Fine-tuningcited by 13
  2. 2024Topology-aware Reinforcement Feature Space Reconstruction for Graph Datacited by 11
  3. 2025Unsupervised Feature Transformation via In-context Generation, Generator-critic LLM Agents, and Duet-play Teamingcited by 11
  4. 2024GUME: Graphs and User Modalities Enhancement for Long-Tail Multimodal Recommendationcited by 8
  5. 2025Teaching Time Series to See and Speak: Forecasting with Aligned Visual and Textual Perspectivescited by 7
  6. 2025Continuous Optimization for Feature Selection with Permutation-Invariant Embedding and Policy-Guided Searchcited by 6
  7. 2025Autonomous Data Agents: A New Opportunity for Smart Datacited by 6
  8. 2025FastFT: Accelerating Reinforced Feature Transformation via Advanced Exploration Strategiescited by 5
  9. 2025LLM-ML Teaming: Integrated Symbolic Decoding and Gradient Search for Valid and Stable Generative Feature Transformationcited by 5
  10. 2025Bridging the Domain Gap in Equation Distillation with Reinforcement Feedbackcited by 4
  11. 2025Permutation-Invariant Representation Learning for Robust and Privacy-Preserving Feature Selectioncited by 4
  12. 2025DELTA: Variational Disentangled Learning for Privacy-Preserving Data Reprogrammingcited by 3
9 more
  1. 2025Towards Data-Centric AI: A Comprehensive Survey of Traditional, Reinforcement, and Generative Approaches for Tabular Data Transformationcited by 2
  2. 2025Collaborative Multi-Agent Reinforcement Learning for Automated Feature Transformation with Graph-Driven Path Optimizationcited by 2
  3. 2026Hierarchical and Permutation-Invariant Feature Transformation Learning via Policy-Guided Embedding Searchcited by 2
  4. 2024Building a Chinese Medical Dialogue System: Integrating Large-scale Corpora and Novel Modelscited by 1
  5. 2025Data-Efficient Symbolic Regression via Foundation Model Distillationcited by 1
  6. 2025Dataforge: Agentic Platform for Autonomous Data Engineeringcited by 1
  7. 2025TreeNet: Layered Decision Ensemblescited by 0
  8. 2025Heterogeneous Multi-Agent Reinforcement Learning with Attention for Cooperative and Scalable Feature Transformationcited by 0
  9. 2026Multi-Agent Procedural Graph Extraction with Structural and Logical Refinementcited by 0