On the Convergence Rate of Gaussianization with Random Rotations
Abstract
Gaussianization is a simple generative model that can be trained without backpropagation. It has shown compelling performance on low dimensional data. As the dimension increases, however, it has been observed that the convergence speed slows down. We show analytically that the number of required layers scales linearly with the dimension for Gaussian input. We argue that this is because the model is unable to capture dependencies between dimensions. Empirically, we find the same linear increase in cost for arbitrary input $p(x)$, but observe favorable scaling for some distributions. We explore potential speed-ups and formulate challenges for further research.
Cite
Text
Draxler et al. "On the Convergence Rate of Gaussianization with Random Rotations." International Conference on Machine Learning, 2023.Markdown
[Draxler et al. "On the Convergence Rate of Gaussianization with Random Rotations." International Conference on Machine Learning, 2023.](https://mlanthology.org/icml/2023/draxler2023icml-convergence/)BibTeX
@inproceedings{draxler2023icml-convergence,
title = {{On the Convergence Rate of Gaussianization with Random Rotations}},
author = {Draxler, Felix and Kühmichel, Lars and Rousselot, Armand and Müller, Jens and Schnoerr, Christoph and Koethe, Ullrich},
booktitle = {International Conference on Machine Learning},
year = {2023},
pages = {8449-8468},
volume = {202},
url = {https://mlanthology.org/icml/2023/draxler2023icml-convergence/}
}