Pith. sign in

REVIEW 4 major objections 4 minor 37 references

Iterative variational learning of committor-consistent transition pathways using artificial neural networks

T0 review · 4 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Neural network learns transition paths that obey the committor, in a single iterative loop.

desk verdict A plausible hybrid of VCN and variational string method that works on benchmarks but overstates rate accuracy and leaves the committor-consistency proof partly heuristic. read the letter →

arxiv 2412.01947 v1 pith:DVPNAPI6 submitted 2024-12-02 physics.comp-ph cond-mat.stat-mechphysics.data-an

Alberto Megías , Sergio Contreras Arredondo , Cheng Giuseppe Chen , Chenyu Tang , Benoît Roux , Christophe Chipot This is my paper · ORCID
classification physics.comp-phcond-mat.stat-mechphysics.data-an
keywords committortransitionpathrareeventsartificialneuralnetworkstringmethodenhancedsamplingmoleculardynamicsfree-energycalculations
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes an iterative machine-learning scheme that solves a chicken-and-egg problem in rare-event molecular dynamics: finding a good transition pathway requires knowing the committor, while knowing the committor requires sampling near the pathway. Its neural network, the path-committor-consistent artificial neural network (PCCANN), learns the committor from biased trajectories and simultaneously refits the path so that the string tangent aligns with the committor gradient. The updated path defines a path-collective variable for a new biased simulation, and the cycle repeats until the string and committor converge. On benchmark potentials, a peptide isomerization, and chignolin folding, the converged strings cross the proper saddle points, reproduce rate constants from unbiased simulation, and expose bifurcating reactive tubes. If correct, the method gives enhanced-sampling simulations a reaction coordinate that is consistent with transition-path theory rather than merely convenient.

What carries the argument

The machinery is variational learning of the committor plus a string layer forced to be consistent with it. The committor $q(z)$ is the probability that a trajectory from $z$ reaches $B$ before $A$, and the variational principle minimizes $C_{qq}(\tau) = \langle (q(\tau)-q(0))^2 \rangle/2$, the two-point time correlation whose minimum gives the reactive flux. The network is a Siamese ANN with shared weights; it receives $z(t)$ and $z(t+\tau)$, and its output $F(z)$ is constrained by basin losses. The string is expanded in normalized Gaussians, $\sigma_k(z) \propto \exp(-\alpha (z - \hat z_k)^2)$, and the committor $q_s(z)$ is the least-squares fit of such an expansion to the network committor at the images. For large $\alpha$ the gradient of $q_s$ at the midpoints between neighboring images is parallel to the string tangent, so the loss $L_s$ learns, by construction, a path that follows the committor gradient; the iterative loop then resimulates along a path-collective variable defined by the current string, producing new biased data from which a better committor and string are learned.

What would settle it

Run the PCCANN on a system with a known full-dimensional committor, such as a two-dimensional potential with anisotropic diffusion, but train it on a deliberately incomplete CV, for example $x$ alone, and compare the predicted rate constant and string with exact values from long unbiased simulation. If the incomplete-CV CCS gives the same rates and paths, the Markovian-embedding assumption is not doing the work; if it gives different rates, the claim that the method recovers the true reactive path without adequate CVs is refuted. A sharper test: compute the angle between the converged string tangent and the true committor gradient from a long unbiased trajectory, since systematic misalignment near the separatrix would contradict the central consistency condition.

Watch

Extended reading notes

Core claim

The central claim is that one can learn the committor $q(z)$ and a transition pathway from the same network, and that the pathway should be built as a committor-consistent string (CCS): a chain of images whose tangent is parallel to $\nabla q_s$, the gradient of a softmax-expanded committor $q_s(z) = \sum_k b_k \sigma_k(z)$. The expansion coefficients $b$ are fixed by least-squares interpolation to the network committor at the images, and the string positions are optimized by minimizing a total loss $L_s = 2C_{q_s q_s} + k_b L'_b + k_{eq}L_{eq} + k_{tr}L_{tr}$, where $C_{q_s q_s}$ is the two-point correlation whose minimization is the variational committor principle and $L_{tr}$ enforces tangent-gradient alignment. Because biased simulation corrupts the dynamics, the time correlations are computed with an exponential reweighting that the paper states is valid for small lag $\tau$. Starting from a rough path, computing a committor-averaged path, and iterating defines the workflow. The paper reports that for the Berezhkovskii-Szabo potential the CCS reproduces anisotropic-diffusion effects that the minimum free-energy path misses; for Muller-Brown and the triple well it matches reference paths and captures temperature-dependent bifurcation; for NANMA it recovers known transition-state correlations; and for chignolin it identifies two folding pathways whose transition-state ensembles agree with an independent study.

