Approximate inference algorithm is one of the fundamental research fields in machine learning. The two dominant theoretical inference frameworks in machine learning are variational inference (VI) and Markov chain Monte Carlo (MCMC). However, because of the fundamental limitation in the theory, it is very challenging to improve existing VI and MCMC methods on both the computational scalability and statistical efficiency. To overcome this obstacle, we propose a new theoretical inference framework called ergodic Inference based on the fundamental property of ergodic transformations. The key contribution of this work is to establish the theoretical foundation of ergodic inference for the development of practical algorithms in future work.
Meta-Posterior Consistency for the Bayesian Inference of Metastable System
Freie Universität Berlin, Department of Mathematics and Computer Science and Center for Scalable Data Analytics and Artificial Intelligence, Universität Liepzig(柏林自由大学数学与计算机科学系及可扩展数据与人工智能研究中心,莱比锡大学);Center for Scalable Data Analytics and Artificial Intelligence and Department of Computer Science, Universität Liepzig and Max Planck Institute for Mathematics in the Natural Sciences and Duke University, Departments of Statistical Science, Mathematics, Computer Science, and Biostatistics & Bioinformatics(可扩展数据与人工智能研究中心及计算机科学系,莱比锡大学;数学自然科学研究院和杜克大学统计科学、数学、计算机科学及生物统计与生物信息学系)
Reinforcement learning with non-ergodic reward increments: robustness via ergodicity transformations
Aalto University(阿尔托大学);University of Maryland(马里兰大学);University of Warwick(华威大学);London Mathematical Laboratory(伦敦数学实验室);Uppsala University(乌普萨拉大学);Santa Fe Institute(圣达菲研究所)