Pith. sign in

REVIEW

Accurate Sampling with Noisy Forces from Approximate Computing

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 1907.08497 v3 pith:XPCWBOIX submitted 2019-07-19 physics.comp-ph cond-mat.stat-mechcs.NAmath.NAphysics.chem-ph

Accurate Sampling with Noisy Forces from Approximate Computing

classification physics.comp-ph cond-mat.stat-mechcs.NAmath.NAphysics.chem-ph
keywords computingapproximateaccelerationaccuratealgorithmicapplicationarithmeticatomistic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In scientific computing, the acceleration of atomistic computer simulations by means of custom hardware is finding ever growing application. A major limitation, however, is that the high efficiency in terms of performance and low power consumption entails the massive usage of low-precision computing units. Here, based on the approximate computing paradigm, we present an algorithmic method to rigorously compensate for numerical inaccuracies due to low-accuracy arithmetic operations, yet still obtaining exact expectation values using a properly modified Langevin-type equation.

discussion (0)

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