Cited by 33Machine Learning and Data ClassificationReinforcement Learning in RoboticsAdvanced Bandit Algorithms Research

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Feature Augmentation with Reinforcement Learning

Liu, Jiabin, Chai, Chengliang, Luo, Yuyu, Lou, Yin, Feng, Jianhua, Tang, Nan·2022·2022 IEEE 38th International Conference on Data Engineering (ICDE)

Abstract

Sufficient good features are indispensable to train well-performed machine learning models. However, it is com-mon that good features are not always enough, where feature augmentation is necessary to enrich high-quality features by joining with other tables. There are two main challenges for the problem. Given a set of tables where we can augment features from, the first challenge is that there are a lot of ways of joining multiple tables and deciding which features (or attributes) to use - selecting the best set of features to augment is hard. Moreover, we may need to materialize the join results for different join options, doing full materialization might be time consuming - efficient but approximate methods are needed. In this paper, we first introduce the design space of the feature augmentation problem. Then, to address the above challenges, we propose a reinforcement learning based framework, namely AutoFeature, to augment the features following an exploration-exploitation strategy. AutoFeature keeps exploring the features in tables that have led to performance improvement. At the same time, AutoFeature also exploits the tables (features) that are rarely selected. In this way, the search space of tables (features) to be augmented can be well explored and a subset of good features can be selected. AutoFeature utilizes sampling techniques to achieve high efficiency. We implement two algorithms, one with multi-arm bandit and the other with branch Deep Q Networks (branch DQ…

Overview

Integrity signals

Registry

Crossref · 10.1109/icde53745.2022.00317

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • In reinforcement learning, positive feedback from a certain action results in a positive reward; based on this positive reward, the parameters of the policy model are adjusted to increase the probability of selecting this action in the corresponding state; conversely, if it is negative feedback, the parameters of the model will be adjusted to decrease the probability of selecting this action. The

    “In reinforcement learning, positive feedback from a certain action results in a positive reward. Based on this positive reward, the parameters of the policy model are adjusted to increase the probability of selecting this action in the corresponding state. Conversely, if it is negative feedback, the parameters of the model will be adjusted to decrease the probability of selecting this action. The”

    From Human-inspired Perspectives: A Survey on AI Long-term Memory (2024) · cites this paper as [21]

  • The loop of 'primitive action - feedback - update procedural memory - improved action' described in the bicycle riding example is similar to reinforcement learning in AI.

    “The loop of 'primitive action - feedback - update procedural memory - improved action' described in the bicycle riding example is similar to reinforcement learning in AI [19, 21, 22].”

    From Human-inspired Perspectives: A Survey on AI Long-term Memory (2024) · cites this paper as [21]

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 40

  1. 10.1609/aaai.v30i1.10295 · DOI · Paper page
  2. 10.1609/aaai.v32i1.11798 · DOI
  3. pfeffermann, 2009, Sample surveys design methods and applications
  4. 10.1109/TC.1977.1674939 · DOI
  5. 10.14778/3476311.3476333 · DOI
  6. 10.14778/3229863.3236226 · DOI
  7. 10.14778/3157794.3157804 · DOI
  8. scheffe, 1999, The Analysis of Variance, 72
  9. schaul, 2016, Prioritized experience replay
  10. 10.14778/3523210.3523223 · DOI
  11. 10.1007/11564096_42 · DOI
  12. 10.1109/TKDE.2022.3148237 · DOI
  13. 10.1016/j.compeleceng.2013.11.024 · DOI · Paper page
  14. 10.1145/2939672.2939785 · DOI · Paper page
  15. 10.14778/3397230.3397235 · DOI
  16. 10.1007/s41019-021-00164-2 · DOI
  17. 10.1016/j.patrec.2005.10.010 · DOI · Paper page
  18. fernandez, 2018, Aurum: A data discovery system, ICDE, 1001
  19. fernandez, 2018, Seeping semantics: Linking datasets using word embeddings for data discovery, ICDE 2018, 989
  20. 10.1007/978-3-540-85053-3_27 · DOI
  21. lehmann, 2006, Theory of Point Estimation
  22. 10.1109/72.298224 · DOI
  23. 10.1145/2882903.2882952 · DOI
  24. 10.1109/SFCS.2000.892116 · DOI
  25. 10.1109/IJCNN.2019.8852410 · DOI
  26. 10.1145/3035918.3064036 · DOI
  27. 10.1007/978-3-642-00296-0_5 · DOI
  28. 10.1145/3318464.3389772 · DOI
  29. 10.1016/S0004-3702(97)00063-5 · DOI
  30. 10.1145/2882903.2915252 · DOI
  31. goldberg, 1989, Genetic Algorithms in Search Optimization and Machine Learning
  32. 10.1023/A:1012487302797 · DOI · Paper page
  33. guyon, 2003, An introduction to variable and feature selection, J Mach Learn Res, 3, 1157
  34. 10.1016/j.cobeha.2020.10.001 · DOI
  35. 10.1016/B978-1-55860-335-6.50023-4 · DOI
  36. wang, 2016, Dueling network architectures for deep reinforcement learning, ICML 2016, 48, 1995
  37. 10.1109/ICDE48307.2020.00196 · DOI
  38. 10.1016/S0004-3702(97)00043-X · DOI
  39. 10.1109/TKDE.2020.2994641 · DOI
  40. 10.1109/ICNN.1995.488968 · DOI · Paper page

Cited by

Sorted by citations

  • Human-inspired Perspectives: A Survey on AI Long-term Memory

    He, Z., Lin, W., Zheng, H., Zhang, F., Jones, M. W., Aitchison, L., Xu, X., Liu, M., Kristensson, P. O., & Shen, J. (2024) · arXiv · doi:10.48550/arxiv.2411.00489 · Cited by 3

    “Furthermore, it aids in mastering procedural abilities, such as developing strategy selection capabilities through production rules or reinforcement learning, thus enhancing agents’ adaptability [16, 17, 18, 19, 20, 21, 22].”

Metadata

Authors
Liu, J., Chai, C., Luo, Y., Lou, Y., Feng, J., & Tang, N.
Affiliations
  • Tsinghua University (CN)
  • Ant Group (China) (CN)
  • Quantum Chemistry Research Institute (JP)
Venue
2022 IEEE 38th International Conference on Data Engineering (ICDE)
Publisher
IEEE
Published
2022-05
Pages
3360-3372
ISSN
1084-4627 (ISSN-L)
OpenAlex
W4289533982
Cited by
33
References
1
Citations by year
2026: 1 · 2025: 6 · 2024: 15 · 2023: 5 · 2022: 6
FWCI
4.42
Type
conference paper
Language
en
Open access
closed
Locations
IEEE International Conference on Data Engineering (ICDE) (publishedVersion)
Funders
  • NSF of China (61925205,62102215,62072261)
  • China National Postdoctoral Program for Innovative Talents (BX2021155)
  • China Postdoctoral Science Foundation (2021M691784)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
Keywords
feature augmentation, table joining, reinforcement learning, exploration-exploitation, multi-armed bandits, deep Q-network, feature selection

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review