arXiv subjects

Tomoyuki Tamura

Publications and source records attributed to Tomoyuki Tamura.

11 recordsLinked to original sources

arXiv2026

Information-Theoretic Bayesian Optimization for Bilevel Optimization Problems

A bilevel optimization problem consists of two optimization problems nested as an upper- and a lower-level problem, in which the optimality of the lower-level problem defines a constraint for the upper-level problem. This paper considers Bayesian optimization (BO) for the case that both the upper- and lower-levels involve expensive black-box functions. Because of its nested structure, bilevel optimization has a complex problem definition, by which bilevel BO has not been widely studied compared with other standard extensions of BO such as multi-objective or constraint problems. We propose an information-theoretic approach that considers the information gain of both the upper- and lower-optimal solutions and values. This enables us to define a unified criterion that measures the benefit for both level problems, simultaneously. Further, we also show a practical lower bound based approach to evaluating the information gain. We empirically demonstrate the effectiveness of our proposed method through several benchmark datasets.

cs.LG↗

arXiv2022

Sequential- and Parallel- Constrained Max-value Entropy Search via Information Lower Bound

Max-value entropy search (MES) is one of the state-of-the-art approaches in Bayesian optimization (BO). In this paper, we propose a novel variant of MES for constrained problems, called Constrained MES via Information lower BOund (CMES-IBO), that is based on a Monte Carlo (MC) estimator of a lower bound of a mutual information (MI). Unlike existing studies, our MI is defined so that uncertainty with respect to feasibility can be incorporated. We derive a lower bound of the MI that guarantees non-negativity, while a constrained counterpart of conventional MES can be negative. We further provide theoretical analysis that assures the low-variability of our estimator which has never been investigated for any existing information-theoretic BO. Moreover, using the conditional MI, we extend CMES-IBO to the parallel setting while maintaining the desirable properties. We demonstrate the effectiveness of CMES-IBO by several benchmark functions and real-world problems.

cs.LG↗

arXiv2020

Machine-Learning-based Prediction of Lattice Thermal Conductivity for Half-Heusler Compounds using Atomic Information

The half-Heusler compound has drawn attention in a variety of fields as a candidate material for thermoelectric energy conversion and spintronics technology. This is because it has various electronic structures, such as semi-metals, semiconductors, and a topological insulator. When the half-Heusler compound is incorporated into the device, the control of high lattice thermal conductivity owing to high crystal symmetry is a challenge for the thermal manager of the device. The calculation for the prediction of lattice thermal conductivity, which is an important physical parameter for controlling the thermal management of the device, requires a calculation cost of several 100 times as much as the usual density functional theory calculation. Therefore, we examined whether lattice thermal conductivity prediction by machine learning was possible on the basis of only the atomic information of constituent elements for thermal conductivity calculated by the density functional theory calculation in various half-Heusler compounds. Consequently, we constructed a machine learning model, which can predict the lattice thermal conductivity with high accuracy from the information of only atomic radius and atomic mass of each site in the half-Heusler type crystal structure. Applying our results, the lattice thermal conductivity for an unknown half-Heusler compound can be immediately predicted. In the future, low-cost and short-time development of new functional materials can be realized, leading to breakthroughs in the search of novel functional materials.

cond-mat.mtrl-sci↗

arXiv2020

Active-learning-based efficient prediction of ab-initio atomic energy: a case study on a Fe random grain boundary model with millions of atoms

We have developed a method that can analyze large random grain boundary (GB) models with the accuracy of density functional theory (DFT) calculations using active learning. It is assumed that the atomic energy is represented by the linear regression of the atomic structural descriptor. The atomic energy is obtained through DFT calculations using a small cell extracted from a huge GB model, called replica DFT atomic energy. The uncertainty reduction (UR) approach in active learning is used to efficiently collect the training data for the atomic energy. In this approach, atomic energy is not required to search for candidate points; therefore, sequential DFT calculations are not required. This approach is suitable for massively parallel computers that can execute a large number of jobs simultaneously. In this study, we demonstrate the prediction of the atomic energy of a Fe random GB model containing one million atoms using the UR approach and show that the prediction error decreases more rapidly compared with random sampling. We conclude that the UR approach with replica DFT atomic energy is useful for modeling huge GBs and will be essential for modeling other structural defects.

cond-mat.mtrl-sci↗

arXiv2020

Computational Design of Stable and Highly Ion-conductive Materials using Multi-objective Bayesian Optimization: Case Studies on Diffusion of Oxygen and Lithium

