RYRyota Yasudo

Ryota Yasudo

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ryota Yasudo has a total of 55 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Memory-Efficient and Trustworthy Neural Networks via Random Seed-Based Design

    by Hiroaki Ito, Hikari Otsuka, Ryota Yasudo, Zhiqiang Que, Jose G. F. Coutinho, Daichi Fujiki, Masato Motomura, Ce Guo, Wayne Luk

    Deep learning models deployed in resource-constrained and safety-critical settings must be not only compact and accurate but also trustworthy and capable of expressing predictive uncertainty. However, conventional compression techniques such as pruning and quantization often make models overconfident, while uncertainty-aware methods like Bayesian inference and ensembles ignore memory and compute budgets. In this work, we propose Random Seed-Based Design, a framework that elevates the random seed to a first-class design primitive for jointly shaping sparsity, freezing, and stochastic inference. Random seeds deterministically generate all stochastic components: Strong Lottery Ticket weights, partially frozen masks, and Monte Carlo Dropout masks, so that a deployed model can be exactly regenerated from seeds, binary masks, and a small set of interpretable hyperparameters instead of dense weight tensors. We formulate this seed-based construction as a multi-objective design problem over accuracy, calibration, uncertainty, FLOP, and memory footprint, and solve it with Bayesian optimization. This seed-based design enables us to characterize Pareto-optimal trade-offs between efficiency and trustworthiness across diverse architectures, including convolutional neural networks and graph neural networks, thereby illuminating domain-dependent relationships between computational efficiency and predictive reliability. Our method discovers models that are tens to hundreds of times smaller than their dense counterparts, reduces expected calibration error by up to an order of magnitude, and matches or improves accuracy. These results show that structured seed-controlled randomness improves both compression and trustworthiness, rather than treating them as competing objectives. The source code is available at https://github.com/itocha/SLT-TRUST.

  • Open Access

    Photonic Ising Machine Using Parallel Bandit Architecture Based on Laser Chaos

    by Ryota Yasudo, Michihiro Koibuchi, Mikio Hasegawa

    Photonic computing has emerged as a transformative technology for overcoming the fundamental limitations of semiconductor technology. Among recent advancements, the laser chaos decision maker has been introduced for ultrafast decision making by leveraging chaotic time series, primarily to solve the multi-armed bandit problem. In this study, we propose applying a laser chaos decision maker to a fully-connected Ising machine. Our method extends the applicability of the laser chaos decision maker, and achieves a first-ever Ising machine that obtains high-quality soloutions on the order of nanoseconds. Our approach addresses two critical challenges: the vast search space and the design of an algorithm to map the multi-armed bandit problem to Ising problems. To address these issues, we employ a parallel bandit architecture and design an algorithm to set the ground truth of decision-making repeatedly. Our GPU-based simulation evaluates the performance of our method using various benchmark problems and time series. We also analyze the effect of autocorrelation and the distribution of time series used by the laser chaos decision maker.


  • Open Access

    Trustworthy Deep Learning Acceleration with Customizable Design Flow Automation

    by Zhiqiang Que, Hongxiang Fan, Gabriel Figueiredo, Ce Guo, Wayne Luk, Ryota Yasudo, Masato Motomura


  • Open Access

    Amorphica: A Fully Connected Annealer Supporting Metamorphic Annealing and Scalable Multi Chip Integration

    by Daiki Okonogi, Jaehoon Yu, Satoru Jimbo, Genta Inoue, Akira Hyodo, Kota Ando, Bruno Hideki Fukushima-Kimura, Ryota Yasudo, Thiem van Chu, Masato Motomura, et al.

  • Open Access

    A Scalable Accelerator for Local Score Computation of Structure Learning in Bayesian Networks

    by Ryota Miyagi, Ryota Yasudo, Kentaro Sano, Hideki Takase

    A Bayesian network is a powerful tool for representing uncertainty in data, offering transparent and interpretable inference, unlike neural networks’ black-box mechanisms. To fully harness the potential of Bayesian networks, it is essential to learn the graph structure that appropriately represents variable interrelations within data. Score-based structure learning, which involves constructing collections of potentially optimal parent sets for each variable, is computationally intensive, especially when dealing with high-dimensional data in discrete random variables. Our proposed novel acceleration algorithm extracts high levels of parallelism, offering significant advantages even with reduced reusability of computational results. In addition, it employs an elastic data representation tailored for parallel computation, making it FPGA-friendly and optimizing module occupancy while ensuring uniform handling of diverse problem scenarios. Demonstrated on a Xilinx Alveo U50 FPGA, our implementation significantly outperforms optimal CPU algorithms and is several times faster than GPU implementations on an NVIDIA TITAN RTX. Furthermore, the results of performance modeling for the accelerator indicate that, for sufficiently large problem instances, it is weakly scalable, meaning that it effectively utilizes increased computational resources for parallelization. To our knowledge, this is the first study to propose a comprehensive methodology for accelerating score-based structure learning, blending algorithmic and architectural considerations.

  • GPU-accelerated scalable solver with bit permutated cyclic-min algorithm for quadratic unconstrained binary optimization

    by Ryota Yasudo, Koji Nakano, Yasuaki Ito, Ryota Katsuki, Yusuke Tabata, Takashi Yazane, Kenichiro Hamano


  • Simple iterative trial search for the maximum independent set problem optimized for the GPUs

    by Tomohiro Imanaga, Koji Nakano, Ryota Yasudo, Yasuaki Ito, Yuya Kawamata, Ryota Katsuki, Yusuke Tabata, Takashi Yazane, Kenichiro Hamano

    An independent set of a graph is a subset of the nodes such that no two nodes in it are adjacent. The maximum independent set (MIS) problem is an optimization problem to find a largest independent set. The main contribution of this article is to introduce a generic iterative trial search algorithm that we call iMIS for finding approximate solutions for the MIS problem. The generic algorithm iMIS is designed so that it can be implemented to run on GPUs very efficiently. Since the performance of the algorithm varies depending on its search strategy, we present a hybrid algorithm that combines three strategies of the iMIS such that best one of them for an input graph is automatically selected. We have implemented our hybrid algorithm to run on a multi‐GPU server with eight NVIDIA A100 GPUs. And evaluated the performance for 66 DIMACS benchmark graphs and 78 random graphs with up to 256M nodes. We have also evaluated the performance of three previously published algorithms for the MIS problem and an approach using Gurobi linear programming solver. The experimental results show that our hybrid algorithm can find larger independent sets for all 144 graphs compared to other methods.


  • Solving the sparse QUBO on multiple GPUs for Simulating a Quantum Annealer

    by Tomohiro Imanaga, Koji Nakano, Ryota Yasudo, Yasuaki Ito, Yuya Kawamata, Ryota Katsuki, Shiro Ozaki, Takashi Yazane, Kenichiro Hamano

    Quadratic Unconstraint Binary Optimization (QUBO) is a combinatorial optimization problem such that an $n\times n$ upper triangle matrix $W$ is given and the objective is to find an n-bit vector $X$ that minimizes the energy value $E(X)=X^{T}WX$ . A QUBO instance $W$ is sparse if instance $W$ has few non-zero elements. The D-Wave 2000 $Q$ is a quantum annealer that can solve 2048-bit sparse QUBO instances represented as a Chimera graph topology. We present a sparse QUBO solver running on GPUs for 2048-bit sparse QUBO with a Chimera graph topology. We have evaluated the performance of our sparse QUBO solver and the D-Wave 2000Q for solving 2048-bit QUBO instances with various resolutions. The experimental results show that our sparse QUBO solver running on a GPU cloud server with 8 NVIDIA A100 GPUs can find optimal solutions in less than 3ms for all instances while the D-Wave 2000 $Q$ cannot find them in 996.7ms. Hence, our QUBO solver can find better solutions than the D-Wave 2000Q in less than 1/300 running time. We can think that our QUBO solver is a quantum annealer simulator with better performance in terms of the accuracy of solutions and the running time. Our result implies that quantum annealer D-Wave 2000 $Q$ does not achieve quantum supremacy yet.


  • High‐throughput FPGA implementation for quadratic unconstrained binary optimization

    by Hiroshi Kagawa, Yasuaki Ito, Koji Nakano, Ryota Yasudo, Yuya Kawamata, Ryota Katsuki, Yusuke Tabata, Takashi Yazane, Kenichiro Hamano

    Quadratic unconstrained binary optimization (QUBO) is a combinatorial optimization problem. Since various NP‐hard problems such as the traveling salesman problem can be formulated as a QUBO instance, QUBO is used with a wide range of applications. The main contribution of this article is to propose high‐throughput FPGA implementations for the QUBO solver. We perform the local search using different bit‐selection strategies based on the simulated annealing in the proposed implementation. The hardware is a pipeline structure with no pipeline hazards using multiple instances, where the bit‐flip operation is always performed every clock cycle. We implemented the proposed circuit on Xilinx UltraScale+ FPGA VU9P. The implementation result shows that the circuit can search solutions per second. Besides, by sharing the block RAM that stores a weight matrix, we implemented a dual annealer architecture that has two QUBO solvers into the FPGA. As a result, the dual annealer architecture can search solutions per second.


  • Designing low‐diameter interconnection networks with multi‐ported host‐switch graphs

    by Ryota Yasudo, Koji Nakano, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano

    Summary: A host‐switch graph was originally proposed as a graph that represents a network topology of a computer systems with 1‐port host computers and‐port switches. It has been studied from both theoretical and practical aspects in terms of the diameter, the average shortest path length, and the performance of real applications. In recent high‐performance computing systems, however, a host computer is connected to multiple switches by using InfiniBand, NVSwitch, or Omni‐Path, and consequently they provide high bandwidths. Since a host‐switch graph cannot represent such systems, this article extends a host‐switch graph so that it can represent such systems. As a result, a host‐switch graph can include multi‐ported hosts. Furthermore, we propose to use multi‐port hosts for reducing the diameter. We show that the diameter minimization is equivalent to solving the degree diameter problem for bipartite graphs of diameter three. Our experimental results show that we can drastically reduce the diameter as well as increasing the bandwidth and improves performance of MPI applications by up to 162% as compared with networks with single‐ported hosts.