mlsanityData to 7 Oct 2026

Exploiting Ligand Additivity for Transferable Machine Learning of Multireference Character Across Known Transition Metal Complex Ligands

arXiv 2205.02879 ↗First posted 5 May 2022cond-mat.mtrl-sci cs.LG physics.chem-phcited by 2

Not on the map. Why?

Abstract (arXiv)

Accurate virtual high-throughput screening (VHTS) of transition metal complexes (TMCs) remains challenging due to the possibility of high multi-reference (MR) character that complicates property evaluation. We compute MR diagnostics for over 5,000 ligands present in previously synthesized transition metal complexes in the Cambridge Structural Database (CSD). To accomplish this task, we introduce an iterative approach for consistent ligand charge assignment for ligands in the CSD. Across this set, we observe that MR character correlates linearly with the inverse value of the averaged bond order over all bonds in the molecule. We then demonstrate that ligand additivity of MR character holds in TMCs, which suggests that the TMC MR character can be inferred from the sum of the MR character of the ligands. Encouraged by this observation, we leverage ligand additivity and develop a ligand-derived machine learning representation to train neural networks to predict the MR character of TMCs from properties of the constituent ligands. This approach yields models with excellent performance and superior transferability to unseen ligand chemistry and compositions.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 3 of its 93 references that are in the map. First posted on arXiv 5 May 2022.

Builds on

3 of 93 references.

References · 3

  1. 2020The Open Catalyst 2020 (OC20) Dataset and Community Challengescited by 246
  2. 2021Learning the exchange-correlation functional from nature with fully differentiable density functional theorycited by 23
  3. 2021Representations and Strategies for Transferable Machine Learning Models in Chemical Discoverycited by 4

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1.

2 papers.