Bayesian Learning via Stochastic Gradient Langevin Dynamics
暂无分享,去创建一个
[1] Andrzej Cichocki,et al. A New Learning Algorithm for Blind Signal Separation , 1995, NIPS.
[2] Aapo Hyvärinen,et al. Fast and robust fixed-point algorithms for independent component analysis , 1999, IEEE Trans. Neural Networks.
[3] A. Doucet,et al. Sequential MCMC for Bayesian model selection , 1999, Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics. SPW-HOS '99.
[4] Hoon Kim,et al. Monte Carlo Statistical Methods , 2000, Technometrics.
[5] G. Roberts,et al. Langevin Diffusions and Metropolis-Hastings Algorithms , 2002 .
[6] Christian P. Robert,et al. Monte Carlo Statistical Methods (Springer Texts in Statistics) , 2005 .
[7] H. Robbins. A Stochastic Approximation Method , 1951 .
[8] Léon Bottou,et al. The Tradeoffs of Large Scale Learning , 2007, NIPS.
[9] Chih-Jen Lin,et al. Trust region Newton methods for large-scale logistic regression , 2007, ICML '07.
[10] Chih-Jen Lin,et al. Trust Region Newton Method for Logistic Regression , 2008, J. Mach. Learn. Res..
[11] Andrew Gelman,et al. Handbook of Markov Chain Monte Carlo , 2011 .
[12] Radford M. Neal. MCMC Using Hamiltonian Dynamics , 2011, 1206.1901.
[13] M. Girolami,et al. Riemann manifold Langevin and Hamiltonian Monte Carlo methods , 2011, Journal of the Royal Statistical Society: Series B (Statistical Methodology).
[14] Zhu Yi-yong,et al. A New Algorithm for Blind Signal Separation Based on Relative Newton Method and Maximum Likelihood Criterion , 2012 .