Nutmeg: Biomolecular & Bayesian Systems

• Nutmeg refers to two distinct research systems: one predicts molecular energies using message-passing networks and the other employs Bayesian techniques to model annotator disagreements.
• The biomolecular Nutmeg leverages the TensorNet architecture with charge injection to achieve near–quantum accuracy for simulating drug-like molecules, peptides, and noncovalent interactions.
• The annotation model NUTMEG uses variational Bayes to disentangle noisy labels from systematic subgroup signals, preserving meaningful disagreement in crowdsourced data.

In recent arXiv literature, Nutmeg / NUTMEG denotes two distinct research systems. In biomolecular machine learning, Nutmeg is a family of machine-learning potentials for drug-like small molecules, peptides, and noncovalent complexes, trained on the SPICE v2 quantum-chemistry dataset and based on the TensorNet architecture (Eastman et al., 2024). In natural language processing and annotation science, NUTMEG—Nuanced Understanding of annoTation by MultiplE Groups—is a Bayesian model for separating noisy annotations from systematic subgroup disagreement in crowdsourced labeling workflows (Ivey et al., 25 Jul 2025). The shared name therefore spans two unrelated technical lineages: one in atomistic simulation and one in probabilistic modeling of human annotation.

1. Disambiguation and scope

The term appears in at least two technically unrelated senses in the cited literature.

Usage	Domain	Core objective
Nutmeg	Biomolecular machine learning	Predict potential energies and forces for small molecules, peptides, and noncovalent complexes
NUTMEG	NLP / annotation modeling	Remove noisy annotations while preserving systematic disagreements across annotator subpopulations

The biomolecular Nutmeg system is introduced alongside version 2 of the SPICE dataset and is explicitly positioned as a set of equivariant message-passing potentials intended to achieve near–quantum-mechanical accuracy and routine molecular dynamics throughput on small systems (Eastman et al., 2024). The annotation-model NUTMEG is introduced as a Bayesian aggregation framework that models annotator competence, spam, and subgroup-specific ground truths in order to preserve meaningful disagreement rather than collapsing all deviation into error (Ivey et al., 25 Jul 2025).

A plausible implication is that the shared name does not denote a common methodology; rather, it is a homonym across two research areas with different data modalities, inductive biases, and evaluation regimes.

2. Nutmeg as a biomolecular machine-learning potential

In biomolecular machine learning, the Nutmeg family implements equivariant message-passing networks to predict potential energies and forces for drug-like small molecules, peptides, and their noncovalent complexes (Eastman et al., 2024). Its stated goals are twofold: better than 1 kcal/mol on average across a broad range of chemistries, including charged and polar species, and milliseconds per force evaluation on modern GPUs so as to enable routine molecular dynamics of small systems.

Nutmeg is trained on SPICE v2, a dataset described as containing 2.0 million conformations spanning 17 elements, explicit solvent clusters, ligand–amino acid pairs, and both neutral and charged species (Eastman et al., 2024). The model was designed partly in response to the fact that earlier machine-learning potentials and datasets often omitted charged molecules, non-equilibrium conformations, or noncovalent interactions.

Architecturally, Nutmeg builds on the TensorNet framework with three main modules: an embedding layer, a stack of interaction layers, and an output layer (Eastman et al., 2024). The interaction layers perform successive rounds of message passing over neighbors within cutoff $r_c$, and a model with $n$ interaction layers has a receptive field of $(n{+}1)\,r_c$. The output layer computes atomic energy contributions $E_i$, which are summed into the total potential energy.

The energy is decomposed as

$$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$

with the short-range repulsive term

$$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$

The cutoff function is

$$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$

This repulsive term is described as a short-range Ziegler–Biersack–Littmark repulsion suppressed beyond the sum of covalent radii (Eastman et al., 2024). Its role is to prevent unphysical collapse in simulation.

3. Charge injection, training protocol, and dataset composition

A defining feature of Nutmeg is its charge-injection mechanism, introduced to improve accuracy on charged and polar molecules (Eastman et al., 2024). The procedure is specified as follows: compute Gasteiger atomic partial charges once for each molecule, concatenate each atom’s one-hot element encoding with the corresponding charge, and map the augmented feature vector through a learnable linear transform to obtain the initial embedding,