Load-bearing premise

The method assumes that the hand-chosen collective variables $z(x)$ form a Markovian embedding: the committor depends only on these variables, and the time-lagged dynamics in them is Markovian at the lag $\tau$; the paper itself states in the Discussion that the method depends on a careful choice of CVs.

Editorial extensions

If this is right

  • Converged CCS paths provide a one-dimensional reaction coordinate for biased simulations that is consistent with transition-path theory, not merely a lowest-free-energy route.
  • Rate constants can be extracted from the learned committor through the flux formula $k_{AB} = C_{qq}/(p_A \tau)$, even when the sampling is biased, using the small-lag reweighting.
  • Bifurcating reactive tubes can be separated by clustering isocommittor slices, yielding a distinct CCS per pathway, as shown for the triple well and chignolin.
  • Anisotropic diffusion shifts the optimal string away from the MFEP, and the CCS captures that shift, so path-collective-variable simulations along a CCS should explore the physically dominant reactive tube.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper, the consistency condition suggests a practical convergence diagnostic for string methods generally: report the angle between the string tangent and $\nabla q_s$ along the path, rather than only checking free-energy convergence.
  • A direct stress test the authors do not report in full is to enlarge the CV set used as network input and check whether the CCS and rate constants drift; the NANMA comparison between $(\phi,\psi)$ and $(\phi,\psi,\theta,\omega)$ is a partial version of this, and applying it to chignolin with additional hydrogen bonds would separate CV-choice error from learning error.
  • The softmax width $\alpha$ is doing double duty, defining both the PCV and the committor expansion, and the paper notes different values are needed; an automatic schedule for $\alpha$ tied to the instantaneous mean squared displacement between images would make the method less dependent on hand-tuning.
  • The small-$\tau$ reweighting assumption could be tested head-on by comparing $C_{qq}$ computed from biased trajectories with $C_{qq}$ from an unbiased reference on a model with known rates; the BS potential results already provide a natural setting for this check.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper introduces PCCANN, an iterative neural-network method that couples a variational committor network (VCN) with a softmax-expanded 'committor-consistent string' (CCS). Starting from a guess path, the method runs biased MD simulations along a path-collective variable, learns a committor q(z) by minimizing the two-point correlation Cqq(τ), constructs a string whose tangent is aligned with the gradient of a Gaussian expansion qs(z) of the learned committor, and iterates until convergence. The method is applied to a 1D double-well, the Berezhkovskii–Szabo (BS), Müller–Brown (MB), and triple-well (TW) potentials, to NANMA, and to the mini-protein chignolin. The authors report recovery of known pathways and rate constants for the model potentials, detection of bifurcating reactive tubes in TW and chignolin, and a chignolin folding free-energy difference consistent with prior work.

Significance. If the central claims are correct, the PCCANN would be a valuable addition to the enhanced-sampling toolbox: it provides a way to iteratively refine both a committor and a reaction path from biased simulation data, and it explicitly handles anisotropic diffusion and multiple reactive pathways. The BS and MB benchmarks are genuinely convincing, and the iterative use of reweighted biased trajectories is an appealing practical strategy. However, the quantitative rate predictions for TW at 100 K and for chignolin deviate from the unbiased references by factors of roughly 70 and 55, respectively, which is hard to reconcile with the abstract's claim of reproducing 'established dynamics and rate constants'. Moreover, the physical consistency of the CCS hinges on the unverified assumption that the chosen CVs form a Markovian embedding and on the accuracy of the VCN committor, which is not independently validated for the molecular systems. These gaps currently prevent acceptance of the general claims.

