Joint KL yields horizon-free approximation but an information-theoretic lower bound of order Omega(H) for estimation error in autoregressive learning, with matching computationally efficient upper bounds.
Transactions of the Association for Computational Linguistics , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Computational experiments show verb learning benefits in child-directed language likely stem from spoken register properties rather than unique optimization for children.
citing papers explorer
-
Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds
Joint KL yields horizon-free approximation but an information-theoretic lower bound of order Omega(H) for estimation error in autoregressive learning, with matching computationally efficient upper bounds.
-
Is Child-Directed Language Optimized for Word Learning? A Computational Study of Verb Meaning Acquisition
Computational experiments show verb learning benefits in child-directed language likely stem from spoken register properties rather than unique optimization for children.