- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper learns electronic density matrices using a Cayley rotation of a valid initial projector. The rotation preserves electron count and occupations, while an occupied–virtual loss encourages the predicted occupied subspace to approach the target. The method is evaluated through density, energy and force errors, SCF initialization, and transfer from QH9 to larger QM40 molecules.
Critical strengths
The separation between occupation error and subspace error is useful and well motivated.
Critical weaknesses
See below
Questions for authors
- The learn density matrix still seems to have idempotency error? is it possible to make it as some sort of penalty term in the loss function to enforce idempotency?
- the authors have shown that the predicted density matrices can be used to initialize SCF calculations to reduce the number SCF iterations. But, this paper did not do this for other basis sets. I'm curious, how it looks like if you apply the model on chemical systems that used more complicated basis sets, do you still get similar or consistent speed up.
- For chemical systems with large basis sets that might have collinear dependence within the datasets, the basis sets overlap matrix S might not be full rank matrices. Will the method introduced here still work?
3 comments
Dear Reviewer YV55,
Thank you again for your positive assessment of our work. We were wondering whether our responses have addressed your questions. If anything remains unclear, we would be glad to follow up during the discussion period. For convenience, we summarize the main points of our responses below:
(1) Idempotency error (Q1). For the Cayley model, idempotency is guaranteed analytically, so the remaining error is a floating-point residual and not a model error. An idempotency penalty is possible for models that predict the density matrix directly, but it is a soft constraint and does not guarantee valid occupations.
(2) More complex basis sets (Q2). We trained on OMol25 electrolytes with 25 elements at ωB97M-V/def2-TZVPD (up to 4,000 basis functions). The speed-up remains but is smaller than on QH9: Cayley converges on all 128 evaluated structures and reduces the SCF iteration cost by 8% and the SCF end-to-end time by about 13% (Table R3-1).
(3) Linearly dependent basis sets (Q3). We did not encounter rank-deficient overlap matrices in the def2-TZVPD experiments. When they occur, the method can be applied in the linearly independent subspace obtained by canonical or partial Cholesky orthogonalization, where the Cayley rotation preserves the occupations in the same way.
Thank you again for your time and for the positive assessment.
Dear Reviewer YV55,
Thank you again for your thoughtful review. With the author-reviewer discussion period closing today (~ 12hr left), we would appreciate knowing whether these have addressed your concerns, or whether any points still need clarification.
Thank you
Dear Reviewer YV55,
Thank you for your positive assessment and constructive feedback on our manuscript. We will incorporate the new experimental results and the associated discussions into the final version. If any of them address your concerns or could change your assessment, we would be glad to hear it and happy to follow up.
(Q1) Remaining idempotency error and an additional penalty
For the Cayley model, idempotency is guaranteed analytically, so the remaining error is a numerical residual of floating-point arithmetic and not a model error.
For models that predict the density matrix directly, an idempotency penalty is possible. It is a soft constraint, however, so it reduces the idempotency error to some extent but does not guarantee valid occupations, and the eigenvalues still have to be purified afterwards. The Cayley parameterization does not need such a penalty.
(Q2) Performance on more complex basis sets
We agree that this is an important question, and we tested it at the ωB97M-V/def2-TZVPD level (Table R3-1). The speed-up remains but is smaller than on QH9. Both Cayley models converge on all 128 evaluated structures and reduce the SCF iteration cost by 8% (ERIC 0.921) and the SCF end-to-end time by about 13%.
For this test, we trained our models on 41,709 closed-shell OMol25 electrolyte structures (25 elements, up to 150 atoms and 4,000 basis functions). Each model was trained for 3 epochs (40 to 50 H100 GPU-hours) from the same PTB-derived initial density (Grimme et al., 2023), projected into def2-TZVPD and completed with atomic core orbitals. Because ORCA, used to generate the reference data, does not support GPU acceleration, we evaluated with GPU4PySCF, and small differences between the two programs are included in the errors. We evaluated the models on 1,024 validation structures with compositions unseen in training, and ran the DFT evaluation of the energy and SCF on a random subset of 128 of them.
This experiment is meant to show that our method also works when the basis set is extended. The one-shot energy error (median 10.36 meV/atom with the OV loss, 15.08 without) is still far from practical accuracy, and we believe closing this gap is an important direction for future work.
Table R3-1. OV-block error (1,024 structures), one-shot absolute energy error in meV/atom, and SCF behavior (128 structures) on OMol25 electrolytes at ωB97M-V/def2-TZVPD.
Here, ERIC and SCF end-to-end time are averaged over structures where the model and the PTB-derived initialization converge to the same SCF solution.
Reference: S. Grimme, M. Müller, and A. Hansen, J. Chem. Phys. 158, 124111 (2023).
(Q3) Linearly dependent basis sets
The current implementation uses Cholesky orthogonalization and therefore assumes a positive-definite overlap matrix. We did not encounter rank-deficient overlap matrices in the def2-TZVPD experiments above, so this assumption held in all settings we evaluated.
When the overlap matrix is rank-deficient, the method can be applied in the linearly independent subspace that remains after removing the redundant basis directions. Established approaches for this, such as canonical orthogonalization and partial Cholesky orthogonalization, are available in PySCF (
canonical_orth_andpartial_cholesky_orth_inpyscf.scf.addons). The Cayley rotation then acts within this subspace and preserves the occupations in the same way. We have not tested this extension yet.Reference: https://pyscf.org/_modules/pyscf/scf/addons.html