major comments (4)
  1. [Methods, Eq. (7) and SI 'Unbiasing Scheme'] The reweighting expression Eq. (7) is stated to be valid for 'sufficiently small' values of τ, while the variational principle in Eq. (1) requires τ to be large enough that the dynamics in the CV subspace is Markovian and the slow reactive eigenmode dominates Cqq. The manuscript never quantifies this conflict or shows that the τ values used for the TW and chignolin systems satisfy both conditions. Because all loss functions and rate constants are computed from reweighted Cqq, this is a load-bearing gap. I ask for a concrete numerical test, e.g., computing the committor and kAB for a system with accessible unbiased dynamics (BS or MB) from both unbiased and reweighted biased trajectories at identical τ and demonstrating agreement or a clear convergence in τ.
  2. [Table 1, TW 100 K and chignolin rows] The biased PCCANN rate constants are 4.00e-3 vs 5.70e-5 ps^-1 for TW at 100 K and 8.76e-5 vs 1.6e-6 ps^-1 for chignolin, i.e., discrepancies of factors of about 70 and 55. The SI attributes the chignolin discrepancy to possible convergence problems in WTM-eABF, but this does not explain the systematic overestimation, and the TW discrepancy is not discussed quantitatively. Since the abstract claims accurate rate constants, these deviations undermine a central claim. The authors should either provide a quantitative explanation (e.g., a study of kAB versus tube width, or versus the convergence of δW) or explicitly limit their accuracy claim to the systems where agreement is demonstrated.
  3. [The Committor-Consistent String, Eqs. (5)-(6), and SI Eqs. (S1)-(S2)] The 'committor-consistency' of the CCS is imposed by construction: qs(z) in Eq. (5) is a softmax interpolant of the learned committor values at the images, and the loss Ltr in Eq. (6) explicitly penalizes misalignment between ∇qs and the string tangent. The SI proof therefore shows only that this particular expansion aligns with its own basis for large α, not that qs equals the physical committor. The paper should state this distinction clearly and provide an external validation of the learned committor (for example, by comparison with a committor estimated from unbiased shooting trajectories) for at least one system beyond the analytical potentials. As it stands, the physical relevance of the CCS rests entirely on the accuracy of the VCN committor, which is not independently verified for chignolin.
  4. [Discussion and Chignolin section] The variational principle in Eq. (1) is valid only if the chosen CVs form a Markovian embedding. The Discussion acknowledges that the method 'depends on a careful choice of CVs', but for chignolin the model uses only two hydrogen-bond distances, while the transition-state clusters in Fig. 6 and SI Fig. 12 involve Asp3–Thr6 and Asp3–Thr8 interactions not represented by these CVs. No test of Markovianity or of CV-set completeness is provided. This is the weakest load-bearing assumption for the biological application. I request either a numerical test (e.g., comparing the two-CV committor with one obtained from a larger CV set or from a Markov state model) or an explicit statement that the chignolin results are conditional on this CV set and may be biased by the projection.
minor comments (4)
  1. [SI, Eq. (8)] The double-well potential in Eq. (8) has two identical Gaussian terms, both centered at x = -2; one of them is presumably intended to be centered at x = +2.
  2. [Methods, first paragraph] There is a typo in 'Cartersian coordinates'; it should read 'Cartesian coordinates'.
  3. [Throughout and Table 1] The spelling of 'Berezhkovskii–Szabo' varies, including 'Berezhkovskii-Sazbo' in Table 1; please standardize. Similarly, 'Müller–Brown' is rendered inconsistently.
  4. [PCCANN and Iterative Learning Procedure] The manuscript does not report the actual time-lag values τ used for each system. Since the validity of the reweighting and of the variational principle depends on τ, a table of the τ values (or at least a range) should be included.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the CCS alignment is an explicit optimization target and the physical claims are benchmarked externally.

full rationale

The derivation chain is not circular. The committor is learned by minimizing the variational loss Lq = 2Cqq + kbLb (Eqs. 1-3), an objective taken from previously published variational committor theory (refs. 19, 22). The CCS is then defined via the softmax expansion qs(z) of Eq. 5, with coefficients least-squares fitted to the learned committor at the string images, and the images are optimized with Ls of Eq. 6, which explicitly includes Ltr, a term 'defined to ensure alignment of the gradient of qs with the tangent of the string.' The paper is transparent that the alignment is imposed, so the statement that 'the tangent of the string aligns with the gradient of qs' is a property of the construction, not a hidden prediction. The scientific content is validated against external references: analytical potentials, unbiased-MD committors, MFEP and SMwST paths, and independent MFPT and literature rate constants (Table 1). The chignolin rate discrepancy and the CV-dependence limitation are acknowledged in the Discussion and SI as convergence and modeling caveats rather than circular reductions. No fitted parameter is renamed as a prediction, and the self-citations to refs. 21 and 22 point to peer-reviewed prior derivations that do not already contain the present results.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central claim rests on a handful of hand-tuned hyperparameters (loss weights, alpha, thresholds, number of images) and on domain assumptions inherited from transition path theory and the reweighting approximation. No new physical entities are introduced.

