- Rating
- 4
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
Language generation in the limit is a syntactic condition, in which an algorith must generate strings that are not the same as earlier strings it has seen. But as the submission notes, we are often concerned with the meaning of the string that is being output, and therefore we could ask more strongly that the algorithm produce a string whose meaning has not been seen before. The paper develops this idea through the notion of the "span" of a set of strings, and proves interesting positive results.
Critical strengths
The notion of a span as an operation on sets is a natural way to formalize the issue that the paper is considering.
The theorems in the paper show that the requirement is not too strict to yield positive results for generation. The connection to special cases such as matroid structures is very natural.
Critical weaknesses
Because the paper stays at a fairly abstract level, it is harder to the results via concrete instances. This would not necessarily require experiments in real contexts, but just specific pedagogically chosen instances of the problem where the underlying issues could be made more concrete.
The paper Jiaxun Li, Vinod Raman, and Ambuj Tewari. On generation in metric spaces. arXiv preprint arXiv:2602.07710, 2026a. seems more closely related than many of the other cited works, and so it would be helpful for the paper to discuss the comparison to this work more extensively.
Questions for authors
As it stands, the formalism captures an important issue, but the conclusion remain abstract, with limited connections to the kinds of instances of the problem that generally motivates work on language generation. Can you give some more specific instances where this type of analyses could be applied, and show what conclusions you would draw from it?
Can you say more about the connection to Jiaxun Li, Vinod Raman, and Ambuj Tewari. On generation in metric spaces. arXiv preprint arXiv:2602.07710, 2026a?
3 comments
Response to Reviewer f3Zs (2/2)
W2 / Q2 (Li, Raman and Tewari, "On generation in metric spaces"). Both papers replace "unseen" by a coarser redundancy relation, and both find that the uniform and non-uniform characterizations of Raman et al. survive when "finite" is replaced by a covering notion (in our case uniformly for every span, and non-uniformly for every span when only the examples count and for locally Noetherian spans otherwise). The overlap is closer than our submission says. Below, and are their generator and adversary radii, written and in our Appendix H.
- In the current arXiv version (v2, October 2026) their dimension asks for a finite cover of the safe zone by -balls centred inside it. For the ball span this is exactly a finite core.
- Our paraphrase trap is an instance of their model. With distance between paraphrases and otherwise, and , the ball span is the partition span and the covering number of a set of examples is its size. Their Example B.3, already in v1, is the same phenomenon. Example 4.4 also records that the class is generatable in the limit, and Theorem 6.1 gives the matroid version (two infinite-rank flats meeting in a plane).
The differences:
| Li, Raman, Tewari | this paper | |
|---|---|---|
| redundancy | within of some example (pairwise) | any monotone span with ; set-wise |
| whose strings count | the examples | the examples and the generator's own outputs |
| threshold measured by | -covering number of the examples | number of distinct examples |
| universe and languages | separable metric space; languages of infinite covering number | countable; languages may have a finite core |
| generation in the limit | not characterized; a union of two uniformly generatable classes of uncountably many hypotheses on can fail (v2, Theorem 3.5) | characterized for countable classes (Prop. 5.1; Thm. 5.2 when the span is locally Noetherian) |
Two of these differences carry results. Set-wise redundancy is what linear span and logical consequence need: a vector far from every earlier vector can still lie in their span. Counting the generator's own outputs is the only source of poisoning, so Example 5.5 and Proposition 5.6 have no counterpart in their setting. By analogy with Theorem 5.3, which we prove only for finitary closure operators, covers centred anywhere correspond to the sets that finitely many strings span, and the example in Appendix H shows why the centres must lie inside. In the other direction, their results on scale sensitivity and doubling spaces, and their asymmetric radii, have no counterpart in ours.
Appendix H of the submission was written against their v1, where the cover centres could lie anywhere in the space; its example shows why the centres must lie in the safe zone, which v2 now requires. The submission's remark that their Theorem 3.1 fails as stated applied to v1 only; the revision now states it as a remark about the v1 definition and notes that their current Theorem 3.1 agrees. The revision updates Appendix H to v2, adds Example B.3 and the embedding above there, and adds a paragraph with this comparison to the related work of Section 1 (in blue).
Thank you for this detailed comparison; I think including it in the paper will help the exposition and the connection to related work.
Response to Reviewer f3Zs (1/2)
Thank you for the review, and for pointing to Li, Raman and Tewari, which is indeed the closest work and deserves more than the submission gives it.
W1 / Q1 (concrete instances and the conclusions they support). Four instances, each with what the theorems say about it:
A version of this table is now Table 2 of the revised PDF (page 10, referenced from Section 8).