| ▲ | program_whiz 2 hours ago | |
Yeah any method I'm thinking is better solved another way. If you need continuous graphs, then this devolves into GNN or transformers. If you truly have discrete graphs, just use standard programming? I dunno, maybe this energy approach is better on some problems (more efficient), but getting training examples where you automatically extract the graph representation, and the energy rules seems like a big leap. If you already have the energy rules in code, then the "just program it" approach is stronger. I left a comment above with an example how to sample this just using ordinary code that would be a lot more efficient imo (but keeps the random weighted search), and is probably better than brute force. | ||