Mirror Descent Algorithms for Minimizing Interacting Free Energy

04/08/2020
by   Lexing Ying, et al.
0

This note considers the problem of minimizing interacting free energy. Motivated by the mirror descent algorithm, for a given interacting free energy, we propose a descent dynamics with a novel metric that takes into consideration the reference measure and the interacting term. This metric naturally suggests a monotone reparameterization of the probability measure. By discretizing the reparameterized descent dynamics with the explicit Euler method, we arrive at a new mirror-descent-type algorithm for minimizing interacting free energy. Numerical results are included to demonstrate the efficiency of the proposed algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2021

Hessian informed mirror descent

Inspired by the recent paper (L. Ying, Mirror descent algorithms for min...
research
02/09/2019

A stochastic version of Stein Variational Gradient Descent for efficient sampling

We propose in this work RBM-SVGD, a stochastic version of Stein Variatio...
research
06/29/2020

Natural Gradient for Combined Loss Using Wavelets

Natural gradients have been widely used in optimization of loss function...
research
11/10/2020

Projection Method for Saddle Points of Energy Functional in H^-1 Metric

Saddle points play important roles as the transition states of activated...
research
03/28/2018

A Hybrid Approach for Efficient Wireless Information and Power Transfer in Green C-RAN

In this paper, we consider a green cloud radio access network (C-RAN) wi...
research
04/16/2020

A Crank-Nicolson type minimization scheme for a hyperbolic free boundary problem

We consider a hyperbolic free boundary problem by means of minimizing ti...
research
06/13/2018

Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent

The Steiner Tree Problem (STP) in graphs is an important problem with va...

Please sign up or login with your details

Forgot password? Click here to reset