scholarly journals Probabilistic Factor Oracles for Multidimensional Machine Improvisation

2018 ◽  
Vol 42 (2) ◽  
pp. 52-66 ◽  
Author(s):  
Ken Déguernel ◽  
Emmanuel Vincent ◽  
Gérard Assayag
Keyword(s):  
Message Passing ◽  
Probabilistic Models ◽  
Musical Work ◽  
Anticipatory Behavior ◽  
Machine Improvisation

This article presents two methods to generate automatic improvisation using training over multidimensional sequences. We consider musical features such as melody, harmony, timbre, etc., as dimensions. We first present a system combining interpolated probabilistic models with a factor oracle. The probabilistic models are trained on a corpus of musical work to learn the correlation between dimensions, and they are used to guide the navigation in the factor oracle to ensure a logical improvisation. Improvisations are therefore created in a way in which the intuition of a context is enriched with multidimensional knowledge. We then introduce a system creating multidimensional improvisations based on communication between dimensions via probabilistic message passing. The communication infers some anticipatory behavior on each dimension influenced by the others, creating a consistent multidimensional improvisation. Both systems were evaluated by professional improvisers during listening sessions. Overall, the systems received good feedback and showed encouraging results—first, on how multidimensional knowledge can improve navigation in the factor oracle and, second, on how communication through message passing can emulate the interactivity between dimensions or musicians.

scholarly journals Extended Variational Message Passing for Automated Approximate Bayesian Inference

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 815
Author(s):  
Semih Akbayrak ◽  
Ivan Bocharov ◽  
Bert de Vries
Keyword(s):  
Bayesian Inference ◽  
Probabilistic Model ◽  
Message Passing ◽  
Probabilistic Models ◽  
Hidden Variables ◽  
Generative Models ◽  
Wide Range ◽  
Complex Models ◽  
Algorithmic Framework ◽  
Approximate Bayesian

Variational Message Passing (VMP) provides an automatable and efficient algorithmic framework for approximating Bayesian inference in factorized probabilistic models that consist of conjugate exponential family distributions. The automation of Bayesian inference tasks is very important since many data processing problems can be formulated as inference tasks on a generative probabilistic model. However, accurate generative models may also contain deterministic and possibly nonlinear variable mappings and non-conjugate factor pairs that complicate the automatic execution of the VMP algorithm. In this paper, we show that executing VMP in complex models relies on the ability to compute the expectations of the statistics of hidden variables. We extend the applicability of VMP by approximating the required expectation quantities in appropriate cases by importance sampling and Laplace approximation. As a result, the proposed Extended VMP (EVMP) approach supports automated efficient inference for a very wide range of probabilistic model specifications. We implemented EVMP in the Julia language in the probabilistic programming package ForneyLab.jl and show by a number of examples that EVMP renders an almost universal inference engine for factorized probabilistic models.

scholarly journals Properties of Bethe Free Energies and Message Passing in Gaussian Models

2011 ◽  
Vol 41 ◽  
pp. 1-24 ◽  
Author(s):  
B. Cseke ◽  
T. Heskes
Keyword(s):  
Free Energy ◽  
Message Passing ◽  
Probabilistic Models ◽  
Mean Field ◽  
Necessary Condition ◽  
Free Energies ◽  
Gaussian Models ◽  
Message Passing Algorithm ◽  
Bethe Free Energy ◽  
The Moment

We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fractional Bethe free energy in terms of the moment parameters of the approximate marginals, derive a lower and an upper bound on the fractional Bethe free energy and establish a necessary condition for the lower bound to be bounded from below. It turns out that the condition is identical to the pairwise normalizability condition, which is known to be a sufficient condition for the convergence of the message passing algorithm. We show that stable fixed points of the Gaussian message passing algorithm are local minima of the Gaussian Bethe free energy. By a counterexample, we disprove the conjecture stating that the unboundedness of the free energy implies the divergence of the message passing algorithm.

scholarly journals Belief propagation for networks with loops

