Learning Unnormalized Statistical Models via Compositional Optimization
Not on the map. Why?
Abstract (arXiv)
Learning unnormalized statistical models (e.g., energy-based models) is computationally challenging due to the complexity of handling the partition function. To eschew this complexity, noise-contrastive estimation~(NCE) has been proposed by formulating the objective as the logistic loss of the real data and the artificial noise. However, as found in previous works, NCE may perform poorly in many tasks due to its flat loss landscape and slow convergence. In this paper, we study it a direct approach for optimizing the negative log-likelihood of unnormalized models from the perspective of compositional optimization. To tackle the partition function, a noise distribution is introduced such that the log partition function can be written as a compositional function whose inner function can be estimated with stochastic samples. Hence, the objective can be optimized by stochastic compositional optimization algorithms. Despite being a simple method, we demonstrate that it is more favorable than NCE by (1) establishing a fast convergence rate and quantifying its dependence on the noise distribution through the variance of stochastic estimators; (2) developing better results for one-dimensional Gaussian mean estimation by showing our objective has a much favorable loss landscape and hence our method enjoys faster convergence; (3) demonstrating better performance on multiple applications, including density estimation, out-of-distribution detection, and real image generation.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 47 of its 75 references that are in the map. First posted on arXiv 13 Jun 2023.
Builds on
47 of 75 references.
References · 47
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
- 2016Wide Residual Networkscited by 3,070
- 2015LSUN: Construction of a Large-scale Image Dataset using Deep Learning with Humans in the Loopcited by 1,355
- 2019Contrastive Multiview Codingcited by 1,301
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 673
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 539
- 2019Likelihood Ratios for Out-of-Distribution Detectioncited by 453
- 2019Your Classifier is Secretly an Energy Based Model and You Should Treat it Like Onecited by 405
35 more
- 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 384
- 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 306
- 2018SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimatorcited by 287
- 2017SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradientcited by 220
- 2016A Theory of Generative ConvNetcited by 174
- 2019Learning Non-Convergent Non-Persistent Short-Run MCMC Toward Energy-Based Modelcited by 148
- 2020Telescoping Density-Ratio Estimationcited by 108
- 2019On the Anatomy of MCMC-Based Maximum Likelihood Learning of Energy-Based Modelscited by 105
- 2014Stochastic Compositional Gradient Descent: Algorithms for Minimizing Compositions of Expected-Value Functionscited by 95
- 2019A Mutual Information Maximization Perspective of Language Representation Learningcited by 85
- 2019Flow Contrastive Estimation of Energy-Based Modelscited by 75
- 2016Cooperative Training of Descriptor and Generator Networkscited by 60
- 2021Hierarchical VAEs Know What They Don't Knowcited by 58
- 2018A Single Time-Scale Stochastic Approximation Method for Nested Stochastic Optimizationcited by 53
- 2020Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimizationcited by 51
- 2020Efficient Learning of Generative Models via Finite-Difference Score Matchingcited by 49
- 2016Accelerating Stochastic Composition Optimizationcited by 46
- 2022A Tale of Two Flows: Cooperative Learning of Langevin Flow and Normalizing Flow Toward Energy-Based Modelcited by 44
- 2020Learning Energy-Based Model with Variational Auto-Encoder as Amortized Samplercited by 43
- 2020An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectivescited by 42
- 2021Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergencecited by 35
- 2018Divergence Triangle for Joint Training of Generator Model, Energy-based Model, and Inference Modelcited by 34
- 2017Learning Energy-Based Models as Generative ConvNets via Multi-grid Modeling and Samplingcited by 32
- 2020Training Deep Energy-Based Models with f-Divergence Minimizationcited by 29
- 2019Multi-Level Composite Stochastic Optimization via Nested Variance Reductioncited by 28
- 2022Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applicationscited by 27
- 2019A Stochastic Composite Gradient Method with Incremental Variance Reductioncited by 26
- 2018Conditional Noise-Contrastive Estimation of Unnormalised Modelscited by 25
- 2018Adversarial Contrastive Estimationcited by 23
- 2019Autoregressive Energy Machinescited by 23
- 2022Optimal Algorithms for Stochastic Multi-Level Compositional Optimizationcited by 17
- 2022Multi-block-Single-probe Variance Reduced Estimator for Coupled Compositional Optimizationcited by 16
- 2021Analyzing and Improving the Optimization Landscape of Noise-Contrastive Estimationcited by 15
- 2021Bounds all around: training energy-based models with bidirectional boundscited by 10
- 2022Gradient-Guided Importance Sampling for Learning Binary Energy-Based Modelscited by 6
Built on by
Citing papers per year: 2024: 4; 2025: 0; 2026: 2.
6 papers.
- 2024Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reductioncited by 13
- 2024Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptionscited by 6
- 2024Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimizationcited by 2
- 2024A Unified View on Learning Unnormalized Distributions via Noise-Contrastive Estimationcited by 2
- 2026A Geometry-Aware Efficient Algorithm for Compositional Entropic Risk Minimizationcited by 1
- 2026Memory-Efficient Subspace Optimization with Residual Correction: From Momentum SGD to Muoncited by 0
- 2026Memory-Efficient Subspace Optimization with Residual Correction: From Momentum SGD to Muon14 Oct 2026
- 2026A Geometry-Aware Efficient Algorithm for Compositional Entropic Risk Minimization2 Feb 2026
- 2024A Unified View on Learning Unnormalized Distributions via Noise-Contrastive Estimation26 Sep 2024
- 2024Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization6 Jun 2024
- 2024Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions4 Jun 2024
- 2024Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction1 Jun 2024