$$\mathbf{h}_i^{(0)} = W\bigl[\mathrm{one\_hot}(Z_i)\,\|\,q_i\bigr].$$

No additional Coulomb kernel is imposed; the network is allowed to exploit the injected charges implicitly through message passing. The paper states that no explicit charge regularization term is used because the partial charges are fixed inputs rather than predicted quantities (Eastman et al., 2024).

The model is trained to reproduce both reference energies and forces using the loss

$$\mathcal{L} = \bigl\lVert E_\text{pred}-E_\text{ref}\bigr\rVert_{2}^{2} +\lambda\, \bigl\lVert \mathbf{F}_\text{pred}-\mathbf{F}_\text{ref}\bigr\rVert_{2}^{2},$$

with $\lambda = 0.01$ in units of $n$0 (Eastman et al., 2024).

SPICE v2 is described as comprising several sources of geometries, including PubChem drug-like molecules with approximately 28 k molecules and 1.4 M conformers, ligand–amino acid pairs with approximately 10 k ligands and 194 k conformers, solvated PubChem clusters with approximately 14 k solutes and 63 k conformers, water clusters with 30 molecules and 1 k conformers, as well as dipeptides, solvated amino acids, DES370K monomers/dimers, and reran DFT outliers (Eastman et al., 2024). All geometries were computed at the wB97M-D3(BJ)/def2-TZVPPD level with Psi4, and forces were obtained analytically.

The training split holds out a random 5% of conformations (100 k) for validation, leaving 1.9 M conformations for training (Eastman et al., 2024). Shared hyperparameters across the three reported model sizes are AdamW, batch size 64, initial learning rate $n$1 reduced by 0.8 on plateau to a minimum of $n$2, 100 total epochs, cutoff $n$3 nm, and ZBL cutoff $n$4 equal to the sum of Slater covalent radii. The three variants—Nutmeg-small, Nutmeg-medium, and Nutmeg-large—differ in embedding/interact widths and number of interaction layers.

4. Empirical behavior of the biomolecular Nutmeg models

On the held-out SPICE v2 validation set, the reported mean absolute errors in total energy are 2.60 kJ/mol for Nutmeg-small, 2.19 kJ/mol for Nutmeg-medium, and 1.85 kJ/mol for Nutmeg-large, all below 4.184 kJ/mol (1 kcal/mol) (Eastman et al., 2024). The error grows modestly with system size up to approximately 70 atoms and then increases sharply, which the paper attributes to the finite message-passing cutoff. Reducing the cutoff from 1.0 nm to 0.6 nm moves this inflection to approximately 50 atoms, reinforcing the dependence on receptive field size.

A separate test set of 7976 conformations was assembled from molecules not present in SPICE v2: small ligands (40–50 atoms), large ligands (70–80 atoms), pentapeptides (68–110 atoms), and novel dimers (34–72 atoms) (Eastman et al., 2024). Absolute-energy MAEs on this test set range from 6–15 kJ/mol, decreasing with model size, while conformational energy differences are substantially more accurate. For example, Nutmeg-large achieves approximately 4 kJ/mol MAE on pentapeptides for conformational $n$5, despite their size.

The effect of charge injection is reported explicitly. Without injected charges, absolute-energy errors grow dramatically with the number of formal charges; with precomputed partial charges, this dependence is said to collapse entirely for conformational $n$6 (Eastman et al., 2024). A control model using only formal charges instead of Gasteiger partial charges yields intermediate performance, which the paper interprets as evidence that detailed partial charges are the more effective baseline for charged systems.

Simulation stability and speed are also evaluated. Over 1800 short MD runs of 10 ps with 1 fs timestep on 600 test molecules, the models exhibited no integrator failures or runaway temperatures, with only a handful of bond breaks, limited to hypervalent sulfur motifs, which were also unstable at the reference DFT level (Eastman et al., 2024). On an NVIDIA RTX 4080, Nutmeg-small reaches approximately 150 ns/day on a 50-atom molecule, characterized as approximately a $n$7-fold speedup over DFT but still approximately $n$8-fold slower than classical force fields on large systems.

