SOURCE-LINKED INTELLIGENCE

Sparse Priors for Efficient Distribution Learning

arXiv · AI, language, vision and robotics · article · Sep 16, 2026 · UTC

Despite the widespread use and success of generative AI techniques today, theoretical guarantees on learning a distribution supported in $d$ dimensions from $n$ samples degrade as $O(n^{-1/Θ(d)})$, though shown to be minimax optimal. We hypothesize that present bounds are too pessimistic because smoothness assumptions are not enough to capture the structure of distributions that often appear in real applications. Consequently, we introduce the class of sparse priors and define the "Sparse Dimension" as a measure of sparsity of a prior over the space of all distributions. We show that distribut

Read original source ↗ Open in workspace

recordType

paper

region

Global