Paper recorded by Signals 4 on 2026-10-20 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-20 on arXiv · recorded by Signals 4 on 2026-10-21
Category: cs.LG · 机器学习 · first seen 2026-10-21
Statistical learning in high dimensions suffers from the curse of dimensionality. Fortunately, many functions of practical interest are compositionally sparse, meaning they admit a composition of local functions, each depending on only a few variables, allowing sample complexity to depend on local arity rather than ambient dimension. Yet realizing this benefit requires exploiting hidden compositio