A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2005.10099v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Nonparametric Score Estimators
[article]
<span title="2020-06-30">2020</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2020-05-20">2020</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.10099v1">arXiv:2005.10099v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mzgsyaw4ejblnik4ynzauxy754">fatcat:mzgsyaw4ejblnik4ynzauxy754</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.10099v1">arXiv:2005.10099v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mzgsyaw4ejblnik4ynzauxy754">fatcat:mzgsyaw4ejblnik4ynzauxy754</a> </span>
Estimating the score, i.e., the gradient of log density function, from a set of samples generated by an unknown distribution is a fundamental task in inference and learning of probabilistic models that involve flexible yet intractable densities. Kernel estimators based on Stein's methods or score matching have shown promise, however their theoretical properties and relationships have not been fully-understood. We provide a unifying view of these estimators under the framework of regularized
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.10099v2">arXiv:2005.10099v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r7h63v3vcvbwfjepymqbfz6fou">fatcat:r7h63v3vcvbwfjepymqbfz6fou</a>
</span>
more »
... arametric regression. It allows us to analyse existing estimators and construct new ones with desirable properties by choosing different hypothesis spaces and regularizers. A unified convergence analysis is provided for such estimators. Finally, we propose score estimators based on iterative regularization that enjoy computational benefits from curl-free kernels and fast convergence.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200710044904/https://arxiv.org/pdf/2005.10099v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/52/a2/52a2510bd55ca07db43f464c101756c5dde62a5f.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.10099v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>