AI & ML
Functional Compression as Occam's Razor: Algebraic Complexity from Sensitivity Minimization
arXiv stat.ML0 views
arXiv:2511.23152v5 Announce Type: replace-cross Abstract: Discovering discrete algebraic structures from data is a fundamental challenge in machine learning. We ask how continuous learning objectives can favor functional compression---representing data through shared algebraic composition rather than low-rank representations. We analyze the global optima of a canonical factorization model for algebraic completion (recovering finite binary operations) that demonstrated a preference for group operations. We measure algebraic complexity by the infimum of parameter sensitivity under exact reconstruction. We establish a universal complexity floor, whose attainment forces geometric alignment and unitarity of the latent representations. At the floor, input representations compose into the corresponding output representations; their reuse across the operation table propagates these local identities to enforce a globally shared algebraic structure. If the floor is not attained, a positive gap separates it from the feasible infimum. For cancellative operations, floor attainment forces the model's latent representation to be an injective homomorphism, equivalent to the target being isotopic to a group. In this case, every global minimizer is equivalent to the underlying group's unitary left-regular representation, up to isotopy and unitary gauge, resolving the central conjecture of Huh (2025). For non-cancellative operations, floor attainment forces exact structural redundancies (identical rows or columns) and is equivalent to a unitary factorization of the target's row- and column-reduced table with orthonormal output matrices, yielding the fewest distinct input matrices compatible with exact reconstruction. The resulting cancellative table then embeds in a group-isotope table. This analysis reveals a structural bias toward functional compression: at the sensitivity floor, algebraic composition of latent representations implements the target operation.
Source:https://arxiv.org/abs/2511.23152PreviousExact Sequence Interpolation with TransformersNextOn the use of case estimate and transactional payment data in neural networks for individual loss reserving
Related posts
Web 上已经有 GPT-6.2,本地 Codex 却没有?先对入口,再更新客户端
0dev.to
영지식 증명 프라이버시와 규제 준수: 우리는 정말 두 마리 토끼를 다 잡을 수 있을까?
0dev.to
My context grew 6x in three months. That decides the cache question
0dev.to AI
How to connect Joist to any MCP client: Claude, ChatGPT, Cursor
0dev.to AI
Gemini Notebook cria sites interativos a partir de anotações
0dev.to AI
Two customers bought the same box of screws within five minutes and SQS delivered one sale
0dev.to AWS