Rocío Mercado Oropeza (@rociomer.bsky.social)

Adaptive Allocation of Monte Carlo Samples for Efficient, Multifidelity Computational Screening of Metal–Organic Frameworks For applications in gas sensing, purification, and capture, we often wish to search a large set of metal–organic frameworks (MOFs) for the top-K in terms of their Henry coefficients for an adsorbate. A molecular simulation to predict the Henry coefficient of a MOF constitutes a Monte Carlo integration where each sample consists of inserting an adsorbate in the MOF at a random position, orientation, and configuration, then calculating the MOF–adsorbate interaction energy. Our idea is to leverage top-K arm identification algorithms, developed for the multi-armed bandit problem in reinforcement learning, to sequentially and adaptively allocate adsorbate insertions among the MOFs, in a data-driven manner, to obtain the most accurate top-K subset under a fixed insertion budget. By analogy, each MOF is a slot machine in a casino that, upon pulling its arm (inserting an adsorbate), offers a stochastic reward (a noisy estimate of its Henry coefficient) sampled from a static, unknown probability distribution. Each adaptive allocation algorithm (1) proceeds in a feedback loop of (i) allocate adsorbate insertions to MOF(s), (ii) update the running estimates of the Henry coefficients of the MOF(s), then (iii) judiciously allocate adsorbate insertions to the next MOF(s); (2) sequentially dials-up the fidelities of ongoing molecular simulations in the MOFs, giving a multifidelity computational screening; and (3) circumvents the need to hand-craft structural or chemical features of the MOFs for decision making. As a case study, we implement, benchmark, and analyze the sequential halving, successive accepts and rejects, and narrowing exploration (our proposed heuristic) algorithms to adaptively allocate xenon insertions to screen a set of ca. 300 MOFs for the top-K Xe Henry coefficient subset over differing insertion budgets. Provided with a sufficient budget, we find that these adaptive insertion algorithms can significantly reduce (by a factor of 2–3) the simple regret (sum of true minus empirical top-K true Henry coefficients) and error in the top-K subset of MOFs output by a computational screening. By another metric, adaptive insertion allocation provided a ca. 60% discount on the computational cost to identify the top-K MOFs with less than 5% error. We thereby demonstrate that top-K arm identification algorithms may generally be useful for more efficiently screening materials for various properties via Monte Carlo molecular simulations. This efficiency improvement is especially important when adopting more computationally expensive, sophisticated force fields or even ab initio calculations for the potential energy of configurations to lend higher-fidelity screenings. https://pubs.acs.org/doi/full/10.1021/acs.jctc.5c01431