SpHMC: Spectral Hamiltonian Monte Carlo
暂无分享,去创建一个
Zhanxing Zhu | Haoyi Xiong | Cheng-Zhong Xu | Kafeng Wang | Jiang Bian | Jun Huan | Zhishan Guo | Zhanxing Zhu | Chengzhong Xu | Haoyi Xiong | Jun Huan | Zhishan Guo | Jiang Bian | Kafeng Wang
[1] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[2] Yee Whye Teh,et al. Bayesian Learning via Stochastic Gradient Langevin Dynamics , 2011, ICML.
[3] Gang Niu,et al. Direct Density Derivative Estimation , 2016, Neural Computation.
[4] Nicolas Le Roux,et al. The Curse of Highly Variable Functions for Local Kernel Machines , 2005, NIPS.
[5] Zhanxing Zhu,et al. Stochastic Fractional Hamiltonian Monte Carlo , 2018, IJCAI.
[6] Heiko Strathmann. Kernel methods for Monte Carlo , 2018 .
[7] Michael Elad,et al. Dictionaries for Sparse Representation Modeling , 2010, Proceedings of the IEEE.
[8] Maurizio Filippone,et al. Enabling scalable stochastic gradient-based inference for Gaussian processes by employing the Unbiased LInear System SolvEr (ULISSE) , 2015, ICML.
[9] Ahn. Bayesian Posterior Sampling via Stochastic Gradient Fisher Scoring , 2012 .
[10] Amos J. Storkey,et al. Data Augmentation Generative Adversarial Networks , 2017, ICLR 2018.
[11] Lawrence Carin,et al. Preconditioned Stochastic Gradient Langevin Dynamics for Deep Neural Networks , 2015, AAAI.
[12] Jian Li,et al. Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference , 2018, Machine Learning.
[13] Yoshua Bengio,et al. Generative Adversarial Nets , 2014, NIPS.
[14] M. Bagnoli,et al. Log-concave probability and its applications , 2004 .
[15] David M. Blei,et al. A Variational Analysis of Stochastic Gradient Algorithms , 2016, ICML.
[16] Gregory Cohen,et al. EMNIST: an extension of MNIST to handwritten letters , 2017, CVPR 2017.
[17] Boris Polyak,et al. Acceleration of stochastic approximation by averaging , 1992 .
[18] Ahn. Large-Scale Distributed Bayesian Matrix Factorization using Stochastic Gradient MCMC , 2015 .
[19] W. K. Hastings,et al. Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .
[20] Martin J. Wainwright,et al. Log-concave sampling: Metropolis-Hastings algorithms are fast! , 2018, COLT.
[21] Simon Osindero,et al. Conditional Generative Adversarial Nets , 2014, ArXiv.
[22] Tianqi Chen,et al. A Complete Recipe for Stochastic Gradient MCMC , 2015, NIPS.
[23] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[24] Yann Ollivier,et al. Natural Langevin Dynamics for Neural Networks , 2017, GSI.
[25] Nando de Freitas,et al. An Introduction to MCMC for Machine Learning , 2004, Machine Learning.
[26] Arthur Gretton,et al. Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Families , 2015, NIPS.
[27] Masashi Sugiyama,et al. Direct Density-Derivative Estimation and Its Application in KL-Divergence Approximation , 2014, AISTATS.
[28] Ryan P. Adams,et al. Firefly Monte Carlo: Exact MCMC with Subsets of Data , 2014, UAI.
[29] David M. Blei,et al. Stochastic Gradient Descent as Approximate Bayesian Inference , 2017, J. Mach. Learn. Res..
[30] Roland Vollgraf,et al. Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms , 2017, ArXiv.
[31] Tianqi Chen,et al. Stochastic Gradient Hamiltonian Monte Carlo , 2014, ICML.
[32] Ramani Duraiswami,et al. Fast optimal bandwidth selection for kernel density estimation , 2006, SDM.
[33] Yair Weiss,et al. On GANs and GMMs , 2018, NeurIPS.
[34] David L Donoho,et al. Compressed sensing , 2006, IEEE Transactions on Information Theory.