Search

The Open Databases Integration for Materials Design (OPTIMADE) application programming interface (API) empowers users with holistic access to a growing federation of databases, enhancing the accessibility and discoverability of materials and chemical data. Since the first release of the OPTIMADE specification (v1.0), the API has undergone significant development, leading to the upcoming v1.2 release, and has underpinned multiple scientific studies. In this work, we highlight the latest features of the API format, accompanying software tools, and provide an update on the implementation of OPTIMADE in contributing materials databases. We end by providing several use cases that demonstrate the utility of the OPTIMADE API in materials research that continue to drive its ongoing development.

Appropriate time discretization is crucial for real-time applications of numerical optimal control, such as nonlinear model predictive control. However, if the discretization error strongly depends on the applied control input, meeting accuracy and sampling time requirements simultaneously can be challenging using classical discretization methods. In particular, neither fixed-grid nor adaptive-grid discretizations may be suitable, when they suffer from large integration error or exceed the prescribed sampling time, respectively. In this work, we take a first step at closing this gap by utilizing probabilistic numerical integrators to approximate the solution of the initial value problem, as well as the computational uncertainty associated with it, inside the optimal control problem (OCP). By taking the viewpoint of probabilistic numerics and propagating the numerical uncertainty in the cost, the OCP is reformulated such that the optimal input reduces the computational uncertainty insofar as it is beneficial for the control objective. The proposed approach is illustrated using a numerical example, and potential benefits and limitations are discussed., Comment: to be published in the 6th Annual Learning for Dynamics & Control Conference (L4DC 2024)

Deep learning models for self-driving cars require a diverse training dataset to manage critical driving scenarios on public roads safely. This includes having data from divergent trajectories, such as the oncoming traffic lane or sidewalks. Such data would be too dangerous to collect in the real world. Data augmentation approaches have been proposed to tackle this issue using RGB images. However, solutions based on LiDAR sensors are scarce. Therefore, we propose synthesizing additional LiDAR point clouds from novel viewpoints without physically driving at dangerous positions. The LiDAR view synthesis is done using mesh reconstruction and ray casting. We train a deep learning model, which takes a LiDAR scan as input and predicts the future trajectory as output. A waypoint controller is then applied to this predicted trajectory to determine the throttle and steering labels of the ego-vehicle. Our method neither requires expert driving labels for the original nor the synthesized LiDAR sequence. Instead, we infer labels from LiDAR odometry. We demonstrate the effectiveness of our approach in a comprehensive online evaluation and with a comparison to concurrent work. Our results show the importance of synthesizing additional LiDAR point clouds, particularly in terms of model robustness. Project page: https://jonathsch.github.io/lidar-synthesis/

Inference and simulation in the context of high-dimensional dynamical systems remain computationally challenging problems. Some form of dimensionality reduction is required to make the problem tractable in general. In this paper, we propose a novel approximate Gaussian filtering and smoothing method which propagates low-rank approximations of the covariance matrices. This is accomplished by projecting the Lyapunov equations associated with the prediction step to a manifold of low-rank matrices, which are then solved by a recently developed, numerically stable, dynamical low-rank integrator. Meanwhile, the update steps are made tractable by noting that the covariance update only transforms the column space of the covariance matrix, which is low-rank by construction. The algorithm differentiates itself from existing ensemble-based approaches in that the low-rank approximations of the covariance matrices are deterministic, rather than stochastic. Crucially, this enables the method to reproduce the exact Kalman filter as the low-rank dimension approaches the true dimensionality of the problem. Our method reduces computational complexity from cubic (for the Kalman filter) to \emph{quadratic} in the state-space size in the worst-case, and can achieve \emph{linear} complexity if the state-space model satisfies certain criteria. Through a set of experiments in classical data-assimilation and spatio-temporal regression, we show that the proposed method consistently outperforms the ensemble-based methods in terms of error in the mean and covariance with respect to the exact Kalman filter. This comes at no additional cost in terms of asymptotic computational complexity., Comment: 12 pages main text (including references) + 9 pages appendix, 6 figures

Heusler compounds have always attracted a great deal of attention from researchers thanks to a wealth of interesting properties for technological applications. They are intermetallic ductile compounds, and some of them have been found to be superconducting. With this in mind, we perform an extensive study of the superconducting and elastic properties of the cubic (full-)Heusler family. Starting from thermodynamically stable compounds, we use ab initio methods for the calculation of the phonon spectra, electron-phonon couplings, superconducting critical temperatures and elastic tensors. By analyzing the statistical distributions of these properties and comparing them to anti-perovskites we recognize universal behaviors that should be common to all conventional superconductors while others turn out to be specific to the material family. The resulting data is used to train interpretable and predictive machine learning models, that are used to extend our knowledge of superconductivity in Heuslers and to provide an interpretation of our results. In total, we discover a total of 8 hypothetical materials with critical temperatures above 10 K, to be compared with the current record of Tc = 4.7 K in this family. Furthermore, we expect most of these materials to be highly ductile, making them potential candidates for the manufacture of wires and tapes for superconducting magnets.

