Entropic Herding
Hiroshi Yamashita, Hideyuki Suzuki, and Kazuyuki Aihara

TL;DR
Entropic herding extends the herding algorithm to generate smooth probability distributions, enabling efficient density estimation and sampling, by optimizing a maximum entropy-based target function.
Contribution
The paper introduces entropic herding, a novel extension of herding that produces distributions instead of points, linking it closely with the maximum entropy principle.
Findings
Entropic herding effectively generates smooth distributions.
It allows for efficient probability density calculation.
Numerical experiments validate its advantages over conventional methods.
Abstract
Herding is a deterministic algorithm used to generate data points that can be regarded as random samples satisfying input moment conditions. The algorithm is based on the complex behavior of a high-dimensional dynamical system and is inspired by the maximum entropy principle of statistical inference. In this paper, we propose an extension of the herding algorithm, called entropic herding, which generates a sequence of distributions instead of points. Entropic herding is derived as the optimization of the target function obtained from the maximum entropy principle. Using the proposed entropic herding algorithm as a framework, we discuss a closer connection between herding and the maximum entropy principle. Specifically, we interpret the original herding algorithm as a tractable version of entropic herding, the ideal output distribution of which is mathematically represented. We further…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Statistical Mechanics and Entropy · Neural Networks and Applications
