Active Feature Acquisition with Supervised Matrix Completion
Not on the map. Why?
Abstract (arXiv)
Feature missing is a serious problem in many applications, which may lead to low quality of training data and further significantly degrade the learning performance. While feature acquisition usually involves special devices or complex process, it is expensive to acquire all feature values for the whole dataset. On the other hand, features may be correlated with each other, and some values may be recovered from the others. It is thus important to decide which features are most informative for recovering the other features as well as improving the learning performance. In this paper, we try to train an effective classification model with least acquisition cost by jointly performing active feature querying and supervised matrix completion. When completing the feature matrix, a novel target function is proposed to simultaneously minimize the reconstruction error on observed entries and the supervised loss on training data. When querying the feature value, the most uncertain entry is actively selected based on the variance of previous iterations. In addition, a bi-objective optimization method is presented for cost-aware active selection when features bear different acquisition costs. The effectiveness of the proposed approach is well validated by both theoretical analysis and experimental study.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Feb 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 2; 2024: 0; 2025: 1; 2026: 4.
12 papers.
- 2022Missing Data Imputation and Acquisition with Deep Hierarchical Models and Hamiltonian Monte Carlocited by 19
- 2021A Probabilistic Hard Attention Model For Sequentially Observed Scenescited by 12
- 2021Efficient Online Estimation of Causal Effects by Deciding What to Observecited by 11
- 2021Learning to Limit Data Collection via Scaling Laws: A Computational Interpretation for the Legal Principle of Data Minimizationcited by 9
- 2023Evaluation of Active Feature Acquisition Methods for Time-varying Feature Settingscited by 9
- 2023Generator Assisted Mixture of Experts For Feature Acquisition in Batchcited by 2
- 2025Dynamic Feature Selection from Variable Feature Sets Using Features of Featurescited by 1
- 2022Feature Acquisition using Monte Carlo Tree Searchcited by 0
- 2026Cost-optimal Sequential Testing via Doubly Robust Q-learningcited by 0
- 2026Order-Agnostic Autoregressive Modelling with Missing Datacited by 0
- 2026Active Reference Acquisition in Few-Shot Font Generationcited by 0
- 2026Measure Less, Know More: Self-Supervised Test-Time Feature Acquisitioncited by 0
- 2026Measure Less, Know More: Self-Supervised Test-Time Feature Acquisition2 Oct 2026
- 2026Active Reference Acquisition in Few-Shot Font Generation15 Jun 2026
- 2026Order-Agnostic Autoregressive Modelling with Missing Data7 May 2026
- 2026Cost-optimal Sequential Testing via Doubly Robust Q-learning13 Apr 2026
- 2025Dynamic Feature Selection from Variable Feature Sets Using Features of Features12 Mar 2025
- 2023Generator Assisted Mixture of Experts For Feature Acquisition in Batch19 Dec 2023
- 2023Evaluation of Active Feature Acquisition Methods for Time-varying Feature Settings3 Dec 2023
- 2022Feature Acquisition using Monte Carlo Tree Search21 Dec 2022
- 2022Missing Data Imputation and Acquisition with Deep Hierarchical Models and Hamiltonian Monte Carlo9 Feb 2022
- 2021A Probabilistic Hard Attention Model For Sequentially Observed Scenes15 Nov 2021
- 2021Efficient Online Estimation of Causal Effects by Deciding What to Observe20 Aug 2021
- 2021Learning to Limit Data Collection via Scaling Laws: A Computational Interpretation for the Legal Principle of Data Minimization16 Jul 2021