Abstract
We analyze and propose variants of the adaptive biasing force method. First, we prove the convergence of a version of the algorithm where the biasing force is estimated using a weighted occupation measure, with an explicit asymptotic variance. Second, we propose a new flavour of the algorithm adapted to high-dimensional reaction coordinates, for which the standard approaches suffer from the curse of dimensionality. More precisely, the free energy is approximated by a sum of tensor products of one-dimensional functions. The consistency of the tensor approximation is established. Numerical experiments on five-dimensional reaction coordinates demonstrate that the method is indeed able to capture correlations between them.
Funding Statement
This work was supported by the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement number 614492 and under the European Union’s Horizon 2020 Research and Innovation Programme, ERC Grant Agreement number 810367, project EMC2. It was also supported by the ANR JCJC project COMODO (ANR-19-CE46-0002) and the ANR Project EFI (ANR-17-CE40-0030) of the French National Research Agency.
Acknowledgements
The authors would like to thank the Associate Editor and the referees for their very useful comments and suggestions.
Citation
Virginie Ehrlacher. Tony Lelièvre. Pierre Monmarché. "Adaptive force biasing algorithms: New convergence results and tensor approximations of the bias." Ann. Appl. Probab. 32 (5) 3850 - 3888, October 2022. https://doi.org/10.1214/21-AAP1775
Information