Federico Errica

Federico Errica

Auto-generated profile, based on publicly available information

Federico Errica

NEC Laboratories Europe

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2020 in Neural Networks
Verified
Journal Article
Closed access
DBDavide Bacciu
Davide Bacciu
FEFederico Errica
Federico Errica
AMAlessio Micheli
Alessio Micheli
MPMarco Podda
Marco Podda

29 April 2024 in npj Computational Materials
Verified
Journal Article
Open access
PDF file
VZViktor Zaverkin
Viktor Zaverkin
DHDavid Holzmüller
David Holzmüller
HCHenrik Christiansen
Henrik Christiansen
FEFederico Errica
Federico Errica
FAFrancesco Alesiani
Francesco Alesiani
JKJohannes Kästner
Johannes Kästner
Efficiently creating a concise but comprehensive data set for training machine-learned interatomic potentials (MLIPs) is an under-explored problem. Active learning, which uses biased or unbiased molecular dynamics (MD) to generate candidate pools, aims to address this objective. Existing biased and unbiased MD-simulation methods, however, are prone to miss either rare events or extrapolative regions—areas of the configurational space where unreliable predictions are made. This work demonstrates that MD, when biased by the MLIP’s energy uncertainty, simultaneously captures extrapolative regions and rare events, which is crucial for developing uniformly accurate MLIPs. Furthermore, exploiting automatic differentiation, we enhance bias-forces-driven MD with the concept of bias stress. We employ calibrated gradient-based uncertainties to yield MLIPs with similar or, sometimes, better accuracy than ensemble-based methods at a lower computational cost. Finally, we apply uncertainty-biased MD to alanine dipeptide and MIL-53(Al), generating MLIPs that represent both configurational spaces more accurately than models trained with conventional MD.

29 April 2021 in Frontiers in Molecular Biosciences
Verified
Journal Article
Open access
FEFederico Errica
Federico Errica
MGMarco Giulini
Marco Giulini
DBDavide Bacciu
Davide Bacciu
RMRoberto Menichetti
Roberto Menichetti
AMAlessio Micheli
Alessio Micheli
RPRaffaello Potestio
Raffaello Potestio
The limits of molecular dynamics (MD) simulations of macromolecules are steadily pushed forward by the relentless development of computer architectures and algorithms. The consequent explosion in the number and extent of MD trajectories induces the need for automated methods to rationalize the raw data and make quantitative sense of them. Recently, an algorithmic approach was introduced by some of us to identify the subset of a protein’s atoms, or mapping, that enables the most informative description of the system. This method relies on the computation, for a given reduced representation, of the associated mapping entropy, that is, a measure of the information loss due to such simplification; albeit relatively straightforward, this calculation can be time-consuming. Here, we describe the implementation of a deep learning approach aimed at accelerating the calculation of the mapping entropy. We rely on Deep Graph Networks, which provide extreme flexibility in handling structured input data and whose predictions prove to be accurate and-remarkably efficient. The trained network produces a speedup factor as large as 105 with respect to the algorithmic computation of the mapping entropy, enabling the reconstruction of its landscape by means of the Wang–Landau sampling scheme. Applications of this method reach much further than this, as the proposed pipeline is easily transferable to the computation of arbitrary properties of a molecular structure.

26 January 2023 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
DBDavide Bacciu
Davide Bacciu
FEFederico Errica
Federico Errica
AGAlessio Gravina
Alessio Gravina
LMLorenzo Madeddu
Lorenzo Madeddu
MPMarco Podda
Marco Podda
GSGiovanni Stilo
Giovanni Stilo
In the early phases of the COVID-19 pandemic, repurposing of drugs approved for use in other diseases helped counteract the aggressiveness of the virus. Therefore, the availability of effective and flexible methodologies to speed up and prioritize the repurposing process is fundamental to tackle present and future challenges to worldwide health. This work addresses the problem of drug repurposing through the lens of deep learning for graphs, by designing an architecture that exploits both structural and biological information to propose a reduced set of drugs that may be effective against an unknown disease. Our main contribution is a method to repurpose a drug against multiple proteins, rather than the most common single-drug/single-protein setting. The method leverages graph embeddings to encode the relevant proteins' and drugs' information based on gene ontology data and structural similarities. Finally, we publicly release a comprehensive and unified data repository for graph-based analysis to foster further studies on COVID-19 and drug repurposing. We empirically validate the proposed approach in a general drug repurposing setting, showing that it generalizes better than single protein repurposing schemes. We conclude the manuscript with an exemplified application of our method to the COVID-19 use case. All source code is publicly available.

1 October 2023 in Journal of Open Source Software
Verified
Journal Article
Open access
PDF file
FEFederico Errica
Federico Errica
DBDavide Bacciu
Davide Bacciu
AMAlessio Micheli
Alessio Micheli
The use of standardized evaluation procedures is a key component in the Machine Learning (ML) field to determine whether new approaches grant real advantages over others. This is especially true for fast-growing research areas, where a substantial amount of literature relentlessly appears every day. In the graph machine learning field, some evaluation issues have already been brought to light and partially addressed, but a general-purpose library for rigorous evaluations and reproducible experiments is lacking. We therefore introduce a new Python library, called PyDGN, to provide users with a system that lets them focus on models' development while ensuring empirical rigor and reproducibility of their results.

18 December 2023 in The Journal of Chemical Physics
Verified
Journal Article
Open access
PDF file
HCHenrik Christiansen
Henrik Christiansen
FEFederico Errica
Federico Errica
FAFrancesco Alesiani
Francesco Alesiani
The performance of Hamiltonian Monte Carlo simulations crucially depends on both the integration timestep and the number of integration steps. We present an adaptive general-purpose framework to automatically tune such parameters based on a local loss function that promotes the fast exploration of phase space. We show that a good correspondence between loss and autocorrelation time can be established, allowing for gradient-based optimization using a fully differentiable set-up. The loss is constructed in such a way that it also allows for gradient-driven learning of a distribution over the number of integration steps. Our approach is demonstrated for the one-dimensional harmonic oscillator and alanine dipeptide, a small protein commonly used as a test case for simulation methods. Through the application to the harmonic oscillator, we highlight the importance of not using a fixed timestep to avoid a rugged loss surface with many local minima, otherwise trapping the optimization. In the case of alanine dipeptide, by tuning the only free parameter of our loss definition, we find a good correspondence between it and the autocorrelation times, resulting in a >100 fold speedup in the optimization of simulation parameters compared to a grid search. For this system, we also extend the integrator to allow for atom-dependent timesteps, providing a further reduction of 25% in autocorrelation times.