Product Jacobi-Theta Boltzmann machines with score matching

03/10/2023
by   Andrea Pasquale, et al.
0

The estimation of probability density functions is a non trivial task that over the last years has been tackled with machine learning techniques. Successful applications can be obtained using models inspired by the Boltzmann machine (BM) architecture. In this manuscript, the product Jacobi-Theta Boltzmann machine (pJTBM) is introduced as a restricted version of the Riemann-Theta Boltzmann machine (RTBM) with diagonal hidden sector connection matrix. We show that score matching, based on the Fisher divergence, can be used to fit probability densities with the pJTBM more efficiently than with the original RTBM.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2019

Modelling conditional probabilities with Riemann-Theta Boltzmann Machines

The probability density function for the visible sector of a Riemann-The...
research
07/09/2018

Decreasing the size of the Restricted Boltzmann machine

We propose a method to decrease the number of hidden units of the restri...
research
03/16/2020

Learnergy: Energy-based Machine Learners

Throughout the last years, machine learning techniques have been broadly...
research
12/20/2017

Riemann-Theta Boltzmann Machine

A general Boltzmann machine with continuous visible and discrete integer...
research
01/14/2021

A Metaheuristic-Driven Approach to Fine-Tune Deep Boltzmann Machines

Deep learning techniques, such as Deep Boltzmann Machines (DBMs), have r...
research
02/16/2013

Understanding Boltzmann Machine and Deep Learning via A Confident Information First Principle

Typical dimensionality reduction methods focus on directly reducing the ...
research
04/30/2019

Restricted Boltzmann Machine Assignment Algorithm: Application to solve many-to-one matching problems on weighted bipartite graph

In this work an iterative algorithm based on unsupervised learning is pr...

Please sign up or login with your details

Forgot password? Click here to reset