Closed
Description
As a follow-up to #78.
Perhaps we can just use one graph to illustrate the point. Can we use figure 2 from the paper https://arxiv.org/pdf/1104.5617.pdf
Then proceed by:
- drawing the figure and describing the inducing path and figure
- By default adjacent nodes have a trivial inducing path (the edge between them)
- show that inducing paths among non-adjacent nodes relative to L={L1, L2}, S={} is only possible in the figure between X1 and X5.
- There is no inducing path relative to L and S between (X1, X6) and (X2, X4)
- By adding X6 to S, then there is now an inducing path relative to L and S among (X2, X4), (X1, X3), (X5, X3)
This walks through the core concepts we've walked through on this PR on a graph that is in a well-known publication and then describes some of the intricacies of the hyperparameters (L and S).
Originally posted by @adam2392 in #78 (comment)
cc: @aryan26roy may be interested :)
Metadata
Metadata
Assignees
Labels
No labels