Graph neural networks trained on large crystal structure databases are extremely effective in replacing ab initio calculations in the discovery and characterization of materials. However, crystal structure datasets comprising millions of materials exist only for the Perdew-Burke-Ernzerhof (PBE) functional. In this work, we investigate the effectiveness of transfer learning to extend these models to other density functionals. We show that pre-training significantly reduces the size of the dataset required to achieve chemical accuracy and beyond. We also analyze in detail the relationship between the transfer-learning performance and the size of the datasets used for the initial training of the model and transfer learning. We confirm a linear dependence of the error on the size of the datasets on a log-log scale, with a similar slope for both training and the pre-training datasets. This shows that further increasing the size of the pre-training dataset, i.e. performing additional calculations with a low-cost functional, is also effective, through transfer learning, in improving machine-learning predictions with the quality of a more accurate, and possibly computationally more involved functional. Lastly, we compare the efficacy of interproperty and intraproperty transfer learning.

We present a symmetry-based exhaustive approach to explore the structural and compositional richness of two-dimensional materials. We use a ``combinatorial engine'' that constructs potential compounds by occupying all possible Wyckoff positions for a certain space group with combinations of chemical elements. These combinations are restricted by imposing charge neutrality and the Pauling test for electronegativities. The structures are then pre-optimized with a specially crafted universal neural-network force-field, before a final step of geometry optimization using density-functional theory is performed. In this way we unveil an unprecedented variety of two-dimensional materials, covering the whole periodic table in more than 30 different stoichiometries of form A$_n$B$_m$ or A$_n$B$_m$C$_k$. Among the found structures we find examples that can be built by decorating nearly all Platonic and Archimedean tesselations as well as their dual Laves or Catalan tilings. We also obtain a rich, and unexpected, polymorphism for some specific compounds. We further accelerate the exploration of the chemical space of two-dimensional materials by employing machine-learning-accelerated prototype search, based on the structural types discovered in the exhaustive search. In total, we obtain around 6500 compounds, not present in previous available databases of 2D materials, with an energy of less than 250~meV/atom above the convex hull of thermodynamic stability.

Crystal-graph attention networks have emerged recently as remarkable tools for the prediction of thermodynamic stability and materials properties from unrelaxed crystal structures. Previous networks trained on two million materials exhibited, however, strong biases originating from underrepresented chemical elements and structural prototypes in the available data. We tackled this issue computing additional data to provide better balance across both chemical and crystal-symmetry space. Crystal-graph networks trained with this new data show unprecedented generalization accuracy, and allow for reliable, accelerated exploration of the whole space of inorganic compounds. We applied this universal network to perform machine-learning assisted high-throughput materials searches including 2500 binary and ternary structure prototypes and spanning about 1 billion compounds. After validation using density-functional theory, we uncover in total 19512 additional materials on the convex hull of thermodynamic stability and ~150000 compounds with a distance of less than 50 meV/atom from the hull. Combining again machine learning and ab-initio methods, we finally evaluate the discovered materials for applications as superconductors, superhard materials, and we look for candidates with large gap deformation potentials, finding several compounds with extreme values of these properties.

Garnets, known since the early stages of human civilization, have found important applications in modern technologies including magnetorestriction, spintronics, lithium batteries, etc. The overwhelming majority of experimentally known garnets are oxides, while explorations (experimental or theoretical) for the rest of the chemical space have been limited in scope. A key issue is that the garnet structure has a large primitive unit cell, requiring an enormous amount of computational resources. To perform a comprehensive search of the complete chemical space for new garnets,we combine recent progress in graph neural networks with high-throughput calculations. We apply the machine learning model to identify the potential (meta-)stable garnet systems before systematic density-functional calculations to validate the predictions. In this way, we discover more than 600 ternary garnets with distances to the convex hull below 100~meV/atom with a variety of physical and chemical properties. This includes sulfide, nitride and halide garnets. For these, we analyze the electronic structure and discuss the connection between the value of the electronic band gap and charge balance.

