Jacopo Venturin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jacopo Venturin has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Cecilia Clementi
Department of Physics, Freie Universität Berlin, Berlin, Germany
4 shared publications - Alessandro Caruso
Department of Physics, Freie Universität Berlin, Berlin, Germany
3 shared publications - Edoardo Rolando
Department of Physics, Freie Universität Berlin, Berlin, Germany
3 shared publications - Frank Noé
Freie Universität Berlin
3 shared publications - Aldo S. Pasos-Trejo
Department of Physics Freie Universität Berlin Berlin Germany
2 shared publications - Iryna Zaporozhets
Department of Physics, Freie Universität Berlin, Berlin, Germany
2 shared publications
Latest Publications
- Open Access
- 18 February 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Extending the range of graph neural networks with global encodings
Graph Neural Networks (GNNs) are routinely used in molecular physics, social sciences, and economics to model many-body interactions in graph-like systems. However, GNNs are inherently local and can suffer from information flow bottlenecks. This is particularly problematic when modeling large molecular systems, where dispersion forces and local electric field variations drive collective structural changes. We introduce RANGE, a model-agnostic framework that employs an attention-based aggregation-broadcast mechanism that significantly reduces oversquashing effects, and achieves remarkable accuracy in capturing long-range interactions with linear scaling. Notably, RANGE integrates attention with positional encodings and regularization to dynamically expand virtual representations in virtual-node message-passing implementations. Across multiple state-of-the-art baselines, RANGE consistently restores long-range information, enabling the models to correctly predict electrostatic and dispersion-driven behavior even in out-of-distribution extrapolation tasks, where other unmodified baselines fail. Compared with other long-range paradigms, RANGE achieves the highest accuracy while requiring significantly less computational overhead, and it enables stable and scalable molecular dynamic simulations. RANGE offers accurate and efficient modeling of long-range interactions for simulating large molecular systems.
- 18 February 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Open AccessExtending the range of graph neural networks with global encodings
Graph Neural Networks (GNNs) are routinely used in molecular physics, social sciences, and economics to model many-body interactions in graph-like systems. However, GNNs are inherently local and can suffer from information flow bottlenecks. This is particularly problematic when modeling large molecular systems, where dispersion forces and local electric field variations drive collective structural changes. We introduce RANGE, a model-agnostic framework that employs an attention-based aggregation-broadcast mechanism that significantly reduces oversquashing effects, and achieves remarkable accuracy in capturing long-range interactions with linear scaling. Notably, RANGE integrates attention with positional encodings and regularization to dynamically expand virtual representations in virtual-node message-passing implementations. Across multiple state-of-the-art baselines, RANGE consistently restores long-range information, enabling the models to correctly predict electrostatic and dispersion-driven behavior even in out-of-distribution extrapolation tasks, where other unmodified baselines fail. Compared with other long-range paradigms, RANGE achieves the highest accuracy while requiring significantly less computational overhead, and it enables stable and scalable molecular dynamic simulations. RANGE offers accurate and efficient modeling of long-range interactions for simulating large molecular systems.
- Top Cited PapersOpen Access
- 23 January 2026
- Published by Wiley in WIREs Computational Molecular Science
- Vol. 16 (1)
Breaking the Barriers of Molecular Dynamics With Deep‐Learning: Opportunities, Pitfalls, and How to Navigate Them
Molecular Dynamics (MD) has established itself as a pivotal computational tool across various scientific domains, including chemistry, biology, and materials science. Despite its widespread utility, MD faces inherent challenges, such as accuracy limitations, computational speed, and sampling efficiency. In recent years, machine learning, particularly deep learning, has seen significant advancements and is increasingly being integrated into MD processes. This review explores how deep learning can mitigate the issues associated with MD by addressing them from multiple angles. However, deep learning techniques introduce their own set of hurdles, including the need for extensive data, issues of interpretability, high computational costs, and concerns regarding transferability. Here, we discuss recent progress in the field of deep learning to overcome these obstacles. Ultimately, our goal is to demonstrate that, by leveraging the advancements made in both the MD and the machine learning community, deep learning has the potential to significantly enhance the capabilities of MD, paving the way to new scientific discovery. This article is categorized under: Data Science > Artificial Intelligence/Machine Learning Molecular and Statistical Mechanics > Molecular Mechanics Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods
- 23 January 2026
- Published by Wiley in WIREs Computational Molecular Science
- Vol. 16 (1)
Top Cited PapersOpen AccessBreaking the Barriers of Molecular Dynamics With Deep‐Learning: Opportunities, Pitfalls, and How to Navigate Them
Molecular Dynamics (MD) has established itself as a pivotal computational tool across various scientific domains, including chemistry, biology, and materials science. Despite its widespread utility, MD faces inherent challenges, such as accuracy limitations, computational speed, and sampling efficiency. In recent years, machine learning, particularly deep learning, has seen significant advancements and is increasingly being integrated into MD processes. This review explores how deep learning can mitigate the issues associated with MD by addressing them from multiple angles. However, deep learning techniques introduce their own set of hurdles, including the need for extensive data, issues of interpretability, high computational costs, and concerns regarding transferability. Here, we discuss recent progress in the field of deep learning to overcome these obstacles. Ultimately, our goal is to demonstrate that, by leveraging the advancements made in both the MD and the machine learning community, deep learning has the potential to significantly enhance the capabilities of MD, paving the way to new scientific discovery. This article is categorized under: Data Science > Artificial Intelligence/Machine Learning Molecular and Statistical Mechanics > Molecular Mechanics Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods
- Top Cited PapersOpen Access
- 18 July 2025
- Published by Springer Nature in Nature Chemistry
- Vol. 17 (8) , 1284-1292
Navigating protein landscapes with a machine-learned transferable coarse-grained model
The most popular and universally predictive protein simulation models employ all-atom molecular dynamics, but they come at extreme computational cost. The development of a universal, computationally efficient coarse-grained (CG) model with similar prediction performance has been a long-standing challenge. By combining recent deep-learning methods with a large and diverse training set of all-atom protein simulations, we here develop a bottom–up CG force field with chemical transferability, which can be used for extrapolative molecular dynamics on new sequences not used during model parameterization. We demonstrate that the model successfully predicts metastable states of folded, unfolded and intermediate structures, the fluctuations of intrinsically disordered proteins and relative folding free energies of protein mutants, while being several orders of magnitude faster than an all-atom model. This showcases the feasibility of a universal and computationally efficient machine-learned CG model for proteins.
- 18 July 2025
- Published by Springer Nature in Nature Chemistry
- Vol. 17 (8) , 1284-1292
Top Cited PapersOpen AccessNavigating protein landscapes with a machine-learned transferable coarse-grained model
The most popular and universally predictive protein simulation models employ all-atom molecular dynamics, but they come at extreme computational cost. The development of a universal, computationally efficient coarse-grained (CG) model with similar prediction performance has been a long-standing challenge. By combining recent deep-learning methods with a large and diverse training set of all-atom protein simulations, we here develop a bottom–up CG force field with chemical transferability, which can be used for extrapolative molecular dynamics on new sequences not used during model parameterization. We demonstrate that the model successfully predicts metastable states of folded, unfolded and intermediate structures, the fluctuations of intrinsically disordered proteins and relative folding free energies of protein mutants, while being several orders of magnitude faster than an all-atom model. This showcases the feasibility of a universal and computationally efficient machine-learned CG model for proteins.
- Open Access
- 17 March 2025
- Published by Springer Nature in Research Square
Extending the RANGE of Graph Neural Networks: Relaying Attention Nodes for Global Encoding
Graph Neural Networks (GNNs) are routinely used in molecular physics, social sciences, and economics to model many-body interactions in graph-like systems. However, GNNs are inherently local and can suffer from information flow bottlenecks. This is particularly problematic when modeling large molecular systems, where dispersion forces and local electric field variations drive collective structural changes. Existing solutions face challenges related to computational cost and scalability. We introduce RANGE, a model-agnostic framework that employs an attention-based aggregation-broadcast mechanism that significantly reduces oversquashing effects, and achieves remarkable accuracy in capturing long-range interactions at a negligible computational cost. Notably, RANGE is the first virtual-node message-passing implementation to integrate attention with positional encodings and regularization to dynamically expand virtual representations. This work lays the foundation for next-generation of machine-learned force fields, offering accurate and efficient modeling of long-range interactions for simulating large molecular systems.
- 17 March 2025
- Published by Springer Nature in Research Square
Open AccessExtending the RANGE of Graph Neural Networks: Relaying Attention Nodes for Global Encoding
Graph Neural Networks (GNNs) are routinely used in molecular physics, social sciences, and economics to model many-body interactions in graph-like systems. However, GNNs are inherently local and can suffer from information flow bottlenecks. This is particularly problematic when modeling large molecular systems, where dispersion forces and local electric field variations drive collective structural changes. Existing solutions face challenges related to computational cost and scalability. We introduce RANGE, a model-agnostic framework that employs an attention-based aggregation-broadcast mechanism that significantly reduces oversquashing effects, and achieves remarkable accuracy in capturing long-range interactions at a negligible computational cost. Notably, RANGE is the first virtual-node message-passing implementation to integrate attention with positional encodings and regularization to dynamically expand virtual representations. This work lays the foundation for next-generation of machine-learned force fields, offering accurate and efficient modeling of long-range interactions for simulating large molecular systems.