It is best not read the answers until you've tried to answer the questions yourself.
Answer: learning which happens in a single change to weights or similar structures, as opposed to a sequence of small incremental changes.
Answer: the binding units store the facts ("bindings") known to the network; each fact is provided in the form of an outer product, one component of which is added to each binding units. (The number of binding units is equal to the product of the dimensions of the role and filler spaces.)
Answer: A distributed representation is one in which many of the components of the representation vectors are non-zero.
Answer: that the variable v is bound to the filler f.
Answer: A Hadamard matrix H is a square matrix whose entries are all either +1 or –1, and such that HHT = nIn, where n is the length of the size of the matrix (and In is the n×n identity matrix).
Answer: Let h, m, and f be the vectors representing hit, max, and frank. Form the outer product of h, m, and f, and add it to the binding unit tensor for the network.
Answer: Let the vectors representing dog and kennel be input to the ARG1 and ARG2 sides of the tensor. Take the "relational bundle" that is output by the REL side of the tensor, together with the vector representing rabbit, and input them to the REL and ARG1 one side of the tensor. The output from the ARG2 side of the tensor should be a weighted sum of ARG2 concepts. The concept with the largest weight should be the solution to the problem.
Answer: Concepts can be input to any combination of one or more sides of the tensor, and a vector or tensor of will be output from the remaining sides (or if there are none, then a discriminant value of +1 or –1 is output). For example, for a rank 3 tensor, with "axes" labelled REL, ARG1 and ARG2, the possible inputs and corresponding outputs are:
| Inputs | Outputs |
|---|---|
| REL, ARG1, ARG2 | Discriminant |
| REL, ARG1 | ARG2 |
| REL, ARG2 | ARG1 |
| ARG1, ARG2 | REL |
| REL | tensor ARG1⊗ARG2 |
| ARG1 | tensor REL⊗ARG2 |
| ARG2 | tensor REL⊗ARG1 |
Answer: A representable non-fact is one all of whose atomic concepts have representation vectors, but which has not been taught to the tensor product network (or other system for storing relational knowledge).
Answer: A dense random representation is one formed by creating represenation vectors by generating random components from a uniform distribution over the interval [–r, +r], and then normalising the resulting vectors. Such vectors will have an average inner product of zero, and are in this sense quasi-orthogonal.
Bill Wilson's contact info
UNSW's CRICOS Provider No. is 00098G