arXiv subjects

Ami S. Koshikawa

Publications and source records attributed to Ami S. Koshikawa.

4 recordsLinked to original sources

arXiv2026

Robust Wavelength Selection for Partial Least Squares Sugar Content Estimation Using Combinatorial Bayesian Optimization

Wavelength selection is one of the important preprocessing methods in near-infrared spectroscopy to improve prediction accuracy and interpretability of spectral data. We formulate wavelength-region selection for sugar content estimation as a binary black-box optimization problem and propose a method based on Bayesian optimization. The proposed method constructs a sparse quadratic surrogate model and sequentially extracts interested wavelength regions by Thompson sampling. Minimizing an acquisition function is performed as a quadratic unconstrained binary optimization problem by simulated or quantum annealing. Experiments show that the proposed method improves the prediction accuracy of partial least squares regression and yields more consistent wavelength regions than genetic-algorithm-based selection and simulated annealing. Under one-bit local perturbations, the selected wavelength regions show minimal fluctuations in root mean square errors between observed and predicted values of a validation set. This local stability suggests that our method converges to a smoother error landscape and avoids isolated overfitted solutions. These results indicate that combinatorial Bayesian optimization is a useful framework for robust feature selection in spectroscopic prediction tasks.

stat.ML↗

arXiv2024

Magnetic order in nanoscale gyroid networks

Three-dimensional magnetic metamaterials feature interesting phenomena that arise from a delicate interplay of material properties, local anisotropy, curvature, and connectivity. A particularly interesting magnetic lattice that combines these aspects is that of nanoscale gyroids, with a highly-interconnected chiral network with local three-connectivity reminiscent of three-dimensional artificial spin ices. Here, we use finite-element micromagnetic simulations to elucidate the anisotropic behaviour of nanoscale nickel gyroid networks at applied fields and at remanence. We simplify the description of the micromagnetic spin states with a macrospin model to explain the anistropic global response, to quantify the extent of ice-like correlations, and to discuss qualitative features of the anisotropic magnetoresistance in the three-dimensional network. Our results demonstrate the large variability of the magnetic order in extended gyroid networks, which might enable future spintronic functionalities, including neuromorphic computing and non-reciprocal transport.

cond-mat.mes-hall↗

arXiv2021

Combinatorial Black-box Optimization for Vehicle Design Problem

Black-box optimization minimizes an objective function without derivatives or explicit forms. Such an optimization method with continuous variables has been successful in the fields of machine learning and material science. For discrete variables, the Bayesian optimization of combinatorial structure (BOCS) is a powerful tool for solving black-box optimization problems. A surrogate model used in BOCS is the quadratic unconstrained binary optimization (QUBO) form. Because of the approximation of the objective function to the QUBO form in BOCS, BOCS can expand the possibilities of using D-Wave quantum annealers, which can generate near-optimal solutions of QUBO problems by utilizing quantum fluctuation. We demonstrate the use of BOCS and its variant for a vehicle design problem, which cannot be described in the QUBO form. As a result, BOCS and its variant slightly outperform the random search, which randomly calculates the objective function.

cond-mat.stat-mech↗

arXiv2021

Benchmark test of Black-box optimization using D-Wave quantum annealer

In solving optimization problems, objective functions generally need to be minimized or maximized. However, objective functions cannot always be formulated explicitly in a mathematical form for complicated problem settings. Although several regression techniques infer the approximate forms of objective functions, they are at times expensive to evaluate. Optimal points of "black-box" objective functions are computed in such scenarios, while effectively using a small number of clues. Recently, an efficient method by use of inference by sparse prior for a black-box objective function with binary variables has been proposed. In this method, a surrogate model was proposed in the form of a quadratic unconstrained binary optimization (QUBO) problem, and was iteratively solved to obtain the optimal solution of the black-box objective function. In the present study, we employ the D-Wave 2000Q quantum annealer, which can solve QUBO by driving the binary variables by quantum fluctuations. The D-Wave 2000Q quantum annealer does not necessarily output the ground state at the end of the protocol due to freezing effect during the process. We investigate effects from the output of the D-Wave quantum annealer in performing black-box optimization. We demonstrate a benchmark test by employing the sparse Sherrington-Kirkpatrick (SK) model as the black-box objective function, by introducing a parameter controlling the sparseness of the interaction coefficients. Comparing the results of the D-Wave quantum annealer to those of the simulated annealing (SA) and semidefinite programming (SDP), our results by the D-Wave quantum annealer and SA exhibit superiority in black-box optimization with SDP. On the other hand, we did not find any advantage of the D-Wave quantum annealer over the simulated annealing. As far as in our case, any effects by quantum fluctuation are not found.

cond-mat.stat-mech↗