Three questions here; obviously you can only answer what you can answer, but I figure it doesn’t hurt to ask.
Does LaMDA contain any kind of cycle in its computation graph, such as a recurrence or iterative process?
Does LaMDA have any form of ‘medium-term’ memory (shorter-term than weights but longer-term than activations)?
Does LaMDA (or, to what extent does LaMDA) make use of non-NN tools such as internet/database searches, calculators, etc?
No, no, yes according to the LaMDA paper. :)
See Gwern’s comment below for more detail on #3.
Three questions here; obviously you can only answer what you can answer, but I figure it doesn’t hurt to ask.
Does LaMDA contain any kind of cycle in its computation graph, such as a recurrence or iterative process?
Does LaMDA have any form of ‘medium-term’ memory (shorter-term than weights but longer-term than activations)?
Does LaMDA (or, to what extent does LaMDA) make use of non-NN tools such as internet/database searches, calculators, etc?
No, no, yes according to the LaMDA paper. :)
See Gwern’s comment below for more detail on #3.