Sign inGet started
Paper · arXiv

Hypernetworks for Dynamic Feature Selection

Dynamic feature selection (DFS) is a machine learning framework in which features are acquired sequentially for individual samples under budget constraints. The exponential growth in the number of possible feature acquisition paths forces a DFS model to balance fitting specific scenarios against maintaining general performance, even when the feature space is moderate in size. In this paper, we study the structural limitations of existing DFS approaches to achieve an optimal solution. Then, we propose \textsc{Hyper-DFS}, a hypernetwork-based DFS approach that generates feature subset-specific classifier parameters on demand. We show that the use of hypernetworks compared to mask-embedding ...

AuthorsJavier Fumanal-Idocin, Raquel Fernandez-Peralta, Javier Andreu-Perez
Primary categorycs.LG
Published12 May 2026
Last updated at source28 September 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/fec7c6ca-5b56-453a-a14d-805743b96035" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.