all AI news
Laplace Matching for fast Approximate Inference in Latent Gaussian Models. (arXiv:2105.03109v2 [cs.LG] UPDATED)
Oct. 12, 2022, 1:14 a.m. | Marius Hobbhahn, Philipp Hennig
stat.ML updates on arXiv.org arxiv.org
Bayesian inference on non-Gaussian data is often non-analytic and requires
computationally expensive approximations such as sampling or variational
inference. We propose an approximate inference framework primarily designed to
be computationally cheap while still achieving high approximation quality. The
concept, which we call Laplace Matching, involves closed-form, approximate,
bi-directional transformations between the parameter spaces of exponential
families. These are constructed from Laplace approximations under
custom-designed basis transformations. The mappings can then be leveraged to
effectively turn a latent Gaussian distribution into …
More from arxiv.org / stat.ML updates on arXiv.org
Jobs in AI, ML, Big Data
Senior ML Researcher - 3D Geometry Processing | 3D Shape Generation | 3D Mesh Data
@ Promaton | Europe
Data Scientist, Senior
@ Pacific Gas and Electric Company | Oakland, CA, US, 94612
AML Reporting Data Specialist
@ Wise | Tallinn, Estonia
Bachelorarbeit im Bereich IT - "Einsatz von Generative AI im Konzernumfeld" (WiSe 24/25)
@ AGCO | Marktoberdorf, DE
Big Data Engineer
@ ACL Technology | Argentina
REF25217Q-Deputy Manager - MIS (Power BI, Dashboard, Excel) - GGN
@ WNS Global Services | Gurgaon, India