Contemporary codingeducation oftenpresents students withthetaskofdeveloping programs that have user interaction and complex dynamic systems, such as mousebasedgames.
The problem in training networks of discrete components like logic gates, is that they are nondifferentiable and therefore, conventionally, cannot be optimized via standard methods such asgradient descent [5].
This severely limits their scalability and sample complexity. This paper proposes a scalable and efficient algorithm that consistently identifies all interventiontargets.