« first day (3386 days earlier)      last day (1349 days later) » 

14:37
1
Q: Why does it take O(n!) time to specify a canonical ordering for learning flatten adjacency matrices/graphs?

Charlie ParkerI was reading a paper for learning graphs (paper is GraphRNN) and it says in section 2.2 (emphasis by me): Vector-representation based models. One naive approach would be to represent G by flattening $A^π$ into a vector in $R^{n^2}$, which is then used as input to any off-the-shelf generative mo...


« first day (3386 days earlier)      last day (1349 days later) »