arXiv subjects

Yusuke Ogura

Publications and source records attributed to Yusuke Ogura.

5 recordsLinked to original sources

arXiv2026

Deterministic Ground-State Search in a Spatial Photonic Ising Machine by Phase Retrieval

A spatial photonic Ising machine (SPIM) solves large-scale combinatorial optimization problems by computing the Ising Hamiltonian through an optical Fourier transform. However, the ground-state search relies on the annealing process, in which spins are optimized stochastically and sequentially. We propose a ground-state search based on phase retrieval (PR), in which all spins are updated simultaneously and deterministically. By imposing an amplitude constraint in the Fourier plane, the modulated phase distribution corresponding to a spin configuration is guided toward the optimal solution. We numerically demonstrate that the proposed scheme reaches the ground state of rank-one Ising Hamiltonians with $10^4$ spins in a single iteration for all trials. Moreover, a radial rearrangement of the amplitude and the suitable design of the target pattern relaxed the search stagnation and promoted the optimization of spin configurations. The collective and deterministic spin update by phase retrieval provides a fast ground-state search for large-scale combinatorial optimization.

physics.optics↗

arXiv2025

Parallel spatial photonic Ising machine using spatial multiplexing for accelerating combinatorial optimization

A spatial photonic Ising machine (SPIM) handles large-scale combinatorial optimization problems owing to optical processing with spatial parallelism. However, iterative feedback in the search for optimal solutions limits processing speed even though the Ising Hamiltonian is computed optically. We propose a parallel spatial photonic Ising machine (pSPIM) utilizing spatial multiplexing to search for an optimal solution efficiently. By employing grating patterns and encoding multiple sets of Ising spins in a phase distribution, several Ising Hamiltonians are computed simultaneously. We demonstrated that Max-Cut problems requiring 100 Ising spins are solved faster as the number of processing units increases. In addition, combining the multicomponent model with parallel processing allows for efficient searching for optimal solutions to problems represented by using interaction matrixes with a rank greater than one. The pSPIM achieves high-speed searching of optimal solutions of large-scale combinatorial optimization problems.

physics.optics↗

arXiv2023

Spatial-photonic Ising machine by space-division multiplexing with physically tunable coefficients of a multi-component model

This paper proposes a space-division multiplexed spatial-photonic Ising machine (SDM-SPIM) that physically calculates the weighted sum of the Ising Hamiltonians for individual components in a multi-component model. Space-division multiplexing enables tuning a set of weight coefficients as an optical parameter and obtaining the desired Ising Hamiltonian at a time. We solved knapsack problems to verify the system's validity, demonstrating that optical parameters impact the search property. We also investigated a new dynamic coefficient search algorithm to enhance search performance. The SDM-SPIM would physically calculate the Hamiltonian and a part of the optimization with an electronics process.

physics.optics↗

arXiv2023

Low-rank combinatorial optimization and statistical learning by spatial photonic Ising machine

The spatial photonic Ising machine (SPIM) [D. Pierangeli et al., Phys. Rev. Lett. 122, 213902 (2019)] is a promising optical architecture utilizing spatial light modulation for solving large-scale combinatorial optimization problems efficiently. The primitive version of the SPIM, however, can accommodate Ising problems with only rank-one interaction matrices. In this Letter, we propose a new computing model for the SPIM that can accommodate any Ising problem without changing its optical implementation. The proposed model is particularly efficient for Ising problems with low-rank interaction matrices, such as knapsack problems. Moreover, it acquires the learning ability of Boltzmann machines. We demonstrate that learning, classification, and sampling of the MNIST handwritten digit images are achieved efficiently using the model with low-rank interactions. Thus, the proposed model exhibits higher practical applicability to various problems of combinatorial optimization and statistical learning, without losing the scalability inherent in the SPIM architecture.

cond-mat.dis-nn↗

arXiv2023

Case-based Similar Image Retrieval for Weakly Annotated Large Histopathological Images of Malignant Lymphoma Using Deep Metric Learning

In the present study, we propose a novel case-based similar image retrieval (SIR) method for hematoxylin and eosin (H&E)-stained histopathological images of malignant lymphoma. When a whole slide image (WSI) is used as an input query, it is desirable to be able to retrieve similar cases by focusing on image patches in pathologically important regions such as tumor cells. To address this problem, we employ attention-based multiple instance learning, which enables us to focus on tumor-specific regions when the similarity between cases is computed. Moreover, we employ contrastive distance metric learning to incorporate immunohistochemical (IHC) staining patterns as useful supervised information for defining appropriate similarity between heterogeneous malignant lymphoma cases. In the experiment with 249 malignant lymphoma patients, we confirmed that the proposed method exhibited higher evaluation measures than the baseline case-based SIR methods. Furthermore, the subjective evaluation by pathologists revealed that our similarity measure using IHC staining patterns is appropriate for representing the similarity of H&E-stained tissue images for malignant lymphoma.

cs.CV↗