We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
While several feature scoring methods are proposed to explain the output of complex machine learning models, most of them lack formal mathematical definitions. In this study, we propose a novel definition of the feature score using the maximally invariant data perturbation, which is inspired from the idea of adversarial example. In adversarial example, one seeks the smallest data perturbation that changes the model's output. In our proposed approach, we consider the opposite: we seek the maximally invariant data perturbation that does not change the model's output. In this way, we can identify important input features as the ones with small allowable data perturbations. To find the maximally invariant data perturbation, we formulate the problem as linear programming. The experiment on the image classification with VGG16 shows that the proposed method could identify relevant parts of the images effectively.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1806.07004")
get_code_for_paper("1806.07004")
have("1806.07004")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1806.07004.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1806.07004)
Connect an agent — have() is free.