arXiv subjects

Koji Tsuda

Publications and source records attributed to Koji Tsuda.

At least 37 records · Page 2Linked to original sources

arXiv2023

Feature Importance Measurement based on Decision Tree Sampling

Random forest is effective for prediction tasks but the randomness of tree generation hinders interpretability in feature importance analysis. To address this, we proposed DT-Sampler, a SAT-based method for measuring feature importance in tree-based model. Our method has fewer parameters than random forest and provides higher interpretability and stability for the analysis in real-world problems. An implementation of DT-Sampler is available at https://github.com/tsudalab/DT-sampler.

cs.LG↗

arXiv2023

Efficient Model Selection for Predictive Pattern Mining Model by Safe Pattern Pruning

Predictive pattern mining is an approach used to construct prediction models when the input is represented by structured data, such as sets, graphs, and sequences. The main idea behind predictive pattern mining is to build a prediction model by considering substructures, such as subsets, subgraphs, and subsequences (referred to as patterns), present in the structured data as features of the model. The primary challenge in predictive pattern mining lies in the exponential growth of the number of patterns with the complexity of the structured data. In this study, we propose the Safe Pattern Pruning (SPP) method to address the explosion of pattern numbers in predictive pattern mining. We also discuss how it can be effectively employed throughout the entire model building process in practical data analysis. To demonstrate the effectiveness of the proposed method, we conduct numerical experiments on regression and classification problems involving sets, graphs, and sequences.

stat.ML↗

arXiv2023

NIMS-OS: An automation software to implement a closed loop between artificial intelligence and robotic experiments in materials science

NIMS-OS (NIMS Orchestration System) is a Python library created to realize a closed loop of robotic experiments and artificial intelligence (AI) without human intervention for automated materials exploration. It uses various combinations of modules to operate autonomously. Each module acts as an AI for materials exploration or a controller for a robotic experiments. As AI techniques, Bayesian optimization (PHYSBO), boundless objective-free exploration (BLOX), phase diagram construction (PDC), and random exploration (RE) methods can be used. Moreover, a system called NIMS automated robotic electrochemical experiments (NAREE) is available as a set of robotic experimental equipment. Visualization tools for the results are also included, which allows users to check the optimization results in real time. Newly created modules for AI and robotic experiments can be added easily to extend the functionality of the system. In addition, we developed a GUI application to control NIMS-OS.To demonstrate the operation of NIMS-OS, we consider an automated exploration for new electrolytes. NIMS-OS is available at https://github.com/nimsos-dev/nimsos.

cond-mat.mtrl-sci↗

arXiv2022

Bayesian optimization package: PHYSBO

PHYSBO (optimization tools for PHYSics based on Bayesian Optimization) is a Python library for fast and scalable Bayesian optimization. It has been developed mainly for application in the basic sciences such as physics and materials science. Bayesian optimization is used to select an appropriate input for experiments/simulations from candidate inputs listed in advance in order to obtain better output values with the help of machine learning prediction. PHYSBO can be used to find better solutions for both single and multi-objective optimization problems. At each cycle in the Bayesian optimization, a single proposal or multiple proposals can be obtained for the next experiments/simulations. These proposals can be obtained interactively for use in experiments. PHYSBO is available at https://github.com/issp-center-dev/PHYSBO.

physics.comp-ph↗

arXiv2021

Probing conformational dynamics of antibodies with geometric simulations

This chapter describes the application of constrained geometric simulations for prediction of antibody structural dynamics. We utilize constrained geometric simulations method FRODAN, which is a low computational complexity alternative to Molecular Dynamics (MD) simulations that can rapidly explore flexible motions in protein structures. FRODAN is highly suited for conformational dynamics analysis of large proteins, complexes, intrinsically disordered proteins and dynamics that occurs on longer biologically relevant time scales which are normally inaccessible to classical MD simulations. This approach predicts protein dynamics at an all-atom scale while retaining realistic covalent bonding, maintaining dihedral angles in energetically good conformations while avoiding steric clashes in addition to performing other geometric and stereochemical criteria checks. In this chapter, we apply FRODAN to showcase its applicability for probing functionally relevant dynamics of IgG2a, including large amplitude domain-domain motions and motions of complementarity determining region (CDR) loops. As was suggested in previous experimental studies, our simulations show that antibodies can explore a large range of conformational space.

q-bio.BM↗

arXiv2021

Fast and More Powerful Selective Inference for Sparse High-order Interaction Model

Automated high-stake decision-making such as medical diagnosis requires models with high interpretability and reliability. As one of the interpretable and reliable models with good prediction ability, we consider Sparse High-order Interaction Model (SHIM) in this study. However, finding statistically significant high-order interactions is challenging due to the intrinsic high dimensionality of the combinatorial effects. Another problem in data-driven modeling is the effect of "cherry-picking" a.k.a. selection bias. Our main contribution is to extend the recently developed parametric programming approach for selective inference to high-order interaction models. Exhaustive search over the cherry tree (all possible interactions) can be daunting and impractical even for a small-sized problem. We introduced an efficient pruning strategy and demonstrated the computational efficiency and statistical power of the proposed method using both synthetic and real data.

