Inapproximability of sufficient reasons for decision trees

04/05/2023
by   Alexander Kozachinskiy, et al.
0

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

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset