Introduces the binning semiring and causal graphical models to show that correlational evaluation of learnability in formal language tasks leads to incorrect conclusions from confounders.
Lehmann , abstract =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
citing papers explorer
-
Causally Evaluating the Learnability of Formal Language Tasks
Introduces the binning semiring and causal graphical models to show that correlational evaluation of learnability in formal language tasks leads to incorrect conclusions from confounders.