Paper recorded by Signals 4 on 2026-10-27 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-27 on arXiv · recorded by Signals 4 on 2026-10-28
Category: cs.LG · 机器学习 · first seen 2026-10-28
A persistent belief in modern AI is that sufficiently large learners trained on sufficiently much data can make explicit domain knowledge optional. This paper examines a limitation of that belief. We define structure-encoded problems: tasks whose input-output map is determined, or sharply constrained, by known structure such as a solver, symmetry group, graph, physical law, measurement operator, g