Bridging the Gap between Stochastic Gradient MCMC and Stochastic Optimization
Stochastic gradient Markov chain Monte Carlo (SG-MCMC) methods are Bayesian analogs to popular stochastic optimization methods; however, this connection is not well studied. We explore this relationship by applying simulated annealing to an SGMCMC algorithm. Furthermore, we extend recent SG-MCMC methods with two key components: i) adaptive preconditioners (as in ADAgrad or RMSprop), and ii) adapti
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Stochastic Gradient and Langevin Processes
[1509.01631] Stochastic gradient variational Bayes for gamma approximating distributions
Everything that Works Works Because it's Bayesian: Why Deep Nets Generalize?
Energy-Based Generative Adversarial Network
https://www.jstage.jst.go.jp/article/tjsai/31/6/31_AI30-C/_pdf