Dynamical perturbations modify the states of classical systems in surprising ways and give rise to important applications in science and technology. For example, Floquet engineering exploits the possibility of band formation in the frequency domain when a strong, periodic variation is imposed on parameters such as spring constants. We describe here Kapitza engineering, where a drive field oscillating at a frequency much higher than the characteristic frequencies for the linear response of a system changes the potential energy surface so much that maxima found at equilibrium become local minima, in precise analogy to the celebrated Kapitza pendulum where the unstable inverted configuration, with the mass above rather than below the fulcrum, actually becomes stable. Our starting point is a quantum field theory of the Ginzburg-Devonshire type, suitable for many condensed matter systems, including particularly ferroelectrics and quantum paralectrics. We show that an off-resonance oscillatory electric field generated by a laser-driven THz source can induce ferroelectric order in the quantum-critical limit. Heating effects are estimated to be manageable using pulsed radiation; ``hidden" radiation-induced order can persist to low temperatures without further pumping due to stabilization by strain. We estimate the Ginzburg-Devonshire free-energy coefficients in SrTiO${}_{3}$ using density-functional theory (DFT) and the stochastic self-consistent harmonic approximation accelerated by a machine-learned force field. Although we find that SrTiO${}_{3}$ is not an optimal choice for Kapitza stabilization, we show that scanning for further candidate materials can be performed at the computationally convenient density-functional theory level. We suggest second-harmonic-generation, soft-mode-spectroscopy, and X-ray-diffraction experiments to characterize the induced order., Comment: 9+4 pages, 5+2 figures, submitted to Physical Review X

Probabilistic numerical methods (PNMs) solve numerical problems via probabilistic inference. They have been developed for linear algebra, optimization, integration and differential equation simulation. PNMs naturally incorporate prior information about a problem and quantify uncertainty due to finite computational resources as well as stochastic input. In this paper, we present ProbNum: a Python library providing state-of-the-art probabilistic numerical solvers. ProbNum enables custom composition of PNMs for specific problem classes via a modular design as well as wrappers for off-the-shelf use. Tutorials, documentation, developer guides and benchmarks are available online at www.probnum.org.

Density functional theory is routinely applied to predict crystal structures. The most common exchange-correlation functionals used to this end are the Perdew-Burke-Ernzerhof (PBE) approximation and its variant PBEsol. We investigate the performance of these functionals for the prediction of lattice parameters and show how to enhance their accuracy using machine learning. Our dataset is constituted by experimental crystal structures of the Inorganic Crystal Structure Database matched with PBE-optmized structures stored in the materials project database. We complement these data with PBEsol calculations. We demonstrate that the accuracy and precision of PBE/PBEsol volume predictions can be noticeably improved a posteriori by employing simple, explainable machine learning models. These models can improve PBE unit cell volumes to match the accuracy of PBEsol calculations, and reduce the error of the latter with respect to experiment by 35%. Further, the error of PBE lattice constants is reduced by a factor of 3--5. A further benefit of our approach is the implicit correction of finite temperature effects without performing phonon calculations., Comment: 62 pages, 5 figures, 3 tables

This work develops a class of probabilistic algorithms for the numerical solution of nonlinear, time-dependent partial differential equations (PDEs). Current state-of-the-art PDE solvers treat the space- and time-dimensions separately, serially, and with black-box algorithms, which obscures the interactions between spatial and temporal approximation errors and misguides the quantification of the overall error. To fix this issue, we introduce a probabilistic version of a technique called method of lines. The proposed algorithm begins with a Gaussian process interpretation of finite difference methods, which then interacts naturally with filtering-based probabilistic ordinary differential equation (ODE) solvers because they share a common language: Bayesian inference. Joint quantification of space- and time-uncertainty becomes possible without losing the performance benefits of well-tuned ODE solvers. Thereby, we extend the toolbox of probabilistic programs for differential equation simulation to PDEs.

Probabilistic solvers for ordinary differential equations (ODEs) have emerged as an efficient framework for uncertainty quantification and inference on dynamical systems. In this work, we explain the mathematical assumptions and detailed implementation schemes behind solving {high-dimensional} ODEs with a probabilistic numerical algorithm. This has not been possible before due to matrix-matrix operations in each solver step, but is crucial for scientifically relevant problems -- most importantly, the solution of discretised {partial} differential equations. In a nutshell, efficient high-dimensional probabilistic ODE solutions build either on independence assumptions or on Kronecker structure in the prior model. We evaluate the resulting efficiency on a range of problems, including the probabilistic numerical simulation of a differential equation with millions of dimensions.

