Maximum Entropy Flow Networks

01/12/2017
by   Gabriel Loaiza-Ganem, et al.
0

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.

READ FULL TEXT
research
02/05/2020

Exploring Maximum Entropy Distributions with Evolutionary Algorithms

This paper shows how to evolve numerically the maximum entropy probabili...
research
10/03/2022

Reconciling econometrics with continuous maximum-entropy models

In the study of economic networks, econometric approaches interpret the ...
research
11/19/2014

Unification of field theory and maximum entropy methods for learning probability densities

The need to estimate smooth probability distributions (a.k.a. probabilit...
research
12/22/2021

Entropic Herding

Herding is a deterministic algorithm used to generate data points that c...
research
11/12/2021

Generalized active information: extensions to unbounded domains

In the last three decades, several measures of complexity have been prop...
research
06/25/2020

Maximum Multiscale Entropy and Neural Network Regularization

A well-known result across information theory, machine learning, and sta...

Please sign up or login with your details

Forgot password? Click here to reset