Ion-conducting solid electrolytes are widely used for a variety of purposes. Therefore, designing highly ion-conductive materials is in strongly demand. Because of advancement in computers and enhancement of computational codes, theoretical simulations have become effective tools for investigating the performance of ion-conductive materials. However, an exhaustive search conducted by theoretical computations can be prohibitively expensive. Further, for practical applications, both dynamic conductivity as well as static stability must be satisfied at the same time. Therefore, we propose a computational framework that simultaneously optimizes dynamic conductivity and static stability; this is achieved by combining theoretical calculations and the Bayesian multi-objective optimization that is based on the Pareto hyper-volume criterion. Our framework iteratively selects the candidate material, which maximizes the expected increase in the Pareto hyper-volume criterion; this is a standard optimality criterion of multi-objective optimization. Through two case studies on oxygen and lithium diffusions, we show that ion-conductive materials with high dynamic conductivity and static stability can be efficiently identified by our framework.

physics.comp-ph↗

arXiv2020

Multi-objective Bayesian Optimization using Pareto-frontier Entropy

This paper studies an entropy-based multi-objective Bayesian optimization (MBO). The entropy search is successful approach to Bayesian optimization. However, for MBO, existing entropy-based methods ignore trade-off among objectives or introduce unreliable approximations. We propose a novel entropy-based MBO called Pareto-frontier entropy search (PFES) by considering the entropy of Pareto-frontier, which is an essential notion of the optimality of the multi-objective problem. Our entropy can incorporate the trade-off relation of the optimal values, and further, we derive an analytical formula without introducing additional approximations or simplifications to the standard entropy search setting. We also show that our entropy computation is practically feasible by using a recursive decomposition technique which has been known in studies of the Pareto hyper-volume computation. Besides the usual MBO setting, in which all the objectives are simultaneously observed, we also consider the "decoupled" setting, in which the objective functions can be observed separately. PFES can easily adapt to the decoupled setting by considering the entropy of the marginal density for each output dimension. This approach incorporates dependency among objectives conditioned on Pareto-frontier, which is ignored by the existing method. Our numerical experiments show effectiveness of PFES through several benchmark datasets.

cs.LG↗

arXiv2018

Knowledge-Transfer based Cost-effective Search for Interface Structures: A Case Study on fcc-Al [110] Tilt Grain Boundary

Determining the atomic configuration of an interface is one of the most important issues in materials science research. Although theoretical simulations are effective tools, an exhaustive search is computationally prohibitive due to the high degrees of freedom of the interface structure. In the interface structure search, multiple energy surfaces created by a variety of orientation angles need to be explored, and the necessary computational costs for different angles vary substantially owing to significant variations in the supercell sizes. In this paper, we introduce two machine-learning concepts, called transfer learning and cost-sensitive search, to the interface-structure search. As a case study, we demonstrate the effectiveness of our method, called cost-sensitive multi-task Bayesian optimization (CMB), using the fcc-Al [110] tilt grain boundary. Four microscopic parameters, the three-dimensional rigid body translation, and the number of atomic columns, are optimized by transferring knowledge of energy surfaces among different orientation angles. We show that transferring knowledge of different energy surfaces can accelerate the structure search, and that considering the cost variations further improves the total efficiency.

cond-mat.mtrl-sci↗

arXiv2017

Symmetric powers of permutation representations of finite groups and primitive colorings on polyhedrons

In this paper, we define a set which has a finite group action and is generated by a finite color set, a set which has a finite group action, and a subset of the set of non negative integers. we state its properties to apply one of solution of the following two problems, respectively. First, we calculate the generating function of the character of symmetric powers of permutation representation associated with a set which has a finite group action. Second, we calculate the number of primitive colorings on some objects of polyhedrons. It is a generalization of the calculation of the number of primitive necklaces by N.Metropolis and G-C.Rota.

math.CO↗

arXiv2017

Exterior powers of representations of finite groups and integer-valued characters

For given representation of finite groups on a finite dimension complex vector space, we can define exterior powers of representations. In 1973, Knutson found one of methods of calculating the character of exterior powers of representations with properties of $λ$-rings. In this paper, we base this result of Knutson, and relate characters and elements of necklace rings, which were introduced by N.Metropolis and G-C.Rota in 1983, via a generating function of the character of exterior powers of representations. We focus on integer-valued characters and discuss a relation between integer-valued characters and element of necklace rings which has finite support and is contained in some images of truncated operations.

math.RT↗

arXiv2015

Sparse selection of bases in neural-network potential for crystalline and liquid Si

The neural-network interatomic potential for crystalline and liquid Si has been developed using the forward stepwise regression technique to reduce the number of bases with keeping the accuracy of the potential. This approach of making the neural-network potential enables us to construct the accurate interatomic potentials with less and important bases selected systematically and less heuristically. The evaluation of bulk crystalline properties, and dynamic properties of liquid Si show good agreements between the neural-network potential and ab-initio results.

cond-mat.mtrl-sci↗

arXiv2014

Irreducible decomposition and calculating of multiplicity of the symmetric and exterior powers representation of finite groups

In this paper we consider symmetric powers representation and exterior powers representation of finite groups, which generated by the representation which has finite dimension over the complex field. We calculate the multiplicity of irreducible component of two representations of some representation by using a character theory of representation and a pre-lambda-ring, for example, the regular representation.

math.RT↗