AndrewZhaoLuo commented on PR #11423: URL: https://github.com/apache/tvm/pull/11423#issuecomment-1138895579
@FranckQC thanks for elucidating the intention of the original design. I see why for an arbitrary semantic computation functions you may need to have N^2 comparisons. Is it possible to relax the number of comparisons by using a canonical form. E.g. (x + y) + z and z + (y + x) would always reduce to `(x + y) + z` or is this too limiting/impossible to catch some optimizations? If we could do things this way we would have O(N) computations now. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