2021 ◽  
Vol 7 (17) ◽  
pp. eabf1211
Author(s):  
Alec Kirkley ◽  
George T. Cantwell ◽  
M. E. J. Newman
Keyword(s):  
Graphical Models ◽  
Message Passing ◽  
Probabilistic Models ◽  
Belief Propagation ◽  
Probability Distributions ◽  
Fast Calculation ◽  
Potential Applications ◽  
The Common ◽  
Bayesian Graphical Models ◽  
Standing Problem

Belief propagation is a widely used message passing method for the solution of probabilistic models on networks such as epidemic models, spin models, and Bayesian graphical models, but it suffers from the serious shortcoming that it works poorly in the common case of networks that contain short loops. Here, we provide a solution to this long-standing problem, deriving a belief propagation method that allows for fast calculation of probability distributions in systems with short loops, potentially with high density, as well as giving expressions for the entropy and partition function, which are notoriously difficult quantities to compute. Using the Ising model as an example, we show that our approach gives excellent results on both real and synthetic networks, improving substantially on standard message passing methods. We also discuss potential applications of our method to a variety of other problems.

Management of Economics and State "Bottom"

2020 ◽  
Vol 17 (6) ◽  
pp. 76-91
Author(s):  
E. D. Solozhentsev
Keyword(s):  
Quality Of Life ◽  
Artificial Intelligence ◽  
Probabilistic Models ◽  
Human Life ◽  
Special Software ◽  
Human Quality ◽  
Relationship Of ◽  
The Relationship

The scientific problem of economics “Managing the quality of human life” is formulated on the basis of artificial intelligence, algebra of logic and logical-probabilistic calculus. Managing the quality of human life is represented by managing the processes of his treatment, training and decision making. Events in these processes and the corresponding logical variables relate to the behavior of a person, other persons and infrastructure. The processes of the quality of human life are modeled, analyzed and managed with the participation of the person himself. Scenarios and structural, logical and probabilistic models of managing the quality of human life are given. Special software for quality management is described. The relationship of human quality of life and the digital economy is examined. We consider the role of public opinion in the management of the “bottom” based on the synthesis of many studies on the management of the economics and the state. The bottom management is also feedback from the top management.

Message Passing Neural Networks for Partial Charge Assignment to Metal-Organic Frameworks

2020 ◽  
Author(s):  
Ali Raza ◽  
Arni Sturluson ◽  
Cory Simon ◽  
Xiaoli Fern
Keyword(s):  
Electronic Structure ◽  
Message Passing ◽  
Gas Adsorption ◽  
Metal Organic Frameworks ◽  
Computational Cost ◽  
Electronic Structure Calculations ◽  
High Fidelity ◽  
Partial Charges ◽  
Metal Organic ◽  
Structure Calculations

Virtual screenings can accelerate and reduce the cost of discovering metal-organic frameworks (MOFs) for their applications in gas storage, separation, and sensing. In molecular simulations of gas adsorption/diffusion in MOFs, the adsorbate-MOF electrostatic interaction is typically modeled by placing partial point charges on the atoms of the MOF. For the virtual screening of large libraries of MOFs, it is critical to develop computationally inexpensive methods to assign atomic partial charges to MOFs that accurately reproduce the electrostatic potential in their pores. Herein, we design and train a message passing neural network (MPNN) to predict the atomic partial charges on MOFs under a charge neutral constraint. A set of ca. 2,250 MOFs labeled with high-fidelity partial charges, derived from periodic electronic structure calculations, serves as training examples. In an end-to-end manner, from charge-labeled crystal graphs representing MOFs, our MPNN machine-learns features of the local bonding environments of the atoms and learns to predict partial atomic charges from these features. Our trained MPNN assigns high-fidelity partial point charges to MOFs with orders of magnitude lower computational cost than electronic structure calculations. To enhance the accuracy of virtual screenings of large libraries of MOFs for their adsorption-based applications, we make our trained MPNN model and MPNN-charge-assigned computation-ready, experimental MOF structures publicly available.<br>

Sign in / Sign up

Export Citation Format

Share Document