When Are Equilibrium Networks Scoring Algorithms?
Abstract
Principal Component Analysis (PCA) and its exponential family extensions have three components: observed variables, latent variables and parameters of a linear transformation. The likelihood of the observation is an exponential family with canonical parameters that are a linear transformation of the latent variables. We show how joint maximum a-posteriori (MAP) estimates can be computed using a deep equilibrium model that computes roots of the score function. Our analysis provides a systematic way to relate neural network activation functions back to statistical assumptions about the observations. Our layers are implicitly differentiable, and can be fine-tuned in downstream tasks, as demonstrated on a synthetic task.
Cite
Text
Tsuchida and Ong. "When Are Equilibrium Networks Scoring Algorithms?." NeurIPS 2022 Workshops: SBM, 2022.Markdown
[Tsuchida and Ong. "When Are Equilibrium Networks Scoring Algorithms?." NeurIPS 2022 Workshops: SBM, 2022.](https://mlanthology.org/neuripsw/2022/tsuchida2022neuripsw-equilibrium/)BibTeX
@inproceedings{tsuchida2022neuripsw-equilibrium,
title = {{When Are Equilibrium Networks Scoring Algorithms?}},
author = {Tsuchida, Russell and Ong, Cheng Soon},
booktitle = {NeurIPS 2022 Workshops: SBM},
year = {2022},
url = {https://mlanthology.org/neuripsw/2022/tsuchida2022neuripsw-equilibrium/}
}