You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tvm.apache.org by GitBox <gi...@apache.org> on 2019/11/25 05:29:29 UTC

[GitHub] [incubator-tvm] tmoreau89 commented on issue #4332: [RFC] Support for Sparse Computation

tmoreau89 commented on issue #4332: [RFC] Support for Sparse Computation
URL: https://github.com/apache/incubator-tvm/issues/4332#issuecomment-557996282
 
 
   Those are all great questions @liangfu. 
   
   Question 3 is an interesting one w.r.t to what kinds of scheduling primitives we'll need for sparse operators. One easy workaround is to apply vectorization along a dense tensor dimension if there is one. For many practical examples, tensors won't be sparse along all dimensions. But the question gets more tricky when that assumption does not hold.
   
   And due to the dynamism of varying idx/val arrays, this can create an interesting discussion around how autoTVM will be used on more dynamic operators. Right now TOPI is built around the assumption that shapes are known statically. This will be an interesting implementation challenge, which probably deserves its own RFC. Perhaps @ZihengJiang the `Extension for Scheduling` can point to a follow-up RFC?

----------------------------------------------------------------
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.
 
For queries about this service, please contact Infrastructure at:
users@infra.apache.org


With regards,
Apache Git Services