Algebra geometry view makes sense to me. Considering ML as a learning to approximate scheme algorithm. Tensor representation is similar to the SDP trick achieving the optimal max-sat approximation. The difference is that DL approximates from inside of the high dimensional space (concave) while SDP approximates from outside (convex). The later one turns into polynomial algorithm, but the former one remains NP-hard. The success of DL just proved that there is a long way to go for P equals NP. Whenever we figure that out, symbolic approach and Tensor approach will merge.