free parameters (4)
  • loss weights kb, keq, ktr = system-dependent (e.g., kb=1 or 100; keq=1; ktr=1)
    Set by hand for each system to balance loss terms; no automatic selection.
  • Gaussian width alpha = system-dependent multiples of 1/MSD (3/MSD or 30/MSD)
    Controls sharpness of basis; chosen per system; proof of gradient alignment requires alpha large.
  • Ceq and Ctr thresholds = Ceq in [0.1,0.4], Ctr in [0.05,0.7]
    Thresholds for equidistance and alignment restraints, tuned per system.
  • number of images m = 10-30 depending on system
    Discretization of string; chosen by user.
assumptions (4)
  • domain assumption The variational principle: minimizing Cqq(tau) yields the true committor and minimizes reactive flux
    Based on TPT and refs 19-22; assumes Markovian dynamics in CV space with lag tau.
  • ad hoc to paper The committor can be represented by the Gaussian/softmax expansion qs(z) in Eq. (5), with tangent parallel to gradient for large alpha
    The expansion is chosen for convenience; the alignment property is proved only approximately in SI.
  • domain assumption The reweighting scheme in Eq. (7) is valid for the biased simulations
    Derived under small tau and small perturbation; used to compute unbiased correlations from biased trajectories.
  • domain assumption The chosen CVs are sufficient to describe the dynamics (Markovian embedding)
    The committor is assumed to be a function of the selected CVs; for chignolin only two H-bond distances are used.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Iterative variational learning of committor-consistent transition pathways using artificial neural networks." pith.science (2026). https://pith.science/paper/DVPNAPI6

@misc{pith2026241201947,
  author       = {Pith},
  title        = {Pith review of: Iterative variational learning of committor-consistent transition pathways using artificial neural networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DVPNAPI6}},
  note         = {Machine review of arXiv:2412.01947}
}
read the original abstract

This contribution introduces a neural-network-based approach to discover meaningful transition pathways underlying complex biomolecular transformations in coherence with the committor function. The proposed path-committor-consistent artificial neural network (PCCANN) iteratively refines the transition pathway by aligning it to the gradient of the committor. This method addresses the challenges of sampling in molecular dynamics simulations rare events in high-dimensional spaces, which is often limited computationally. Applied to various benchmark potentials and biological processes such as peptide isomerization and protein-model folding, PCCANN successfully reproduces established dynamics and rate constants, while revealing bifurcations and alternate pathways. By enabling precise estimation of transition states and free-energy barriers, this approach provides a robust framework for enhanced-sampling simulations of rare events in complex biomolecular systems.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

