We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
A fundamental challenge in Bayesian inference is efficient representation of a target distribution. Many non-parametric approaches do so by sampling a large number of points using variants of Markov Chain Monte Carlo (MCMC). We propose an MCMC variant that retains only those posterior samples which exceed a KSD threshold, which we call KSD Thinning. We establish the convergence and complexity tradeoffs for several settings of KSD Thinning as a function of the KSD threshold parameter, sample size, and other problem parameters. Finally, we provide experimental comparisons against other online nonparametric Bayesian methods that generate low-complexity posterior representations, and observe superior consistency/complexity tradeoffs. Code is available at github.com/colehawkins/KSD-Thinning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.07130")
get_code_for_paper("2201.07130")
have("2201.07130")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.07130.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.07130)
Connect an agent — have() is free.