Hi @comaniac,
May I ask how the graph ends up with a `nn.conv2d + nn.relu + nn.conv2d + nn.relu` ? Is the graph going through a BYOC kind of partitioning (sorry if the question is naive)? As for S1 vs S2, could we do both? Use an heuristic like "ignore the task without any call node" and then let the task scheduler judge if it needs to spend time on the task? Thanks --- [Visit Topic](https://discuss.tvm.apache.org/t/rfc-a-general-task-extraction-mechanism-for-auto-scheduler/8444/2) to respond. You are receiving this because you enabled mailing list mode. To unsubscribe from these emails, [click here](https://discuss.tvm.apache.org/email/unsubscribe/08198256fdd8730ea14f00dfebb803035f3411d12abf9210f7ccfa0178cd95d3).
