Skip to main content
Search

# Active Feature Acquisition

1 related articles

Subscribe to updates
  1. arXiv

    AFA-Bandit casts online active feature acquisition as a combinatorial bandits-with-knapsacks problem, and LP-Chain beats HEDGE-based BwK and a deep RL baseline on synthetic data with linear-size chain search

    The work formulates online active feature acquisition (AFA) as a predictor-coupled combinatorial Bandits with Knapsacks problem that jointly decides feature acquisition and label prediction under a global budget, and derives a tighter regret upper bound than standard BwK by exploiting a cardinality-aware confidence bound and subset feedback; to avoid an exponentially large action space, the authors propose LP-Chain, which searches a cost-aware chain of feature subsets whose size grows linearly with the number of features, and on synthetic Gaussian-mixture data it attains lower prediction error than HEDGE-based BwK and a deep RL online AFA baseline.

You’re all caught up