Mean-Field Microcanonical Gradient Descent
Not on the map. Why?
Abstract (arXiv)
Microcanonical gradient descent is a sampling procedure for energy-based models allowing for efficient sampling of distributions in high dimension. It works by transporting samples from a high-entropy distribution, such as Gaussian white noise, to a low-energy region using gradient descent. We put this model in the framework of normalizing flows, showing how it can often overfit by losing an unnecessary amount of entropy in the descent. As a remedy, we propose a mean-field microcanonical gradient descent that samples several weakly coupled data points simultaneously, allowing for better control of the entropy loss while paying little in terms of likelihood fit. We study these models in the context of financial time series, illustrating the improvements on both synthetic and real data.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 36 references that are in the map. First posted on arXiv 13 Mar 2024.
Builds on
15 of 36 references.
References · 15
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2022Diffusion Models: A Comprehensive Survey of Methods and Applicationscited by 1,107
- 2016Understanding Deep Convolutional Networkscited by 76
- 2021Sig-Wasserstein GANs for Time Series Generationcited by 60
- 2018Kymatio: Scattering Transforms in Pythoncited by 54
- 2020A Data-driven Market Simulator for Small Data Environmentscited by 34
- 2018Scattering Networks for Hybrid Representation Learningcited by 33
- 2018Multiscale Sparse Microcanonical Modelscited by 13
- 2019Maximum Entropy Models from Phase Harmonic Covariancescited by 13
- 2018Joint Time-Frequency Scatteringcited by 11
- 2023Scattering Spectra Models for Physicscited by 10
Built on by
Not cited yet.