Feature and Instance Joint Selection: A Reinforcement Learning
Perspective
- URL: http://arxiv.org/abs/2205.07867v1
- Date: Thu, 12 May 2022 07:51:32 GMT
- Title: Feature and Instance Joint Selection: A Reinforcement Learning
Perspective
- Authors: Wei Fan, Kunpeng Liu, Hao Liu, Hengshu Zhu, Hui Xiong, Yanjie Fu
- Abstract summary: We propose a reinforcement learning solution to accomplish the joint selection task.
In particular, a sequential-scanning mechanism is designed as action strategy of agents.
Experiments on real-world datasets have demonstrated improved performances.
- Score: 47.704739699011995
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Feature selection and instance selection are two important techniques of data
processing. However, such selections have mostly been studied separately, while
existing work towards the joint selection conducts feature/instance selection
coarsely; thus neglecting the latent fine-grained interaction between feature
space and instance space. To address this challenge, we propose a reinforcement
learning solution to accomplish the joint selection task and simultaneously
capture the interaction between the selection of each feature and each
instance. In particular, a sequential-scanning mechanism is designed as action
strategy of agents, and a collaborative-changing environment is used to enhance
agent collaboration. In addition, an interactive paradigm introduces prior
selection knowledge to help agents for more efficient exploration. Finally,
extensive experiments on real-world datasets have demonstrated improved
performances.
Related papers
- Visual-Geometric Collaborative Guidance for Affordance Learning [63.038406948791454]
We propose a visual-geometric collaborative guided affordance learning network that incorporates visual and geometric cues.
Our method outperforms the representative models regarding objective metrics and visual quality.
arXiv Detail & Related papers (2024-10-15T07:35:51Z) - Cognitive Evolutionary Learning to Select Feature Interactions for Recommender Systems [59.117526206317116]
We show that CELL can adaptively evolve into different models for different tasks and data.
Experiments on four real-world datasets demonstrate that CELL significantly outperforms state-of-the-art baselines.
arXiv Detail & Related papers (2024-05-29T02:35:23Z) - Towards Hybrid-grained Feature Interaction Selection for Deep Sparse
Network [18.759101407874507]
We introduce a hybrid-grained feature interaction selection approach that targets both feature field and feature value for deep sparse networks.
We develop a selection algorithm called OptFeature, which efficiently selects the feature interaction from both the feature field and the feature value simultaneously.
arXiv Detail & Related papers (2023-10-23T20:15:30Z) - Feature Interaction Aware Automated Data Representation Transformation [27.26916497306978]
We develop a hierarchical reinforcement learning structure with cascading Markov Decision Processes to automate feature and operation selection.
We reward agents based on the interaction strength between selected features, resulting in intelligent and efficient exploration of the feature space that emulates human decision-making.
arXiv Detail & Related papers (2023-09-29T06:48:16Z) - Feature Selection: A perspective on inter-attribute cooperation [0.0]
High-dimensional datasets depict a challenge for learning tasks in data mining and machine learning.
Feature selection is an effective technique in dealing with dimensionality reduction.
This paper presents a survey of the state-of-the-art work on filter feature selection methods assisted by feature intercooperation.
arXiv Detail & Related papers (2023-06-28T21:00:52Z) - A metaheuristic multi-objective interaction-aware feature selection
method [5.28539620288341]
We present a novel multi-objective feature selection method that has several advantages.
It considers the interaction between features using an advanced probability scheme.
The proposed method utilizes the introduced probability scheme to produce more promising offsprings.
arXiv Detail & Related papers (2022-11-10T08:56:48Z) - A Hierarchical Interactive Network for Joint Span-based Aspect-Sentiment
Analysis [34.1489054082536]
We propose a hierarchical interactive network (HI-ASA) to model two-way interactions between two tasks appropriately.
We use cross-stitch mechanism to combine the different task-specific features selectively as the input to ensure proper two-way interactions.
Experiments on three real-world datasets demonstrate HI-ASA's superiority over baselines.
arXiv Detail & Related papers (2022-08-24T03:03:49Z) - Attention Option-Critic [56.50123642237106]
We propose an attention-based extension to the option-critic framework.
We show that this leads to behaviorally diverse options which are also capable of state abstraction.
We also demonstrate the more efficient, interpretable, and reusable nature of the learned options in comparison with option-critic.
arXiv Detail & Related papers (2022-01-07T18:44:28Z) - FIVES: Feature Interaction Via Edge Search for Large-Scale Tabular Data [106.76845921324704]
We propose a novel method named Feature Interaction Via Edge Search (FIVES)
FIVES formulates the task of interactive feature generation as searching for edges on the defined feature graph.
In this paper, we present our theoretical evidence that motivates us to search for useful interactive features with increasing order.
arXiv Detail & Related papers (2020-07-29T03:33:18Z) - Improving Multi-Turn Response Selection Models with Complementary
Last-Utterance Selection by Instance Weighting [84.9716460244444]
We consider utilizing the underlying correlation in the data resource itself to derive different kinds of supervision signals.
We conduct extensive experiments in two public datasets and obtain significant improvement in both datasets.
arXiv Detail & Related papers (2020-02-18T06:29:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.