mlsanityData to 14 Oct 2026

Mirror Descent Algorithms for Minimizing Interacting Free Energy

arXiv 2004.04555 ↗First posted 8 Apr 2020math.OC cs.LG cs.NAcited by 3

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 1.

3 papers.