Inapproximability of sufficient reasons for decision trees

Kozachinskiy, Alexander

arXiv.org Artificial Intelligence 

In this note, we establish the hardness of approximation of the problem of computing the minimal size of a $\delta$-sufficient reason for decision trees.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found