Gradient-Guided Importance Sampling for Learning Binary Energy-Based Models
Meng Liu, Haoran Liu, Shuiwang Ji

TL;DR
This paper introduces RMwGGIS, a novel method that enhances learning discrete energy-based models by using gradient-guided importance sampling to improve efficiency and scalability.
Contribution
It proposes a new ratio matching approach with gradient-guided importance sampling that constructs an optimal proposal distribution for efficient learning of discrete EBMs.
Findings
Significantly alleviates ratio matching limitations
Performs more effectively in practice
Scales to high-dimensional problems
Abstract
Learning energy-based models (EBMs) is known to be difficult especially on discrete data where gradient-based learning strategies cannot be applied directly. Although ratio matching is a sound method to learn discrete EBMs, it suffers from expensive computation and excessive memory requirements, thereby resulting in difficulties in learning EBMs on high-dimensional data. Motivated by these limitations, in this study, we propose ratio matching with gradient-guided importance sampling (RMwGGIS). Particularly, we use the gradient of the energy function w.r.t. the discrete data space to approximately construct the provably optimal proposal distribution, which is subsequently used by importance sampling to efficiently estimate the original ratio matching objective. We perform experiments on density modeling over synthetic discrete data, graph generation, and training Ising models to evaluate…
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.
Code & Models
Videos
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Advanced Graph Neural Networks · Graph Theory and Algorithms