37 extracted references · 16 canonical work pages

  1. [1]

    Chen, H., Roux, B., Chipot, C.: Discovering reaction pathways, slow variables, and committor probabilities with machine learning. J. Chem. Theory Comput. 19(14), 4414–4426 (2023) https://doi.org/10.1021/acs.jctc.3c00028

    doi:10.1021/acs.jctc.3c00028 2023

  2. [2]

    The Journal of Chemical Physics 109(6), 2325–2338 (1998) https://doi

    Bicout, D.J., Szabo, A.: Electron transfer reaction dynamics in non-debye sol- vents. The Journal of Chemical Physics 109(6), 2325–2338 (1998) https://doi. org/10.1063/1.476800

    doi:10.1063/1.476800 1998

  3. [3]

    Biophysical Journal 80(1), 12–30 (2001) https: //doi.org/10.1016/S0006-3495(01)75992-9

    Schumaker, M.F., Pom` es, R., Roux, B.: Framework model for single proton conduction through gramicidin. Biophysical Journal 80(1), 12–30 (2001) https: //doi.org/10.1016/S0006-3495(01)75992-9

    work page doi:10.1016/s0006-3495(01)75992-9 2001

  4. [4]

    The Journal of Chemical Physics 152(14), 144102 (2020) https://doi.org/10.1063/5.0004838

    Wang, Y., Tiwary, P.: Understanding the role of predictive time delay and biased propagator in rave. The Journal of Chemical Physics 152(14), 144102 (2020) https://doi.org/10.1063/5.0004838

    work page doi:10.1063/5.0004838 2020

  5. [5]

    E, W., Ren, W., Vanden-Eijnden, E.: String method for the study of rare events. Phy. Rev. B 66(5), 052301 (2002) https://doi.org/10.1103/PhysRevB.66.052301

    doi:10.1103/physrevb.66.052301 2002

  6. [6]

    Pan, A.C., Sezer, D., Roux, B.: Finding transition pathways using the string method with swarms of trajectories. J. Phys. Chem. B 112(11), 3432–3440 (2008) https://doi.org/10.1021/jp0777059

    work page doi:10.1021/jp0777059 2008

  7. [7]

    Chen, H., Ogden, D., Pant, S., Cai, W., Tajkhorshid, E., Moradi, M., Roux, B., Chipot, C.: A companion guide to the string method with swarms of trajectories: Characterization, performance, and pitfalls. J. Chem. Theory Comput. 18(3), 1406–1422 (2022) https://doi.org/10.1021/acs.jctc.1c01049

    work page doi:10.1021/acs.jctc.1c01049 2022

  8. [8]

    ArXiv abs/1704.00805 (2017) https: //doi.org/10.48550/arXiv.1704.00805

    Gao, B., Pavel, L.: On the properties of the softmax function with application in game theory and reinforcement learning. ArXiv abs/1704.00805 (2017) https: //doi.org/10.48550/arXiv.1704.00805

    arXiv doi:10.48550/arxiv.1704.00805 2017

Show all 37 references
  1. [9]

    He, Z., Chipot, C., Roux, B.: Committor-consistent variational string method. J. Phys. Chem. Lett. 13(40), 9263–9271 (2022) https://doi.org/10.1021/acs.jpclett. 2c02529

    2022 doi

  2. [10]

    In: Bengio, Y., LeCun, Y

    Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: Bengio, Y., LeCun, Y. (eds.) 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings (2015)

    2015

  3. [11]

    Chen, Y., Hoskins, J., Khoo, Y., Lindsey, M.: Committor functions via tensor networks. J. Compute. Phys. 472, 111646 (2023) https://doi.org/10.1016/j.jcp. 2022.111646 23

    2023

  4. [12]

    Berezhkovskii, A., Szabo, A.: One-dimensional reaction coordinates for diffusive activated rate processes in many dimensions. J. Chem. Phys. 122(1), 014503 (2005) https://doi.org/10.1063/1.1818091

    2005 doi

  5. [13]

    M¨ uller, K., Brown, L.D.: Location of saddle points and minimum energy paths by a constrained simplex optimization procedure. Theor. Chim. Acta. 53, 75–93 (1979) https://doi.org/10.1007/BF00547608

    1979 doi

  6. [14]

    Strahan, J., Finkel, J., Dinner, A.R., Weare, J.: Predicting rare events using neural networks and short-trajectory data. J. Comput. Phys. 488, 112152 (2023) https://doi.org/10.1016/j.jcp.2023.112152

    2023

  7. [15]

    Metzner, P., Sch¨ utte, C., Vanden-Eijnden, E.: Illustration of transition path the- ory on a collection of simple examples. J. Chem. Phys. 125(8), 084110 (2006) https://doi.org/10.1063/1.2335447

    2006 doi

  8. [16]

    Multiscale Model

    Metzner, P., Sch¨ utte, C., Vanden-Eijnden, E.: Transition path theory for markov jump processes. Multiscale Model. Simul. 7(3), 1192–1219 (2009) https://doi.org/ 10.1137/070699500

    2009 doi

  9. [17]

    IEEE transactions on information theory 28(2), 129–137 (1982)

    Lloyd, S.: Least squares quantization in pcm. IEEE transactions on information theory 28(2), 129–137 (1982)

    1982

  10. [18]

    Maier, J.A., Martinez, C., Kasavajhala, K., Wickstrom, L., Hauser, K.E., Sim- merling, C.: ff14sb: Improving the accuracy of protein side chain and backbone parameters from ff99sb. J. Chem. Theory Comput. 11(8), 3696–3713 (2015) https://doi.org/10.1021/acs.jctc.5b00255 . PMID:...

    2015 doi

  11. [19]

    Feller, S.E., Zhang, Y.H., Pastor, R.W., Brooks, B.R.: Constant pressure molec- ular dynamics simulations — the Langevin piston method. J. Chem. Phys. 103, 4613–4621 (1995)

    1995

  12. [20]

    Oshima, H., Re, S., Sugita, Y.: Replica-exchange umbrella sampling combined with gaussian accelerated molecular dynamics for free-energy calculation of biomolecules. J. Chem. Theory Comput. 15(10), 5199–5208 (2019) https://doi. org/10.1021/acs.jctc.9b00761 . PMID: 31539245

    2019 doi

  13. [21]

    Yang, S., Nam, J., Dietschreit, J.C., G´ omez-Bombarelli, R.: Learning collective variables with synthetic data augmentation through physics-inspired geodesic interpolation. J. Chem. Theory Comput. 20(15), 6559–6568 (2024) https://doi. org/10.1021/acs.jctc.4c00435

    2024 doi

  14. [22]

    Chen, H., Fu, H., Chipot, C., Shao, X., Cai, W.: Overcoming free-energy barriers with a seamless combination of a biasing force and collective variable-independent boost potential. J. Chem. Theory Comput. 17, 3886–3894 (2021) https://doi.org/ 10.1021/acs.jctc.1c00103 24

    2021 doi

  15. [23]

    Expert Syst

    Park, H.-S., Jun, C.-H.: A simple and fast algorithm for k-medoids clustering. Expert Syst. Appl. 36(2, Part 2), 3336–3341 (2009) https://doi.org/10.1016/j. eswa.2008.01.039

    2009 doi

  16. [24]

    Kang, P., Trizio, E., Parrinello, M.: Computing the committor with the committor to study the transition state ensemble. Nat. Comput. Sci., 1–10 (2024) https: //doi.org/10.1038/s43588-024-00645-0

    2024 doi

  17. [25]

    Weiss, G.H.: First passage times for correlated random walks and some general- izations. J. Stat. Phys. 37, 325–330 (1984) https://doi.org/10.1007/BF01011837

    1984 doi

  18. [26]

    H¨ anggi, P., Talkner, P., Borkovec, M.: Reaction-rate theory: fifty years after Kramers. Rev. Mod. Phys. 62(2), 251 (1990) https://doi.org/10.1103/ RevModPhys.62.251

    1990

  19. [27]

    Roux, B.: Transition rate theory, spectral analysis, and reactive paths. J. Chem. Phys 156(13), 134111 (2022) https://doi.org/10.1063/5.0084209

    2022 doi

  20. [28]

    Pontryagin, L., Andronow, A., Witt, A.: On the statistical treatment of dynamical systems. Zh. Eksp. Teor. Fiz. 3, 165–180 (1933)

    1933

  21. [29]

    Szabo, A., Schulten, K., Schulten, Z.: First passage time approach to diffusion controlled reactions. J. Chem. Phys. 72, 4350–4357 (1980) https://doi.org/10. 1063/1.439715

    1980

  22. [30]

    Berezhkovskii, A.M., Szabo, A.: Committors, first-passage times, fluxes, Markov states, milestones, and all that. J. Chem. Phys. 150(5), 054106 (2019) https: //doi.org/10.1063/1.5079742

    2019 doi

  23. [31]

    Branduardi, D., Gervasio, F.L., Parrinello, M.: From A to B in free energy space. J. Chem. Phys. 126(5), 054103 (2007) https://doi.org/10.1063/1.2432340

    2007 doi

  24. [32]

    Comer, J., Chipot, C., Gonz´ alez-Nilo, F.D.: Calculating position-dependent dif- fusivity in biased molecular dynamics simulations. J. Chem. Theory Comput. 9, 876–882 (2013) https://doi.org/10.1021/ct300867e

    2013 doi

  25. [33]

    https://github.com/jeffcomer/ DiffusionFusion

    Comer, J.: DiffusionFusion (2017). https://github.com/jeffcomer/ DiffusionFusion

    2017

  26. [34]

    Hasyim, M.R., Batton, C.H., Mandadapu, K.K.: Supervised learning and the finite-temperature string method for computing committor functions and reaction rates. J. Chem. Phys. 157(18), 184111 (2022) https://doi.org/10.1063/5.0102423

    2022 doi

  27. [35]

    Liang, S., Singh, A.N., Zhu, Y., Limmer, D.T., Yang, C.: Probing reaction chan- nels via reinforcement learning. Mach. Learn.: Sci. Technol. 4(4), 045003 (2023) https://doi.org/10.1088/2632-2153/acfc33 25

    2023 doi

  28. [36]

    Strodel, B., Wales, D.J.: Free energy surfaces from an extended harmonic super- position approach and kinetics for alanine dipeptide. Chem. Phys. Lett. 466(4), 105–115 (2008) https://doi.org/10.1016/j.cplett.2008.10.085

    2008 doi

  29. [37]

    Science 334(6055), 517–520 (2011) https://doi.org/10.1126/science

    Lindorff-Larsen, K., Piana, S., Dror, R.O., Shaw, D.E.: How Fast-Folding Pro- teins Fold. Science 334(6055), 517–520 (2011) https://doi.org/10.1126/science. 1208351 26

    2011 doi

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.