AI RESEARCH
A Differentiable Measure of Algebraic Complexity: Provably Exact Discovery of Group Structures
arXiv CS.LG
•
ArXi:2511.23152v3 Announce Type: replace Discovering discrete algebraic rules from data is a fundamental challenge in machine learning. We formalize this problem through Cayley-table completion -- an algebraic counterpart to classical matrix completion -- where the degree of associativity violation replaces linear rank as the intrinsic measure of complexity.