Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Krishna Khadka

dblp:348/7396 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0000-0672-5107ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
2 papers
Trustworthy machine learning · 91% Optimization for machine learning · 9%
Software engineering, system software, and programming languages
1 paper
Software testing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.222026
ABLE: Using Adversarial Pairs to Construct Local Models for Explaining Model Predictions · KDD (1) 2026
Constructing Surrogate Models in Machine Learning Using Combinatorial Testing and Active Learning · ASE 2024
Machine learning › Trustworthy machine learning › interpretability
local explanation
1.012026
ABLE: Using Adversarial Pairs to Construct Local Models for Explaining Model Predictions · KDD (1) 2026
Software testing
combinatorial testing
0.812024
Constructing Surrogate Models in Machine Learning Using Combinatorial Testing and Active Learning · ASE 2024
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
surrogate model
0.212024
Constructing Surrogate Models in Machine Learning Using Combinatorial Testing and Active Learning · ASE 2024

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

combinatorial testing · 1.5active learning · 1.5linear surrogate model · 1.0gaussian noise · 1.0adversarial attack · 1.0
YearPublicationVenuePosition
2026 ABLE: Using Adversarial Pairs to Construct Local Models for Explaining Model Predictions
abstract
Machine learning models are increasingly used in critical applications but are mostly ''black boxes'' due to their lack of transparency. Local explanation approaches, such as LIME, address this issue by approximating the behavior of complex models near a test instance using simple, interpretable models. However, these approaches often suffer from instability and poor local fidelity. In this paper, we propose a novel approach called Adversarially Bracketed Local Explanation (ABLE) to address these limitations. Our approach first generates a set of neighborhood points near the test instance, xtest, by adding bounded Gaussian noise. For each neighborhood point D, we apply an adversarial attack to generate an adversarial point A with minimal perturbation that results in a different label than D. A second adversarial attack is then performed on A to generate a point A' that has the same label as D (and thus different than A). The points A and A' form an adversarial pair that brackets the local decision boundary for xtest. We then train a linear model on these adversarial pairs to approximate the local decision boundary. Experimental results on six UCI benchmark datasets across three deep neural network architectures demonstrate that our approach achieves higher stability and fidelity than the state-of-the-art.
Krishna Khadka, Sunny Shree, Pujan Budhathoki, Yu Lei 0001, Raghu Kacker, D. Richard Kuhn
KDD (1)1
2024 A Combinatorial Approach to Hyperparameter Optimization
abstract
In machine learning, hyperparameter optimization (HPO) is essential for effective model training and significantly impacts model performance. Hyperparameters are predefined model settings which fine-tune the model's behavior and are critical to modeling complex data patterns. Traditional HPO approaches such as Grid Search, Random Search, and Bayesian Optimization have been widely used in this field. However, as datasets grow and models increase in complexity, these approaches often require a significant amount of time and resources for HPO. This research introduces a novel approach using t-way testing---a combinatorial approach to software testing used for identifying faults with a test set that covers all t-way interactions---for HPO. T-way testing substantially narrows the search space and effectively covers parameter interactions. Our experimental results show that our approach reduces the number of necessary model evaluations and significantly cuts computational expenses while still outperforming traditional HPO approaches for the models studied in our experiments.
Krishna Khadka, Jaganmohan Chandrasekaran, Yu Lei 0001, Raghu Kacker, D. Richard Kuhn
CAIN1
2024 Constructing Surrogate Models in Machine Learning Using Combinatorial Testing and Active Learning
abstract
Machine learning (ML)-based models are often black box, making it challenging to understand and interpret their decision-making processes. Surrogate models are constructed to approximate the behavior of a target model and are an essential tool for analyzing black-box models. The construction of a surrogate model typically includes querying the target model with carefully selected data points and using the responses from the target model to infer information about its structure and parameters.
Sunny Shree, Krishna Khadka, Yu Lei 0001, Raghu Kacker, D. Richard Kuhn
ASE2