CrySPY

  • Level of openness 3 ★★★
  • Document quality 2 ★★☆

CrySPY is a crystal structure prediction tool by utilizing first-principles calculations and a classical MD program. Only by inputting chemical composition, crystal structures can be automatically generated and searched. In ver. 0.6.1, random search, Bayesian optimization, and LAQA are available as searching algorithms. CrySPY is interfaced with VASP, Quantum ESPRESSO, and LAMMPS.

To Detail

COMmon Bayesian Optimization Library (COMBO)

  • Level of openness 3 ★★★
  • Document quality 1 ★☆☆

COMmon Bayesian Optimization Library (COMBO) is an open source python library for machine learning techniques. COMBO is amenable to large scale problems, because the computational time grows only linearly as the number of candidates increases. Hyperparameters of a prediction model can be automatically learned from data by maximizing type-II likelihood.

To Detail

PHYSBO (optimization tools for PHYsics based on Bayesian Optimization )

  • Level of openness 3 ★★★
  • Document quality 2 ★★☆

PHYSBO is a Python library for researchers mainly in the materials science field to perform fast and scalable Bayesian optimization based on COMBO (Common Bayesian Optimization). Users can search the candidate with the largest objective function value from candidates listed in advance by using machine learning prediction. PHYSBO can handle a larger amount of data compared with standard implementations such as scikit-learn.

To Detail

2DMAT

  • Level of openness 3 ★★★
  • Document quality 2 ★★☆

2DMAT is a framework for applying a search algorithm to a direct problem solver to find the optimal solution. In  version 1.0, for solving a direct problem, 2DMAT offers the wrapper of the solver for the total-reflection high-energy positron diffraction (TRHEPD) experiment. As algorithms, it offers the Nelder-Mead method, the grid search method, the Bayesian optimization method, and the replica exchange Monte Carlo method. Users can define original direct problem solvers or the search algorithms.

To Detail