Super-Samples from Kernel Herding

Details Super-Samples from Kernel Herding Super-Samples from Kernel Herding

2012-03-15

arxiv.org/abs/1203.3472v1

Computer Science

Learning

Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)

Scientific paper

We extend the herding algorithm to continuous spaces by using the kernel trick. The resulting "kernel herding" algorithm is an infinite memory deterministic process that learns to approximate a PDF with a collection of samples. We show that kernel herding decreases the error of expectations of functions in the Hilbert space at a rate O(1/T) which is much faster than the usual O(1/pT) for iid random samples. We illustrate kernel herding by approximating Bayesian predictive distributions.

Affiliated with

Also associated with

No associations

Rating

Super-Samples from Kernel Herding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Super-Samples from Kernel Herding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Super-Samples from Kernel Herding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32103