First non-asymptotic sample complexity bounds for structure learning of polynomial exponential families via score matching, with polynomial dependence on model dimension.
arXiv preprint arXiv:2512.24378 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finite Sample Bounds for Learning with Score Matching
First non-asymptotic sample complexity bounds for structure learning of polynomial exponential families via score matching, with polynomial dependence on model dimension.