For torsional energetics, Nutmeg-large reproduces eight representative torsion scans from the TorsionNet 500 benchmark with barrier-height MAEs of $n$9 kJ/mol (Eastman et al., 2024). However, in a 2.2 nm periodic box of water, Nutmeg-small shows poor liquid structure relative to TIP4P-FB, AMOEBA, and SWM4-NDP, indicating that the available 30-molecule water clusters in SPICE v2 are insufficient for accurate bulk-water modeling.

5. Limitations and projected extensions of the biomolecular model

The biomolecular Nutmeg models are explicitly described as not designed to model bond breaking/forming (Eastman et al., 2024). The use of fixed partial charges prevents on-the-fly reparameterization for reactions, and the finite cutoff limits accuracy beyond approximately 70 atoms unless the architecture is extended.

The paper further states that bulk-phase properties remain a challenge, plausibly because larger solvent aggregates or explicit long-range treatments are required (Eastman et al., 2024). Proposed future directions include global or trainable charge-equilibration schemes for dynamic polarization, extending SPICE with larger solvent aggregates and condensed-phase simulations, integrating CUDA Graphs or PyTorch 2 compiler optimizations to reduce GPU overhead, and exploring higher-order message-passing or multi-scale electrostatic kernels to improve transferability to macromolecular and periodic systems.

These statements delimit the intended use case: routine simulation of small systems with high fidelity for charged, polar, and noncovalent chemistries, but not reactive chemistry or well-resolved condensed-phase water behavior (Eastman et al., 2024).

6. NUTMEG as a Bayesian model of annotator disagreement

In a separate line of work, NUTMEG denotes Nuanced Understanding of annoTation by MultiplE Groups, a Bayesian model for crowdsourced annotation in which disagreement is decomposed into “spam” or noise and “signal”, meaning genuine, systematic disagreement driven by annotator background (Ivey et al., 25 Jul 2025). The model is motivated by the observation that conventional aggregation procedures such as majority vote, Dawid & Skene, MACE, and GLAD typically treat all deviations from consensus as error, while “learning from disagreement” approaches may over-weight raw noisy labels.

The model assumes $(n{+}1)\,r_c$0 items, $(n{+}1)\,r_c$1 annotators, $(n{+}1)\,r_c$2 known subpopulations, and a label space of size $(n{+}1)\,r_c$3 (Ivey et al., 25 Jul 2025). Each annotator $(n{+}1)\,r_c$4 belongs to exactly one subpopulation $(n{+}1)\,r_c$5. The latent variables are:

• $(n{+}1)\,r_c$6: the true label for item $(n{+}1)\,r_c$7 according to subpopulation $(n{+}1)\,r_c$8
• $(n{+}1)\,r_c$9: annotator competence
• $E_i$0: annotator spam distribution over labels
• $E_i$1: whether annotator $E_i$2 is spamming on item $E_i$3
• $E_i$4: the observed annotation

The priors are given as

$E_i$5

$E_i$6

with $E_i$7 to encourage extremes, and

$E_i$8

with symmetric $E_i$9 (Ivey et al., 25 Jul 2025).

For each annotation, the spam indicator is sampled as

$$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$0

so that $$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$1 corresponds to the annotator following the subgroup truth and $$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$2 corresponds to spam. The observation model is deterministic when $$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$3, in which case $$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$4, and categorical from $$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$5 when $$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$6 (Ivey et al., 25 Jul 2025). The joint distribution is written as

$$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$7

The inference procedure uses Variational Bayes, with a mean-field variational posterior over $$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$8, $$E_\text{total} \;=\; \sum_{i} E_{i}\bigl(\text{local environment}\bigr) \;+\; E_\text{ZBL},$$9, $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$0, and $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$1, optimized via the Evidence Lower Bound,

$$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$2

The update equations are given in the paper in the familiar variational form $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$3, with conjugate updates for $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$4 as a Beta distribution and for $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$5 as a Dirichlet distribution (Ivey et al., 25 Jul 2025). Because each annotator is tied to a known subpopulation, all expectations involving truth use the subpopulation-specific variable $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$6.

