- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The submission attempts to study under which circumstances learning from compositional tasks can identify the meaning of underlying constituents.
Critical strengths
None
Critical weaknesses
- The whole submission reads like an extremely jargon-heavy stream of thought without a clear motivation for why things are done.
- It is unclear what significance the bespoke models, tasks and results have. They are defined in this work without clear motivation or reference to prior work
Questions for authors
We then give the same examples to the neural and discrete learners, enabling controlled comparisons when the examples determine the target function and both models can express it. In the 36-task study, the discrete learner achieves approximately 90% accuracy on unseen combinations, compared with 28% for the neural composer. Additionally, the structured examples improve neural generalisation by approximately 16 percentage points over equally sized random sets with matching answer frequencies. These results establish a replicated benefit from training example structure and substantial differences in how learners exploit sufficient information under their respective fixed budgets.
This section in the introduction is a good example of the poor structure of the paper. It is unclear to me why detailed results are presented in the introduction before the necessary context to understand them is provided.
Near uniform input and output dictionaries, we prove that input-dependent prediction differences require deviations in all dictionaries, giving a first possible term of degree p + 1 for p input positions. This cancellation law motivates removing uncertainty in individual dictionaries.
Another section of the introduction that illustrates the dense, jargon-heavy language used throughout the manuscript that I could barely comprehend.
The operation table is encoded by the fixed tensor Trsc = 1[r ⊕ s = c].
This is an example of heavy mathematical formalism to express simple objects (a binary table?) that makes it hard to understand what is being done.
Sufficiency concerns the input-answer function, so different dictionaries may still represent that same function.
If the inputs are different it is a different function. Maybe the mathematical concept missing here is an isomorphism?
A soft neural composer receives the correct composition table and learns probabilistic dictionaries through gradient training, while a discrete learner uses the same table and searches directly over one-to-one dictionaries. A constructive recovery learner infers an executable rule from selected complete-task answers without receiving the latent table
Why are these models chosen? How do they related to prior work?