Paper recorded by Signals 4 on 2026-11-03 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-11-03 on arXiv · recorded by Signals 4 on 2026-11-04
Category: cs.LG · 机器学习 · first seen 2026-11-04
We introduce Gaussian partitioning, an algorithmic primitive for distributions smooth with respect to a Gaussian. It partitions space into polyhedral regions so that almost all mass lies in thin strips restricting a few orthogonal directions. Within each strip, the conditional distribution approximately matches low-degree Gaussian moments in the unrestricted directions. Our construction builds on