A block successive lower-bound maximization algorithm for the maximum pseudo-likelihood estimation of fully visible Boltzmann machines

DOI10.1162/NECO_A_00813MaRDI QIDQ5380400zbMATH OpenOpenAlexWikidataFDO

Authors Ian A. Wood, Hien D. Nguyen

Publication date 4 June 2019

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/neco_a_00813

Mathematics Subject Classification ID

Point estimation (62F10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Consistency of Pseudolikelihood Estimation of Fully Visible Boltzmann Machines
• Learning algorithm for Boltzmann machines using max-product algorithm and pseudo-likelihood
• Accelerate training of restricted Boltzmann machines via iterative conditional maximum likelihood estimation
• A Novel Parameter Estimation Method for Boltzmann Machines
• scientific article; zbMATH DE number 1928639

Cites work

• scientific article; zbMATH DE number 63499 (Why is no real title available?)
• A Simplex Method for Function Minimization
• A unified convergence analysis of block successive minimization methods for nonsmooth optimization
• Consistency of Pseudolikelihood Estimation of Fully Visible Boltzmann Machines
• Optimization

Cited in

(5)

• Near universal consistency of the maximum pseudolikelihood estimator for discrete models
• Learning algorithm for Boltzmann machines using max-product algorithm and pseudo-likelihood
• Accelerate training of restricted Boltzmann machines via iterative conditional maximum likelihood estimation
• Consistency of Pseudolikelihood Estimation of Fully Visible Boltzmann Machines
• Full-span log-linear model and fast learning algorithm

This page was built for publication: A block successive lower-bound maximization algorithm for the maximum pseudo-likelihood estimation of fully visible Boltzmann machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380400)