A directed graph is said to be k-vertex-connected if after deleting any k-1 vertices, therer is a directed path from every vertex to every other vertex along the directed edges.

One of the fundamental issues facing deployment of supervised learning models in real life applications is the issue of out-of-distribution (OOD) generalization.

Artificial Intelligence, specifically machine learning (ML), has increasingly been making inroads into society and our lives over the last decade.

Given n-variate polynomials f,g,h such that f=g/h, where both g and h are computable by arithmetic circuits of size s, we show that f can be computed by a circuit of size poly(s, deg(h)).