Pith. sign in

REVIEW 2 cited by

Traceable Group-Wise Self-Optimizing Feature Transformation Learning: A Dual Optimization Perspective

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.16893 v1 pith:Z36F4DR5 submitted 2023-06-29 cs.LG

classification cs.LG
keywords featureframeworktransformationgeneralizationrepresentationself-optimizingspacecapability
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Feature transformation aims to reconstruct an effective representation space by mathematically refining the existing features. It serves as a pivotal approach to combat the curse of dimensionality, enhance model generalization, mitigate data sparsity, and extend the applicability of classical models. Existing research predominantly focuses on domain knowledge-based feature engineering or learning latent representations. However, these methods, while insightful, lack full automation and fail to yield a traceable and optimal representation space. An indispensable question arises: Can we concurrently address these limitations when reconstructing a feature space for a machine-learning task? Our initial work took a pioneering step towards this challenge by introducing a novel self-optimizing framework. This framework leverages the power of three cascading reinforced agents to automatically select candidate features and operations for generating improved feature transformation combinations. Despite the impressive strides made, there was room for enhancing its effectiveness and generalization capability. In this extended journal version, we advance our initial work from two distinct yet interconnected perspectives: 1) We propose a refinement of the original framework, which integrates a graph-based state representation method to capture the feature interactions more effectively and develop different Q-learning strategies to alleviate Q-value overestimation further. 2) We utilize a new optimization technique (actor-critic) to train the entire self-optimizing framework in order to accelerate the model convergence and improve the feature transformation performance. Finally, to validate the improved effectiveness and generalization capability of our framework, we perform extensive experiments and conduct comprehensive analyses.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DELTA: Variational Disentangled Learning for Privacy-Preserving Data Reprogramming

    cs.LG 2025-08 reject novelty 6.0 of 10

    DELTA uses reinforcement learning to find useful feature transformations, then a disentangled variational autoencoder to generate transformed features that keep task utility while reducing sensitive-attribute predicti...

  2. GPT-FT: An Efficient Automated Feature Transformation Using GPT for Sequence Reconstruction and Performance Enhancement

    cs.LG 2025-08 conditional novelty 4.0 of 10

    GPT-FT replaces the LSTM encoder-decoder of MOAT with a small decoder-only GPT that both reconstructs transformation sequences and predicts their performance, enabling faster gradient-based feature search.

Pith tools