scientific article; zbMATH DE number 6860811
zbMath1435.68261arXiv1512.09327MaRDI QIDQ4637029
Leonard Q. Hasenclever, Thibaut Lienart, Charles Blundell, Stefan Webb, Balaji Lakshminarayanan, Sebastian J. Vollmer, Yee Whye Teh
Publication date: 17 April 2018
Full work available at URL: https://arxiv.org/abs/1512.09327
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic approximationMarkov chain Monte CarloBayesian learningvariational inferencelarge-scale learningnatural gradientdeep learningexpectation propagationdistributed learningparameter serverposterior server
Artificial neural networks and deep learning (68T07) Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed algorithms (68W15)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
- A partially linear framework for massive heterogeneous data
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Sequential Monte Carlo Methods in Practice
- Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates
- Adaptive Thermostats for Noisy Gradient Systems
- (Non-) asymptotic properties of Stochastic Gradient Langevin Dynamics
- CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
- Graphical Models, Exponential Families, and Variational Inference
- Overcoming catastrophic forgetting in neural networks
- A Scalable Bootstrap for Massive Data
- A Stochastic Approximation Method
- The Information Geometry of Mirror Descent
This page was built for publication:
