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.
In many machine learning applications, it is important to explain the predictions of a black-box classifier. For example, why does a deep neural network assign an image to a particular class? We cast interpretability of black-box classifiers as a combinatorial maximization problem and propose an efficient streaming algorithm to solve it subject to cardinality constraints. By extending ideas from Badanidiyuru et al. [2014], we provide a constant factor approximation guarantee for our algorithm in the case of random stream order and a weakly submodular objective function. This is the first such theoretical guarantee for this general class of functions, and we also show that no such algorithm exists for a worst case stream order. Our algorithm obtains similar explanations of Inception V3 predictions $10$ times faster than the state-of-the-art LIME framework of Ribeiro et al. [2016].
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1703.02647")
get_code_for_paper("1703.02647")
have("1703.02647")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1703.02647.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1703.02647)
Connect an agent — have() is free.