Pith. sign in

REVIEW 1 cited by

Efficient Rare Event Sampling with Unsupervised Normalising Flows

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 2401.01072 v1 pith:JUWTULU2 submitted 2024-01-02 physics.comp-ph cond-mat.dis-nncond-mat.softcond-mat.stat-mechphysics.data-an

classification physics.comp-phcond-mat.dis-nncond-mat.softcond-mat.stat-mechphysics.data-an
keywords eventsraresystemsflowressamplingcarlodataincreasingly
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

From Physics and Biology to Seismology and Economics, the behaviour of countless systems is determined by impactful yet unlikely transitions between metastable states known as \emph{rare events}, the study of which is essential for understanding and controlling these systems' properties. Classical computational methods to sample rare events remain prohibitively inefficient, and are a bottleneck for enhanced samplers requiring prior data. Here, we introduce a novel framework, FlowRES that uses unsupervised normalising flow neural networks to enhance Monte Carlo sampling of rare events by generating high-quality nonlocal Monte Carlo proposals. We validate FlowRES by sampling the transition path ensembles of equilibrium and non-equilibrium systems of Brownian particles exploring increasingly complex potential surfaces. Beyond eliminating requirements for prior data, FlowRES features key advantages over established samplers: no collective variables need defining, its efficiency remains constant even as events become increasingly unlikely, and it can handle systems with multiple routes between states.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Transition-path sampling for Run-and-Tumble particles

    cond-mat.soft 2024-11 conditional novelty 5.0 of 10

    A transition-path sampling algorithm for run-and-tumble particles is derived, validated, and used to show that tumbling reduces mean barrier-crossing time.

Pith tools