320 citations · 541 across the 18 of their papers we have counts for
6 papers · 1 filter
Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreaching
Federico Errica, Henrik Christiansen, Viktor Zaverkin +3
Long-range interactions are essential for the correct description of complex systems in many scientific fields. The price to pay for including them in the calculations, however, is…
Uncertainty-biased molecular dynamics for learning uniformly accurate interatomic potentials
Viktor Zaverkin, David Holzmüller, Henrik Christiansen +5
Efficiently creating a concise but comprehensive data set for training machine-learned interatomic potentials (MLIPs) is an under-explored problem. Active learning, which uses bias…
Self-Tuning Hamiltonian Monte Carlo for Accelerated Sampling
Henrik Christiansen, Federico Errica, 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-purpos…
Investigating the Interplay between Features and Structures in Graph Learning
Daniele Castellana, Federico Errica
In the past, the dichotomy between homophily and heterophily has inspired research contributions toward a better understanding of Deep Graph Networks' inductive bias. In particular…
Modeling Edge Features with Deep Bayesian Graph Networks
Daniele Atzeni, Federico Errica, Davide Bacciu +1
We propose an extension of the Contextual Graph Markov Model, a deep and probabilistic machine learning model for graphs, to model the distribution of edge features. Our approach i…
Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networks
Federico Errica, Mathias Niepert
We introduce Graph-Induced Sum-Product Networks (GSPNs), a new probabilistic framework for graph representation learning that can tractably answer probabilistic queries. Inspired b…