Pith. sign in

REVIEW

The Bayesian Committee Approach for Computational Physics Problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.06086 v1 pith:UG4M5CON submitted 2020-11-12 physics.comp-ph cond-mat.dis-nncond-mat.mtrl-scicond-mat.quant-gas

The Bayesian Committee Approach for Computational Physics Problems

classification physics.comp-ph cond-mat.dis-nncond-mat.mtrl-scicond-mat.quant-gas
keywords functionmethodphasebayesiancommitteeexamplesamplingcomputational
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this work, we propose a method for efficient learning of a multi-dimensional function. This method combines the Bayesian neural networks and the query-by-committee method. A committee made of deep Bayesian neural networks not only can provide uncertainty of the prediction but also can provide the discrepancy between committee members. Both the uncertainty and the discrepancy are large in the regions where the target function varies rapidly, and therefore, both quantities can be used to guide sampling data to such regions. In this way, we can learn a function accurately with the number of queried data points much less than uniform sampling. Here we test our method with two examples. One example is to find a rare phase in a phase diagram, which is separated from other phases by a second-order phase transition. In this example, the target function is the susceptibility function, and since the divergence of the susceptibility function locates the phase diagram, the task of searching such a phase perfectly matches the advantage of our method. Another example is to learn the distribution function for Monte Carlo integration of a high-dimensional function. In both examples, we show that our method performs significantly efficiently than uniform sampling. Our method can find broad applications in computational scientific problems.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.