Does UDASSA include concepts like the “observer graph” and “graph machine” that Muller describes in the paper? Is Muller just filling out details that are inevitable once you have the core UDASSA concept?
I think these details are inevitable if you have UDASSA and want transition probabilities, but I don’t want transition probabilities :-)
Does UDASSA include concepts like the “observer graph” and “graph machine” that Muller describes in the paper? Is Muller just filling out details that are inevitable once you have the core UDASSA concept?
I think these details are inevitable if you have UDASSA and want transition probabilities, but I don’t want transition probabilities :-)