stat.ML↗

arXiv2021

A generative model for molecule generation based on chemical reaction trees

Deep generative models have been shown powerful in generating novel molecules with desired chemical properties via their representations such as strings, trees or graphs. However, these models are limited in recommending synthetic routes for the generated molecules in practice. We propose a generative model to generate molecules via multi-step chemical reaction trees. Specifically, our model first propose a chemical reaction tree with predicted reaction templates and commercially available molecules (starting molecules), and then perform forward synthetic steps to obtain product molecules. Experiments show that our model can generate chemical reactions whose product molecules are with desired chemical properties. Also, the complete synthetic routes for these product molecules are provided.

cs.AI↗

arXiv2021

Continuous black-box optimization with quantum annealing and random subspace coding

A black-box optimization algorithm such as Bayesian optimization finds extremum of an unknown function by alternating inference of the underlying function and optimization of an acquisition function. In a high-dimensional space, such algorithms perform poorly due to the difficulty of acquisition function optimization. Herein, we apply quantum annealing (QA) to overcome the difficulty in the continuous black-box optimization. As QA specializes in optimization of binary problems, a continuous vector has to be encoded to binary, and the solution of QA has to be translated back. Our method has the following three parts: 1) Random subspace coding based on axis-parallel hyperrectangles from continuous vector to binary vector. 2) A quadratic unconstrained binary optimization (QUBO) defined by acquisition function based on nonnegative-weighted linear regression model which is solved by QA. 3) A penalization scheme to ensure that the QA solution can be translated back. It is shown in benchmark tests that its performance using D-Wave Advantage$^{\rm TM}$ quantum annealer is competitive with a state-of-the-art method based on the Gaussian process in high-dimensional problems. Our method may open up a new possibility of quantum annealing and other QUBO solvers including quantum approximate optimization algorithm (QAOA) using a gated-quantum computers, and expand its range of application to continuous-valued problems.

quant-ph↗

arXiv2019

Optimization of heterogeneous ternary Li3PO4-Li3BO3-Li2SO4 mixture for Li-ion conductivity by machine learning

Mixing heterogeneous Li-ion conductive materials is one of potential ways to enhance the Li-ion conductivity more than that of the parent materials. However, the development of the mixtures had not exhibited significant progress because it is a formidable task to cover the vast possible composition of the parent materials using traditional ways. Here, we introduce a fashion based on machine learning to optimize the composition ratio of ternary Li3PO4-Li3BO3-Li2SO4 mixture for its Li-ion conductivity. According to our results, the optimum composition of the ternary mixture system is 25:14:61 (Li3PO4: Li3BO3: Li2SO4 in mol%), whose Li-ion conductivity is measured as 4.9 x 10E-4 S/cm at 300 °C. Our X-ray structure analysis indicates that Li-ion conductivity in the mixing systems is enhanced by virtue of the coexistence of two or more phases. Although the mechanism enhancing Li-ion conductivity is not simple, our results demonstrate the effectiveness of machine learning for the development of materials.

cond-mat.mtrl-sci↗

arXiv2019

Leveraging Legacy Data to Accelerate Materials Design via Preference Learning

Machine learning applications in materials science are often hampered by shortage of experimental data. Integration with legacy data from past experiments is a viable way to solve the problem, but complex calibration is often necessary to use the data obtained under different conditions. In this paper, we present a novel calibration-free strategy to enhance the performance of Bayesian optimization with preference learning. The entire learning process is solely based on pairwise comparison of quantities (i.e., higher or lower) in the same dataset, and experimental design can be done without comparing quantities in different datasets. We demonstrate that Bayesian optimization is significantly enhanced via addition of legacy data for organic molecules and inorganic solid-state materials.

cond-mat.mtrl-sci↗

arXiv2019

Deep learning-based quality filtering of mechanically exfoliated 2D crystals

Two-dimensional (2D) crystals are attracting growing interest in various research fields such as engineering, physics, chemistry, pharmacy and biology owing to their low dimensionality and dramatic change of properties compared to the bulk counterparts. Among the various techniques used to manufacture 2D crystals, mechanical exfoliation has been essential to practical applications and fundamental research. However, mechanically exfoliated crystals on substrates contain relatively thick flakes that must be found and removed manually, limiting high-throughput manufacturing of atomic 2D crystals and van der Waals heterostructures. Here we present a deep learning-based method to segment and identify the thickness of atomic layer flakes from optical microscopy images. Through carefully designing a neural network based on U-Net, we found that our neural network based on U-net trained only with the data based on 24 images successfully distinguish monolayer and bilayer MoS2 with a success rate of 70%, which is a practical value in the first screening process for choosing monolayer and bilayer flakes of MoS2 of all flakes on substrates without human eye. The remarkable results highlight the possibility that a large fraction of manual laboratory work can be replaced by AI-based systems, boosting productivity.

