Maximum Entropy Flow Networks
Not on the map. Why?
Abstract (arXiv)
Maximum entropy modeling is a flexible and popular framework for formulating statistical models given partial knowledge. In this paper, rather than the traditional method of optimizing over the continuous density directly, we learn a smooth and invertible transformation that maps a simple distribution to the desired maximum entropy distribution. Doing so is nontrivial in that the objective being maximized (entropy) is a function of the density itself. By exploiting recent developments in normalizing flow networks, we cast the maximum entropy problem into a finite-dimensional constrained optimization, and solve the problem by combining stochastic optimization with the augmented Lagrangian method. Simulation results demonstrate the effectiveness of our method, and applications to finance and computer vision show the flexibility and accuracy of using maximum entropy flow networks.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jan 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
3 papers.
- 2021Rectangular Flows for Manifold Learningcited by 49
- 2025Last Layer Empirical Bayescited by 1
- 2026Identifying Connectivity Distributions from Neural Dynamics Using Flowscited by 0
- 2026Identifying Connectivity Distributions from Neural Dynamics Using Flows27 Mar 2026
- 2025Last Layer Empirical Bayes21 May 2025
- 2021Rectangular Flows for Manifold Learning2 Jun 2021