mlsanityData to 14 Oct 2026

Training Energy-Based Normalizing Flow with Score-Matching Objectives

arXiv 2305.15267 ↗First posted 24 May 2023cs.LG stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

In this paper, we establish a connection between the parameterization of flow-based and energy-based generative models, and present a new flow-based modeling approach called energy-based normalizing flow (EBFlow). We demonstrate that by optimizing EBFlow with score-matching objectives, the computation of Jacobian determinants for linear transformations can be entirely bypassed. This feature enables the use of arbitrary linear layers in the construction of flow-based models without increasing the computational time complexity of each training iteration from O(D2L) to O(D3L) for an L-layered model that accepts D-dimensional inputs. This makes the training of EBFlow more efficient than the commonly-adopted maximum likelihood training method. In addition to the reduction in runtime, we enhance the training stability and empirical performance of EBFlow through a number of techniques developed based on our analysis of the score-matching methods. The experimental results demonstrate that our approach achieves a significant speedup compared to maximum likelihood estimation while outperforming prior methods with a noticeable margin in terms of negative log-likelihood (NLL).

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 31 of its 54 references that are in the map. First posted on arXiv 24 May 2023.

Builds on

31 of 54 references.

References · 31

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2014Deep Learning Face Attributes in the Wildcited by 3,693
  4. 2016Density estimation using Real NVPcited by 2,042
  5. 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,545
  6. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
  7. 2014NICE: Non-linear Independent Components Estimationcited by 1,058
  8. 2020Improved Techniques for Training Score-Based Generative Modelscited by 1,043
  9. 2016Conditional Image Generation with PixelCNN Decoderscited by 862
  10. 2017Masked Autoregressive Flow for Density Estimationcited by 684
  11. 2019Neural Spline Flowscited by 596
  12. 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
19 more
  1. 2018Deep Learning for Classical Japanese Literaturecited by 422
  2. 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 384
  3. 2018Invertible Residual Networkscited by 365
  4. 2019Residual Flows for Invertible Generative Modelingcited by 257
  5. 2020Improved Contrastive Divergence Training of Energy Based Modelscited by 130
  6. 2023Input Perturbation Reduces Exposure Bias in Diffusion Modelscited by 90
  7. 2019Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizationscited by 76
  8. 2020Efficient Learning of Generative Models via Finite-Difference Score Matchingcited by 49
  9. 2022Denoising Likelihood Score Matching for Conditional Score-based Data Generationcited by 46
  10. 2016Improving Variational Auto-Encoders using Householder Flowcited by 42
  11. 2019MintNet: Building Invertible Neural Networks with Masked Convolutionscited by 35
  12. 2019MaCow: Masked Convolutional Generative Flowcited by 32
  13. 2019Emerging Convolutions for Generative Normalizing Flowscited by 31
  14. 2014Accurate and Conservative Estimates of MRF Log-likelihood using Reverse Annealingcited by 18
  15. 2020Relative gradient optimization of the Jacobian term in unsupervised deep learningcited by 16
  16. 2022Towards Healing the Blindness of Score Matchingcited by 13
  17. 2020Self Normalizing Flowscited by 12
  18. 2022ButterflyFlow: Building Invertible Layers with Butterfly Matricescited by 12
  19. 2020Woodbury Transformations for Deep Generative Flowscited by 10

Built on by

Cited by year

Citing papers per year: 2024: 4; 2025: 2.

6 papers.