Karim Elzokm

dblp:421/0318 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 67% Probabilistic and Bayesian machine learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › experimental design
active feature acquisition
0.912025
Active feature acquisition via explainability-driven ranking · ICML 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Active feature acquisition via explainability-driven ranking · ICML 2025
Machine learning › Trustworthy machine learning › interpretability
local explanation
0.912025
Active feature acquisition via explainability-driven ranking · ICML 2025

Methods — techniques the papers use, named apart from their topics

policy network · 0.9feature importance ranking · 0.9decision transformer · 0.9
YearPublicationVenuePosition
2025 Active feature acquisition via explainability-driven ranking
abstract
In many practical applications, including medicine, acquiring all relevant data for machine learning models is often infeasible due to constraints on time, cost, and resources. This makes it important to selectively acquire only the most informative features, yet traditional static feature selection methods fall short in scenarios where feature importance varies across instances. Here, we propose an active feature acquisition (AFA) framework, which dynamically selects features based on their importance to each individual case. Our method leverages local explanation techniques to generate instance-specific feature importance rankings. We then reframe the AFA problem as a feature prediction task, introducing a policy network grounded in a decision transformer architecture. This policy network is trained to select the next most informative feature by learning from the feature importance rankings. As a result, features are acquired sequentially, ordered by their predictive significance, leading to more efficient feature selection and acquisition. Extensive experiments on multiple datasets demonstrate that our approach outperforms current state-of-the-art AFA methods in both predictive accuracy and feature acquisition efficiency. These findings highlight the promise of an explainability-driven AFA strategy in scenarios where the cost of feature acquisition is a key concern.
Osman B. Güney, Ketan Suhaas Saichandran, Karim Elzokm, Vijaya B. Kolachalama
ICML3