physics.app-ph↗

arXiv2019

Expanding the horizon of automated metamaterials discovery via quantum annealing

Complexity of materials designed by machine learning is currently limited by the inefficiency of classical computers. We show how quantum annealing can be incorporated into automated materials discovery and conduct a proof-of-principle study on designing complex thermofunctional metamaterials consisting of SiO2, SiC, and Poly(methyl methacrylate). Empirical computing time of our quantum-classical hybrid algorithm involving a factorization machine, a rigorous coupled wave analysis, and a D-Wave 2000Q quantum annealer was insensitive to the problem size, while a classical counterpart experienced rapid increase. Our method was used to design complex structures of wavelength selective radiators showing much better concordance with the thermal atmospheric transparency window in comparison to existing human-designed alternatives. Our result shows that quantum annealing provides scientists gigantic computational power that may change how materials are designed.

physics.app-ph↗

arXiv2018

Efficient Construction Method for Phase Diagrams Using Uncertainty Sampling

We develop a method to efficiently construct phase diagrams using machine learning. Uncertainty sampling (US) in active learning is utilized to intensively sample around phase boundaries. Here, we demonstrate constructions of three known experimental phase diagrams by the US approach. Compared with random sampling, the US approach decreases the number of sampling points to about 20%. In particular, the reduction rate is pronounced in more complicated phase diagrams. Furthermore, we show that using the US approach, undetected new phase can be rapidly found, and smaller number of initial sampling points are sufficient. Thus, we conclude that the US approach is useful to construct complicated phase diagrams from scratch and will be an essential tool in materials science.

cond-mat.mtrl-sci↗

arXiv2018

Tensor Balancing on Statistical Manifold

We solve tensor balancing, rescaling an Nth order nonnegative tensor by multiplying N tensors of order N - 1 so that every fiber sums to one. This generalizes a fundamental process of matrix balancing used to compare matrices in a wide range of applications from biology to economics. We present an efficient balancing algorithm with quadratic convergence using Newton's method and show in numerical experiments that the proposed algorithm is several orders of magnitude faster than existing ones. To theoretically prove the correctness of the algorithm, we model tensors as probability distributions in a statistical manifold and realize tensor balancing as projection onto a submanifold. The key to our algorithm is that the gradient of the manifold, used as a Jacobian matrix in Newton's method, can be analytically obtained using the Moebius inversion formula, the essential of combinatorial mathematics. Our model is not limited to tensor balancing, but has a wide applicability as it includes various statistical and machine learning models such as weighted DAGs and Boltzmann machines.

stat.ME↗

arXiv2018

Legendre Decomposition for Tensors

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and always minimizes the KL divergence from an input tensor. We empirically show that Legendre decomposition can more accurately reconstruct tensors than other nonnegative tensor decomposition methods.

stat.ML↗

arXiv2018

Transductive Boltzmann Machines

We present transductive Boltzmann machines (TBMs), which firstly achieve transductive learning of the Gibbs distribution. While exact learning of the Gibbs distribution is impossible by the family of existing Boltzmann machines due to combinatorial explosion of the sample space, TBMs overcome the problem by adaptively constructing the minimum required sample space from data to avoid unnecessary generalization. We theoretically provide bias-variance decomposition of the KL divergence in TBMs to analyze its learnability, and empirically demonstrate that TBMs are superior to the fully visible Boltzmann machines and popularly used restricted Boltzmann machines in terms of efficiency and effectiveness.

stat.ML↗

arXiv2018

Population-based de novo molecule generation, using grammatical evolution

Automatic design with machine learning and molecular simulations has shown a remarkable ability to generate new and promising drug candidates. Current models, however, still have problems in simulation concurrency and molecular diversity. Most methods generate one molecule at a time and do not allow multiple simulators to run simultaneously. Additionally, better molecular diversity could boost the success rate in the subsequent drug discovery process. We propose a new population-based approach using grammatical evolution named ChemGE. In our method, a large population of molecules are updated concurrently and evaluated by multiple simulators in parallel. In docking experiments with thymidine kinase, ChemGE succeeded in generating hundreds of high-affinity molecules whose diversity is better than that of known inding molecules in DUD-E.

physics.chem-ph↗

arXiv2017

ChemTS: An Efficient Python Library for de novo Molecular Generation

Automatic design of organic materials requires black-box optimization in a vast chemical space. In conventional molecular design algorithms, a molecule is built as a combination of predetermined fragments. Recently, deep neural network models such as variational auto encoders (VAEs) and recurrent neural networks (RNNs) are shown to be effective in de novo design of molecules without any predetermined fragments. This paper presents a novel python library ChemTS that explores the chemical space by combining Monte Carlo tree search (MCTS) and an RNN. In a benchmarking problem of optimizing the octanol-water partition coefficient and synthesizability, our algorithm showed superior efficiency in finding high-scoring molecules. ChemTS is available at https://github.com/tsudalab/ChemTS.

physics.chem-ph↗