mlsanityData to 7 Oct 2026

Gradient-Guided Importance Sampling for Learning Binary Energy-Based Models

arXiv 2210.05782 ↗First posted 11 Oct 2022cs.LG cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

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 our proposed method. The experimental results demonstrate that our method can significantly alleviate the limitations of ratio matching, perform more effectively in practice, and scale to high-dimensional problems. Our implementation is available at https://github.com/divelab/RMwGGIS.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 31 of its 70 references that are in the map. First posted on arXiv 11 Oct 2022.

Builds on

31 of 70 references.

References · 31

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  3. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  4. 2016Training Region-based Object Detectors with Online Hard Example Miningcited by 577
  5. 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 406
  6. 2019Your Classifier is Secretly an Energy Based Model and You Should Treat it Like Onecited by 402
  7. 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 381
  8. 2018GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoderscited by 375
  9. 2020GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generationcited by 301
  10. 2021How to Train Your Energy-Based Modelscited by 271
  11. 2020Permutation Invariant Graph Generation via Score-Based Generative Modelingcited by 263
  12. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
19 more
  1. 2018Learning Deep Generative Models of Graphscited by 227
  2. 2021GraphDF: A Discrete Flow Model for Molecular Graph Generationcited by 177
  3. 2016A Theory of Generative ConvNetcited by 174
  4. 2017Searching for Activation Functionscited by 158
  5. 2019Learning Non-Convergent Non-Persistent Short-Run MCMC Toward Energy-Based Modelcited by 147
  6. 2020Improved Contrastive Divergence Training of Energy Based Modelscited by 127
  7. 2019Graph Normalizing Flowscited by 103
  8. 2020Residual Energy-Based Models for Text Generationcited by 95
  9. 2021Oops I Took A Gradient: Scalable Sampling for Discrete Distributionscited by 92
  10. 2021GraphEBM: Molecular Graph Generation with Energy-Based Modelscited by 85
  11. 2019Flow Contrastive Estimation of Energy-Based Modelscited by 75
  12. 2018Learning Descriptor Networks for 3D Shape Synthesis and Analysiscited by 56
  13. 2017Learning Energy-Based Models as Generative ConvNets via Multi-grid Modeling and Samplingcited by 32
  14. 2020Learning Discrete Energy-based Models via Auxiliary-variable Local Explorationcited by 29
  15. 2018Conditional Noise-Contrastive Estimation of Unnormalised Modelscited by 25
  16. 2018Adversarial Contrastive Estimationcited by 23
  17. 2020Energy-based models for atomic-resolution protein conformationscited by 20
  18. 2015Gradient Importance Samplingcited by 7
  19. 2021Graph Energy-based Model for Substructure Preserving Molecular Designcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 2; 2025: 0; 2026: 1.

6 papers.