HANNA: Hard-constraint Neural Network for Consistent Activity Coefficient Prediction
Thomas Specht, Mayank Nagda, Sophie Fellenz, Stephan Mandt, Hans Hasse, Fabian Jirasek
TL;DR
HANNA addresses the challenge that purely data-driven neural networks often violate thermodynamic laws when predicting activity coefficients. It introduces a hard-constraint neural network that learns the Gibbs excess energy $g^\text{E}$ for binary mixtures from SMILES-based component embeddings, and derives the logarithmic activity coefficients $\ln \gamma_i$ through thermodynamic relations, ensuring strict thermodynamic consistency. By encoding unity for pure components, the Gibbs-Duhem constraint, and permutation-equivariance directly in the architecture, HANNA achieves thermodynamically compliant predictions and strong extrapolation to unseen binary mixtures. Trained on 317,421 data points from the Dortmund Data Bank, HANNA outperforms UNIFAC on the UNIFAC horizon and remains applicable to any binary mixture with SMILES inputs, with open-source availability for broad use and extension.
Abstract
We present the first hard-constraint neural network for predicting activity coefficients (HANNA), a thermodynamic mixture property that is the basis for many applications in science and engineering. Unlike traditional neural networks, which ignore physical laws and result in inconsistent predictions, our model is designed to strictly adhere to all thermodynamic consistency criteria. By leveraging deep-set neural networks, HANNA maintains symmetry under the permutation of the components. Furthermore, by hard-coding physical constraints in the network architecture, we ensure consistency with the Gibbs-Duhem equation and in modeling the pure components. The model was trained and evaluated on 317,421 data points for activity coefficients in binary mixtures from the Dortmund Data Bank, achieving significantly higher prediction accuracies than the current state-of-the-art model UNIFAC. Moreover, HANNA only requires the SMILES of the components as input, making it applicable to any binary mixture of interest. HANNA is fully open-source and available for free use.
