Yohei Hamakawa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yohei Hamakawa has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Kosuke Tatsumura
Corporate Laboratory, Toshiba Corporation, Kawasaki, Japan
4 shared publications - Masaya Yamasaki
Corporate Laboratory, Toshiba Corporation, Kawasaki, Japan
3 shared publications - Tomoya Kashimata
Corporate Laboratory, Toshiba Corporation, Kawasaki, Japan
2 shared publications - Hiroshi Fujimoto
MIRISE Technologies, Aichi, Japan
1 shared publication - Jun Nakayama
Corporate Research and Development Center, Toshiba Corporation, Kawasaki, Japan
1 shared publication - Koji Oya
MIRISE Technologies, Aichi, Japan
1 shared publication
Latest Publications
- Open Access
- 3 September 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 8085
Real-time black-box optimization for dynamic discrete environments using embedded Ising machines
Many real-time systems require the optimization of discrete variables. Black-box optimization (BBO) algorithms and multi-armed bandit (MAB) algorithms perform optimization by repeatedly taking actions and observing the corresponding immediate rewards without any prior knowledge. Recently, a BBO method using an Ising machine has been proposed to find the best action represented by a combination of discrete values and maximize the immediate reward in static environments. By contrast, real-time systems operate in dynamic environments and necessitate MAB algorithms that maximize the average reward over repeated trials. Due to the enormous number of actions resulting from the combinatorial nature of discrete optimization, conventional MAB algorithms cannot effectively optimize actions for dynamic, discrete environments. Here, we show a heuristic method to maximize the average reward for dynamic discrete environments by extending the BBO method, in which an Ising machine efficiently explores actions while accounting for interactions between variables and environmental changes. We demonstrate the adaptability to dynamic environments of the proposed method in a wireless communication system with moving users.
- 3 September 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 8085
Open AccessReal-time black-box optimization for dynamic discrete environments using embedded Ising machines
Many real-time systems require the optimization of discrete variables. Black-box optimization (BBO) algorithms and multi-armed bandit (MAB) algorithms perform optimization by repeatedly taking actions and observing the corresponding immediate rewards without any prior knowledge. Recently, a BBO method using an Ising machine has been proposed to find the best action represented by a combination of discrete values and maximize the immediate reward in static environments. By contrast, real-time systems operate in dynamic environments and necessitate MAB algorithms that maximize the average reward over repeated trials. Due to the enormous number of actions resulting from the combinatorial nature of discrete optimization, conventional MAB algorithms cannot effectively optimize actions for dynamic, discrete environments. Here, we show a heuristic method to maximize the average reward for dynamic discrete environments by extending the BBO method, in which an Ising machine efficiently explores actions while accounting for interactions between variables and environmental changes. We demonstrate the adaptability to dynamic environments of the proposed method in a wireless communication system with moving users.
- Open Access
- 16 June 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 4877
Machine learning-assisted high-speed combinatorial optimization with Ising machines for dynamically changing problems
Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world and practical applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop networks, financial trading, and emerging in-vehicle systems, require solving those problems sequentially where the size and characteristics change dynamically. However, using Ising machines for practical deployment involves challenges to shorten system-wide latency due to the transfer of large Ising model or the cloud access and to determine the parameters for each problem. Here we show a combinatorial optimization method using embedded Ising machines, which enables solving diverse problems at high speed without runtime parameter tuning. We customize the algorithm and circuit architecture of the simulated bifurcation-based Ising machine to compress the Ising model and accelerate computation and then build a machine learning model to estimate appropriate parameters using extensive training data. In TDMA scheduling for wireless multi-hop networks, our demonstration shows that the sophisticated system can adapt to changes in the problem and has a speed advantage over conventional methods.
- 16 June 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 4877
Open AccessMachine learning-assisted high-speed combinatorial optimization with Ising machines for dynamically changing problems
Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world and practical applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop networks, financial trading, and emerging in-vehicle systems, require solving those problems sequentially where the size and characteristics change dynamically. However, using Ising machines for practical deployment involves challenges to shorten system-wide latency due to the transfer of large Ising model or the cloud access and to determine the parameters for each problem. Here we show a combinatorial optimization method using embedded Ising machines, which enables solving diverse problems at high speed without runtime parameter tuning. We customize the algorithm and circuit architecture of the simulated bifurcation-based Ising machine to compress the Ising model and accelerate computation and then build a machine learning model to estimate appropriate parameters using extensive training data. In TDMA scheduling for wireless multi-hop networks, our demonstration shows that the sophisticated system can adapt to changes in the problem and has a speed advantage over conventional methods.
- Open Access
- 17 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Enhancing vehicle-mountable multiple object tracking systems with embeddable Ising machines
The cognitive function of tracking multiple objects, essential for autonomous mobile vehicles or autonomous robots, involves object detection and their temporal associations. While significant progress has recently been made in machine learning to elaborate the similarity matrix between the objects that have been recognized and the objects detected in the current video frame, less progress has been made on the assignment problem that ultimately determines temporal associations, which is a combinatorial optimization problem. Here we show a vehicle-mountable multiple object tracking system with a flexible assignment function for tracking through multiple long-term occlusion events. To solve the flexible assignment problem, formulated as a nondeterministic polynomial-time hard problem, the system relies on an embedded Ising machine based on a quantum-inspired algorithm called simulated bifurcation. Using a vehicle-mountable computing platform, we demonstrate real-time system-wide throughput of more than 20 frames per second with the enhanced functionality.
- 17 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Open AccessEnhancing vehicle-mountable multiple object tracking systems with embeddable Ising machines
The cognitive function of tracking multiple objects, essential for autonomous mobile vehicles or autonomous robots, involves object detection and their temporal associations. While significant progress has recently been made in machine learning to elaborate the similarity matrix between the objects that have been recognized and the objects detected in the current video frame, less progress has been made on the assignment problem that ultimately determines temporal associations, which is a combinatorial optimization problem. Here we show a vehicle-mountable multiple object tracking system with a flexible assignment function for tracking through multiple long-term occlusion events. To solve the flexible assignment problem, formulated as a nondeterministic polynomial-time hard problem, the system relies on an embedded Ising machine based on a quantum-inspired algorithm called simulated bifurcation. Using a vehicle-mountable computing platform, we demonstrate real-time system-wide throughput of more than 20 frames per second with the enhanced functionality.
- Open Access
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 142979-142991
Correlation-Diversified Portfolio Construction by Finding Maximum Independent Set in Large-Scale Market Graph
Correlation-diversified portfolios can be constructed by finding the maximum independent sets (MISs) in market graphs with edges corresponding to correlations between two stocks. The computational complexity to find the MIS increases exponentially as the size of the market graph increases, making the MIS selection in a large-scale market graph difficult. Here we construct a diversified portfolio through solving the MIS problem for a large-scale market graph with a combinatorial optimization solver (an Ising machine) based on a quantum-inspired algorithm called simulated bifurcation (SB) and investigate the investment performance of the constructed portfolio using long-term historical market data at the Tokyo Stock Exchange. Comparisons using stock universes of various sizes [TOPIX 100, Nikkei 225, TOPIX 1000, and TOPIX (including approximately 2,000 constituents)] show that the SB-based solver outperforms conventional MIS solvers in terms of computation-time and solution-accuracy. By using the SB-based solver, we optimized the parameters of a MIS portfolio strategy through iteration of the backcast simulation that calculates the performance of the MIS portfolio strategy based on a large-scale universe covering more than 1,700 Japanese stocks for a long period of 10 years. It has been found that the best MIS portfolio strategy (Sharpe ratio = 1.16, annualized return/risk = 16.3%/14.0%) outperforms the major indices such as TOPIX (0.66, 10.0%/15.2%) and MSCI Japan Minimum Volatility Index (0.64, 7.7%/12.1%) for the period from 2013 to 2023. Factor analyses reveal that the selection of small-capitalization and low-correlation stocks results in the portfolio performance with not only the relatively low risk (the diversification effect as expected) but also the relatively high return.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 142979-142991
Open AccessCorrelation-Diversified Portfolio Construction by Finding Maximum Independent Set in Large-Scale Market Graph
Correlation-diversified portfolios can be constructed by finding the maximum independent sets (MISs) in market graphs with edges corresponding to correlations between two stocks. The computational complexity to find the MIS increases exponentially as the size of the market graph increases, making the MIS selection in a large-scale market graph difficult. Here we construct a diversified portfolio through solving the MIS problem for a large-scale market graph with a combinatorial optimization solver (an Ising machine) based on a quantum-inspired algorithm called simulated bifurcation (SB) and investigate the investment performance of the constructed portfolio using long-term historical market data at the Tokyo Stock Exchange. Comparisons using stock universes of various sizes [TOPIX 100, Nikkei 225, TOPIX 1000, and TOPIX (including approximately 2,000 constituents)] show that the SB-based solver outperforms conventional MIS solvers in terms of computation-time and solution-accuracy. By using the SB-based solver, we optimized the parameters of a MIS portfolio strategy through iteration of the backcast simulation that calculates the performance of the MIS portfolio strategy based on a large-scale universe covering more than 1,700 Japanese stocks for a long period of 10 years. It has been found that the best MIS portfolio strategy (Sharpe ratio = 1.16, annualized return/risk = 16.3%/14.0%) outperforms the major indices such as TOPIX (0.66, 10.0%/15.2%) and MSCI Japan Minimum Volatility Index (0.64, 7.7%/12.1%) for the period from 2013 to 2023. Factor analyses reveal that the selection of small-capitalization and low-correlation stocks results in the portfolio performance with not only the relatively low risk (the diversification effect as expected) but also the relatively high return.