Super-Samples from Kernel Herding

Abstract

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 rateO(1/T )which is much… (More)

Topics

6 Figures and Tables

Statistics

0102020082009201020112012201320142015201620172018
Citations per Year

58 Citations

Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics