Papers › Grad-CAM++: Improved Visual Explanations for Deep Convolutional Networks
Grad-CAM++: Improved Visual Explanations for Deep Convolutional Networks
Aditya Chattopadhyay, Anirban Sarkar, Prantik Howlader, Vineeth N. Balasubramanian
Over the last decade, Convolutional Neural Network (CNN) models have been highly successful in solving complex vision problems. However, these deep models are perceived as "black box" methods considering the lack of understanding of their internal functioning. There has been a significant recent interest in developing explainable deep learning models, and this paper is an effort in this direction. Building on a recently proposed method called Grad-CAM, we propose a generalized method called Grad-CAM++ that can provide better visual explanations of CNN model predictions, in terms of better object localization as well as explaining occurrences of multiple object instances in a single image, when compared to state-of-the-art. We provide a mathematical derivation for the proposed method, which uses a weighted combination of the positive partial derivatives of the last convolutional layer feature maps with respect to a specific class score as weights to generate a visual explanation for the corresponding class label. Our extensive experiments and evaluations, both subjective and objective, on standard datasets showed that Grad-CAM++ provides promising human-interpretable visual explanations for a given CNN architecture across multiple tasks including classification, image caption generation and 3D action recognition; as well as in new settings such as knowledge distillation.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1710.11063")
Code
Syntology Ran 4 of 7 code samples harvested from 2 repositories linked to this paper; 3 have no recorded run. Of those that ran: 3 ran · our draft was wrong; 1 ran · fixture could not drive it.
By repository: community (archive-listed): 5 samples from 2 repositories, 2 ran; 2 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
24 repositories listed; official and paper-mentioned ones first.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
7 samples harvested; 4 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 3 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
c30f68b12bf6fb11 · report
5b31bf1776aa901d · report
5bcbc2252f5d8000 · report
c0284e95304e29bf · report
abec4075f19dd646 · report
cd9e431963bd28ca · report
3e3e7c2d436361ca · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Error Understanding | CUB-200-2011 | Grad-CAM++ | Average highest confidence (EfficientNetV2-M) | 0.2659 | #2 of 4 | Archive leaderboard | report |
| Error Understanding | CUB-200-2011 | Grad-CAM++ | Average highest confidence (MobileNetV2) | 0.3462 | #2 of 4 | Archive leaderboard | report |
| Error Understanding | CUB-200-2011 | Grad-CAM++ | Average highest confidence (ResNet-101) | 0.2647 | #2 of 4 | Archive leaderboard | report |
| Error Understanding | CUB-200-2011 | Grad-CAM++ | Insertion AUC score (EfficientNetV2-M) | 0.1605 | #2 of 4 | Archive leaderboard | report |
| Error Understanding | CUB-200-2011 | Grad-CAM++ | Insertion AUC score (MobileNetV2) | 0.1284 | #2 of 4 | Archive leaderboard | report |
| Error Understanding | CUB-200-2011 | Grad-CAM++ | Insertion AUC score (ResNet-101) | 0.1094 | #2 of 4 | Archive leaderboard | report |
| Error Understanding | CUB-200-2011 (ResNet-101) | Grad-CAM++ | Average highest confidence | 0.2647 | #1 of 3 | Archive leaderboard | report |
| Error Understanding | CUB-200-2011 (ResNet-101) | Grad-CAM++ | Insertion AUC score | 0.1094 | #1 of 3 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections