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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Revoti Prasad Bora

dblp:86/2369 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
6since 2021 · last 2026
0009-0004-7335-2434ORCID · corroborated

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

Artificial intelligence and machine learning · 7 · 5 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 2 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 · 82% Generative modeling · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.812024
SLICE: Stabilized LIME for Consistent Explanations for Image Classification · CVPR 2024
Machine learning › Trustworthy machine learning › interpretability
local explanation
0.812024
SLICE: Stabilized LIME for Consistent Explanations for Image Classification · CVPR 2024
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.412020
Regularization with Latent Space Virtual Adversarial Training · ECCV (1) 2020
Machine learning › Generative modeling
latent space regularization
0.412020
Regularization with Latent Space Virtual Adversarial Training · ECCV (1) 2020

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

surrogate model · 0.8feature selection · 0.8adaptive perturbation · 0.8virtual adversarial training · 0.4latent space perturbation · 0.4
YearPublicationVenuePosition
2026 Bay-CoFE: Bayesian consistency-driven feature elimination for eXplainable AI
abstract
Feature selection is a critical aspect of eXplainable Artificial Intelligence (XAI), and it has implications for model interpretability and predictive performance. CoFE (Consistency-driven Feature Elimination) framework was introduced recently using a frequentist approach. CoFE eliminates features with inconsistent coefficient signs in Linear Regression models by estimating the Sign Entropy (variability of the sign) of the coefficients using Bootstrapping. However, the uncertainty associated with estimating Sign Entropy using bootstrapping leads to slower convergence and inconsistency in feature subset selection in CoFE. In this paper, we present Bay-CoFE, 1 a Bayesian reformulation of CoFE, to solve the slow convergence and inconsistency issues of CoFE while retaining the benefits of selecting features with lower Sign Entropy in a Bayesian framework. We provide theoretical justifications and empirical evidence to prove Bay-CoFE’s superior convergence properties. Across all datasets, Bay-CoFE achieves significantly superior sign stability compared to traditional feature selection methods (Mann-Whitney U test, p-value < = 1.63e-03 and mean Cliff’s delta ≈ 0.83), with minimal predictive performance differences (Mann-Whitney U test, p-value > 0.1 and mean Cliff’s delta ≈ 0.32), demonstrating a highly favorable trade-off for interpretable modeling.
Revoti Prasad Bora, Philipp Terhörst, Raymond N. J. Veldhuis, Ramachandra Raghavendra, Kiran B. Raja
Neurocomputing1
2026 FRIES: Framework for inconsistency estimation of saliency metrics
abstract
Saliency maps are widely used as a post-hoc approach to explain the decision-making process of Deep Learning (DL) based image classification models, but evaluating their fidelity remains a complex problem. While saliency metrics have been introduced to evaluate the fidelity of saliency maps, existing saliency metrics, such as perturbation-based saliency metrics, have been previously reported to demonstrate statistical inconsistency. Although inconsistencies have been noted in different works, there exists no mechanism for estimating the same, i.e., Inconsistency Estimation (IE). Our primary objective is to address this limitation, and therefore, we propose a framework to estimate the inconsistency of saliency metrics for any given DL model. The framework enables building IE models for estimating the inconsistency by employing a set of perturbation types and schemes. The framework’s modular architecture provides flexibility across (i) perturbation types (Inpainting, Uniform, and Gaussian blur), (ii) perturbation schemes (pixel-wise and patch-wise), (iii) learning mechanisms (Convolutional Neural Networks and Vision Transformers) and (iv) IE modeling techniques (bagging and boosting). Extensive experimental results are shown on three well-known DL architectures (Inception-V3, Xception, and ResNet-50) on three different public datasets, including the Imagenette, Oxford-IIIT Pets Dataset, and PASCAL VOC 2007, along with results on ViTs for Oxford-IIIT Pets Dataset, and PASCAL VOC 2007. With a comprehensive evaluation of seven different perturbation types that include two inpainting, two Gaussian blur (with kernel widths of 0.9 and 1.5), and three uniform perturbations, our work shows the effectiveness of the proposed approach in estimating inconsistency. Statistically founded tests such as repeated cross-validation and the Permutation Test further validate the idea of the proposed framework for estimating the inconsistency of saliency metrics across unseen perturbations, making it useful in real-world scenarios.
Revoti Prasad Bora, Philipp Terhörst, Raymond N. J. Veldhuis, Ramachandra Raghavendra, Kiran B. Raja
Pattern Recognit.1
2025 BELIEF - Bayesian Sign Entropy Regularization for LIME Framework
abstract
Explanations of Local Interpretable Model-agnostic Explanations (LIME) are often inconsistent across different runs making them unreliable for eXplainable AI (XAI). The inconsistency stems from sign flips and variability in ranks of the segments for each different run. We propose a Bayesian Regularization approach to reduce sign flips, which in turn stabilizes feature rankings and ensures significantly higher consistency in explanations. The proposed approach enforces sparsity by incorporating a Sign Entropy prior on the coefficient distribution and dynamically eliminates features during optimization. Our results demonstrate that the explanations from the proposed method exhibit significantly better consistency and fidelity than LIME (and its earlier variants). Further, our approach exhibits comparable consistency and fidelity with a significantly lower execution time than the latest LIME variant, i.e., SLICE (CVPR 2024).
Revoti Prasad Bora, Philipp Terhörst, Raymond N. J. Veldhuis, Ramachandra Raghavendra, Kiran B. Raja
UAI1
2025 Assessing the noise robustness of Class Activation Maps: A framework for reliable model interpretability
abstract
Class Activation Maps (CAMs) are one of the important methods for visualizing regions used by deep learning models. Yet their robustness to different noise remains underexplored. In this work, we evaluate and report the resilience of various CAM methods for different noise perturbations across multiple architectures and datasets. By analyzing the influence of different noise types on CAM explanations, we assess the susceptibility to noise and the extent to which dataset characteristics may impact explanation stability. The findings highlight considerable variability in noise sensitivity for various CAMs. We propose a robustness metric for CAMs that captures two key properties: consistency and responsiveness. Consistency reflects the ability of CAMs to remain stable under input perturbations that do not alter the predicted class, while responsiveness measures the sensitivity of CAMs to changes in the prediction caused by such perturbations. The metric is evaluated empirically across models, different perturbations, and datasets along with complementary statistical tests to exemplify the applicability of our proposed approach.
Syamantak Sarkar, Revoti Prasad Bora, Bhupender Kaushal, Sudhish N. George, Kiran B. Raja
Image Vis. Comput.2
2024 SLICE: Stabilized LIME for Consistent Explanations for Image Classification
abstract
Local Interpretable Model-agnostic Explanations (LIME) - a widely used post-ad-hoc model agnostic ex-plainable AI (XAI) technique. It works by training a simple transparent (surrogate) model using random samples drawn around the neighborhood of the instance (image) to be explained (IE). Explanations are then extracted for a black-box model and a given IE, using the surrogate model. However, the explanations of LIME suffer from inconsistency across different runs for the same model and the same IE. We identify two main types of inconsistencies: variance in the sign and importance ranks of the segments (superpixels). These factors hinder LIME from obtaining consistent explanations. We analyze these inconsistencies and propose a new method, Stabilized LIME for Consistent Explanations (SLICE). The proposed method handles the stabilization problem in two aspects: using a novel feature selection technique to eliminate spurious superpixels and an adaptive perturbation technique to generate perturbed images in the neighborhood of IE. Our results demonstrate that the explanations from SLICE exhibit significantly better consistency and fidelity than LIME (and its variant BayLime).
Revoti Prasad Bora, Philipp Terhörst, Raymond N. J. Veldhuis, Ramachandra Raghavendra, Kiran B. Raja
CVPR1
2024 CoFE: Consistency-Driven Feature Elimination for eXplainable AI
Revoti Prasad Bora, Philipp Terhörst, Raymond N. J. Veldhuis, Ramachandra Raghavendra, Kiran B. Raja
ICPR (9)1
2020 Regularization with Latent Space Virtual Adversarial Training
Genki Osada, Budrul Ahsan, Revoti Prasad Bora, Takashi Nishide
ECCV (1)3