7. Experimental findings and downstream consequences of the annotation model

The NUTMEG annotation model is evaluated in three settings (Ivey et al., 25 Jul 2025). In synthetic data (Exp 1), the setup uses $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$7 annotators, split 80% majority and 20% minority, over $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$8 binary items. A proportion $$E_\text{ZBL} \;=\; \sum_{i<j} w(r_{ij})\,\mathrm{ZBL}(r_{ij}).$$9 of items is made divisive, meaning $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$0, and each item receives 5 random annotators. Baselines are Majority Vote, Dawid & Skene (1979), MACE (Hovy et al. 2013), LFC (Raykar et al. 2010), and BCC (Kim & Ghahramani 2012). As $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$1 increases, the traditional methods remain accurate on the majority label at approximately 95% but collapse on the minority to approximately 50% at $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$2. By contrast, NUTMEG remains high for both groups even when $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$3, with minority accuracy approximately 90–95% at low spam and approximately 80–85% at spam = 0.25. Its competence estimates correlate at approximately $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$4 with true competence, compared with 0.58 for MACE.

In subpopulation size analysis (Exp 2), with global spam = 0.1 and divisiveness $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$5, the minority proportion $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$6 varies over $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$7 and annotations per item $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$8 over $$w(r) = \begin{cases} \frac12\bigl[1 + \cos(\pi\,r/r_\text{max})\bigr], & r<r_\text{max},\ 0, & r\ge r_\text{max}. \end{cases}$$9 (Ivey et al., 25 Jul 2025). The reported result is that maintaining minority accuracy at approximately 92% requires about $$\mathbf{h}_i^{(0)} = W\bigl[\mathrm{one\_hot}(Z_i)\,\|\,q_i\bigr].$$0 when $$\mathbf{h}_i^{(0)} = W\bigl[\mathrm{one\_hot}(Z_i)\,\|\,q_i\bigr].$$1, but $$\mathbf{h}_i^{(0)} = W\bigl[\mathrm{one\_hot}(Z_i)\,\|\,q_i\bigr].$$2 when $$\mathbf{h}_i^{(0)} = W\bigl[\mathrm{one\_hot}(Z_i)\,\|\,q_i\bigr].$$3. The paper interprets this as evidence that practitioners must oversample small subpopulations if accurate minority truths are desired.

In downstream modeling (Exp 3), the real dataset is POPQUORN (Pei & Jurgens 2023) with annotations for politeness and offensiveness on 1–5 Likert scales, binarized at $$\mathbf{h}_i^{(0)} = W\bigl[\mathrm{one\_hot}(Z_i)\,\|\,q_i\bigr].$$4, together with annotator demographics including age, race, gender, education (Ivey et al., 25 Jul 2025). The base encoder is ModernBERT. Two settings are evaluated: aggregated labels produced by majority vote, MACE, or NUTMEG’s per-subpopulation truths, and a disaggregated multi-task model with one head per annotator. The metric is Jensen–Shannon divergence (JSD) between the predicted label distribution for each subpopulation and the empirical distribution of disaggregated test labels in that subpopulation.

For politeness, the reported mean JSD is approximately 0.04 for NUTMEG-aggregated labels, approximately 0.06 for MACE, approximately 0.07 for majority vote, and approximately 0.10 for full disaggregation, corresponding to a 30–40% reduction in JSD over MACE (Ivey et al., 25 Jul 2025). For offensiveness, all aggregation methods improve on raw data, and NUTMEG still matches or slightly betters MACE, with JSD approximately 0.055 versus 0.056. The paper notes that demographic subgroup signals were weak in the offensiveness setting, so noise reduction was the principal gain there.

Taken together, these results support a precise interpretation of NUTMEG in annotation science: it is a Bayesian wrapper around crowdsourced labels that infers annotator competence versus spam, recovers one true label per subpopulation per item, and does so through variational Bayes in a way that preserves subgroup disagreement while reducing noisy annotations (Ivey et al., 25 Jul 2025). A plausible implication is that the model occupies an intermediate position between pure consensus aggregation and unrestricted learning from raw disagreement.