English
Related papers

Related papers: Potential Score Matching: Debiasing Molecular Stru…

200 papers

General purpose optimization routines such as nlminb, optim (R) or nlmixed (SAS) are frequently used to estimate model parameters in nonstandard distributions. This paper presents Particle Swarm Optimization (PSO), as an alternative to many…

Machine Learning · Statistics 2024-05-22 Sisi Shao , Junhyung Park , Weng Kee Wong

Molecular conformation generation, a critical aspect of computational chemistry, involves producing the three-dimensional conformer geometry for a given molecule. Generating molecular conformation via diffusion requires learning to reverse…

Computational Physics · Physics 2023-10-10 Zihan Zhou , Ruiying Liu , Chaolong Ying , Ruimao Zhang , Tianshu Yu

In this work, the development and implementation of the effective stochastic potential (ESP) method is presented to perform efficient conformational sampling of molecules. The overarching goal of this work is to alleviate the computational…

Chemical Physics · Physics 2018-08-01 Jeremy A. Scher , Michael G. Bayne , Amogh Srihari , Shikha Nangia , Arindam Chakraborty

Denoising diffusion models have become ubiquitous for generative modeling. The core idea is to transport the data distribution to a Gaussian by using a diffusion. Approximate samples from the data distribution are then obtained by…

Score matching is an approach to learning probability distributions parametrized up to a constant of proportionality (e.g. Energy-Based Models). The idea is to fit the score of the distribution, rather than the likelihood, thus avoiding the…

Machine Learning · Computer Science 2024-01-31 Yilong Qin , Andrej Risteski

Data-driven methods based on machine learning have the potential to accelerate computational analysis of atomic structures. In this context, reliable uncertainty estimates are important for assessing confidence in predictions and enabling…

Machine Learning · Computer Science 2021-11-04 Jonas Busk , Peter Bjørn Jørgensen , Arghya Bhowmik , Mikkel N. Schmidt , Ole Winther , Tejs Vegge

Protein-ligand scoring is a central component of structure-based drug design, underpinning molecular docking, virtual screening, and pose optimization. Conventional physics-based energy functions are often computationally expensive,…

Biomolecules · Quantitative Biology 2026-02-24 Zhangfan Yang , Baoyun Chen , Dong Xu , Jia Wang , Ruibin Bai , Junkai Ji , Zexuan Zhu

Probabilistic models can be defined by an energy function, where the probability of each state is proportional to the exponential of the state's negative energy. This paper considers a generalization of energy-based models in which the…

Neurons and Cognition · Quantitative Biology 2016-05-25 Jan Humplik , Gašper Tkačik

We address the challenge of training diffusion models to sample from unnormalized energy distributions in the absence of data, the so-called diffusion samplers. Although these approaches have shown promise, they struggle to scale in more…

Machine Learning · Computer Science 2025-11-07 Minkyu Kim , Kiyoung Seong , Dongyeop Woo , Sungsoo Ahn , Minsu Kim

Molecule synthesis through machine learning is one of the fundamental problems in drug discovery. Current data-driven strategies employ one-step retrosynthesis models and search algorithms to predict synthetic routes in a top-bottom manner.…

Machine Learning · Computer Science 2024-06-05 Songtao Liu , Hanjun Dai , Yue Zhao , Peng Liu

We introduce a novel framework for efficient sampling from complex, unnormalised target distributions by exploiting multiscale dynamics. Traditional score-based sampling methods either rely on learned approximations of the score function or…

Computation · Statistics 2025-11-04 Paula Cordero-Encinar , Andrew B. Duncan , Sebastian Reich , O. Deniz Akyildiz

We present the particle stochastic approximation EM (PSAEM) algorithm for learning of dynamical systems. The method builds on the EM algorithm, an iterative procedure for maximum likelihood inference in latent variable models. By combining…

Computation · Statistics 2019-12-11 Andreas Lindholm , Fredrik Lindsten

Sampling from unnormalized densities using diffusion models has emerged as a powerful paradigm. However, while recent approaches that use least-squares `matching' objectives have improved scalability, they often necessitate significant…

Machine Learning · Computer Science 2026-03-03 Denis Blessing , Lorenz Richter , Julius Berner , Egor Malitskiy , Gerhard Neumann

Learning to sample from complex unnormalized distributions is a fundamental challenge in computational physics and machine learning. While score-based and variational methods have achieved success in continuous domains, extending them to…

Machine Learning · Statistics 2026-03-11 Lei Li , Zhen Wang , Lishuo Zhang

We theoretically investigate the phenomena of generalization and memorization in diffusion models. Empirical studies suggest that these phenomena are influenced by model complexity and the size of the training dataset. In our experiments,…

Machine Learning · Computer Science 2025-10-09 Anand Jerry George , Rodrigo Veiga , Nicolas Macris

Molecular Dynamics (MD) simulations are fundamental computational tools for the study of proteins and their free energy landscapes. However, sampling protein conformational changes through MD simulations is challenging due to the relatively…

Biomolecules · Quantitative Biology 2023-07-20 Diego E. Kleiman , Hassan Nadeem , Diwakar Shukla

Score-based Generative Models (SGMs) is one leading method in generative modeling, renowned for their ability to generate high-quality samples from complex, high-dimensional data distributions. The method enjoys empirical success and is…

Machine Learning · Computer Science 2024-01-30 Sixu Li , Shi Chen , Qin Li

This paper investigates score-based diffusion models when the underlying target distribution is concentrated on or near low-dimensional manifolds within the higher-dimensional space in which they formally reside, a common characteristic of…

Machine Learning · Computer Science 2025-01-03 Gen Li , Yuling Yan

Boltzmann machines (BMs) are powerful energy-based generative models, but their heavy training cost has largely confined practical use to Restricted BMs (RBMs) trained with an efficient learning method called contrastive divergence. More…

Machine Learning · Computer Science 2025-12-03 Kentaro Kubo , Hayato Goto

In light of the widespread success of generative models, a significant amount of research has gone into speeding up their sampling time. However, generative models are often sampled multiple times to obtain a diverse set incurring a cost…

Machine Learning · Computer Science 2023-11-27 Gabriele Corso , Yilun Xu , Valentin de Bortoli , Regina Barzilay , Tommi Jaakkola