Machine learning is a powerful tool to design accurate, highly non-local, exchange-correlation functionals for density functional theory. So far, most of those machine learned functionals are trained for systems with an integer number of particles. As such, they are unable to reproduce some crucial and fundamental aspects, such as the explicit dependency of the functionals on the particle number or the infamous derivative discontinuity at integer particle numbers. Here we propose a solution to these problems by training a neural network as the universal functional of density-functional theory that (i) depends explicitly on the number of particles with a piece-wise linearity between the integer numbers and (ii) reproduces the derivative discontinuity of the exchange-correlation energy. This is achieved by using an ensemble formalism, a training set containing fractional densities, and an explicitly discontinuous formulation.

The one-body reduced density matrix $\gamma$ plays a fundamental role in describing and predicting quantum features of bosonic systems, such as Bose-Einstein condensation. The recently proposed reduced density matrix functional theory for bosonic ground states establishes the existence of a universal functional $\mathcal{F}[\gamma]$ that recovers quantum correlations exactly. Based on a novel decomposition of $\gamma$, we have developed a method to design reliable approximations for such universal functionals: our results suggest that for translational invariant systems the constrained search approach of functional theories can be transformed into an unconstrained problem through a parametrization of an Euclidian space. This simplification of the search approach allows us to use standard machine-learning methods to perform a quite efficient computation of both $\mathcal{F}[\gamma]$ and its functional derivative. For the Bose-Hubbard model, we present a comparison between our approach and Quantum Monte Carlo., Comment: 13 pages, 6 figures; close to the published version

Mechanistic models with differential equations are a key component of scientific applications of machine learning. Inference in such models is usually computationally demanding, because it involves repeatedly solving the differential equation. The main problem here is that the numerical solver is hard to combine with standard inference techniques. Recent work in probabilistic numerics has developed a new class of solvers for ordinary differential equations (ODEs) that phrase the solution process directly in terms of Bayesian filtering. We here show that this allows such methods to be combined very directly, with conceptual and numerical ease, with latent force models in the ODE itself. It then becomes possible to perform approximate Bayesian inference on the latent force as well as the ODE solution in a single, linear complexity pass of an extended Kalman filter / smoother - that is, at the cost of computing a single ODE solution. We demonstrate the expressiveness and performance of the algorithm by training, among others, a non-parametric SIRD model on data from the COVID-19 outbreak., Comment: 12 pages (+ 5 pages appendix), 7 figures. In: Advances in Neural Information Processing Systems (NeurIPS 2021)

We train a neural network as the universal exchange-correlation functional of density-functional theory that simultaneously reproduces both the exact exchange-correlation energy and potential. This functional is extremely non-local, but retains the computational scaling of traditional local or semi-local approximations. It therefore holds the promise of solving some of the delocalization problems that plague density-functional theory, while maintaining the computational efficiency that characterizes the Kohn-Sham equations. Furthermore, by using automatic differentiation, a capability present in modern machine-learning frameworks, we impose the exact mathematical relation between the exchange-correlation energy and the potential, leading to a fully consistent method. We demonstrate the feasibility of our approach by looking at one-dimensional systems with two strongly-correlated electrons, where density-functional methods are known to fail, and investigate the behavior and performance of our functional by varying the degree of non-locality., Comment: 8 pages, 5 figures; accepted for publication in J. Phys. Chem. Lett

We present an \textit{ab initio} theory for superconductors, based on a unique mapping between the statistical density operator at equilibrium, on the one hand, and the corresponding one-body reduced density matrix $\gamma$ and the anomalous density $\chi$, on the other. This new formalism for superconductivity yields the existence of a universal functional $\mathfrak{F}_\beta[\gamma,\chi]$ for the superconductor ground state, whose unique properties we derive. We then prove the existence of a Kohn-Sham system at finite temperature and derive the corresponding Bogoliubov-de Gennes-like single particle equations. By adapting the decoupling approximation from density functional theory for superconductors we bring these equations into a computationally feasible form. Finally, we use the existence of the Kohn-Sham system to extend the Sham-Schl\"uter connection and derive a first exchange-correlation functional for our theory. This reduced density matrix functional theory for superconductors has the potential of overcoming some of the shortcomings and fundamental limitations of density functional theory of superconductivity., Comment: 18 pages

Aiming at a unified treatment of correlation and inhomogeneity effects in superconductors, Oliveira, Gross and Kohn proposed in 1988 a density functional theory for the superconducting state. This theory relies on the existence of a Kohn-Sham scheme, i.e., an auxiliary noninteracting system with the same electron and anomalous densities of the original superconducting system. However, the question of noninteracting $v$-representability has never been properly addressed and the existence of the Kohn-Sham system has always been assumed without proof. Here, we show that indeed such a noninteracting system does not exist in at zero temperature. In spite of this result, we also show that the theory is still able to yield good results, although in the limit of weakly correlated systems only., Comment: 9 pages