A smooth basis for atomistic machine learning
Filippo Bigi, Kevin Huguenin-Dumittan, Michele Ceriotti, David E., Manolopoulos

TL;DR
This paper introduces a Laplacian eigenstate basis for atomistic machine learning that is optimally smooth, outperforming traditional bases and rivaling data-driven ones in representing atomic densities.
Contribution
It demonstrates that Laplacian eigenstates form the smoothest basis within a sphere, improving atomic density representations without extensive data-driven optimization.
Findings
Laplacian eigenstate basis outperforms common basis sets in unsupervised metrics.
The basis achieves comparable or better performance than data-driven bases in supervised learning.
Smoothness of basis functions is crucial for effective atomic density representations.
Abstract
Machine learning frameworks based on correlations of interatomic positions begin with a discretized description of the density of other atoms in the neighbourhood of each atom in the system. Symmetry considerations support the use of spherical harmonics to expand the angular dependence of this density, but there is as yet no clear rationale to choose one radial basis over another. Here we investigate the basis that results from the solution of the Laplacian eigenvalue problem within a sphere around the atom of interest. We show that this generates the smoothest possible basis of a given size within the sphere, and that a tensor product of Laplacian eigenstates also provides the smoothest possible basis for expanding any higher-order correlation of the atomic density within the appropriate hypersphere. We consider several unsupervised metrics of the quality of a basis for a given…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
