Naoki Hamada
Research Subjects
Research Interests
Naoki Hamada has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Daisuke Sakurai
Fujitsu Research Institute Fukuoka Japan
3 shared publications - Shunsuke Ichiki
Department of Mathematical and Computing Science, School of Computing, Tokyo Institute of Technology, Tokyo, Japan
3 shared publications - Likun Liu
Kyushu University, Fukuoka, Japan
2 shared publications - Ryosuke Ota
Kyushu University, Fukuoka, Japan
2 shared publications - Takahiro Yamamoto
Tokyo Gakugei University, Tokyo, Japan
2 shared publications Atsushi Takada
KLab Inc
1 shared publication
Latest Publications
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2294-2300
Towards Benchmarking Multi-Objective Optimization Algorithms Based on the Basin Connectivity
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2294-2300
Open AccessTowards Benchmarking Multi-Objective Optimization Algorithms Based on the Basin Connectivity
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 347-350
Visualization of Multiobjective Multimodal Benchmarking Based on Basin Connectivity
Visualization is useful for understanding the behavior of Multiobjective Evolutionary Algorithms (MOEAs). However, it has been challenging to investigate how an MOEA may be trapped by local Pareto optima, in which case some individuals stay inside a "valley" (also known as basins of attraction). To address this, we propose a novel visualization that projects the high-dimensional basins in a 2D plot, in which the individuals of benchmarked MOEAs for user-specified generations are visible. For this, we target specialized benchmark problems known as the Benchmarking Based on Basin Connectivity (3BC), which explicitly models basins of attraction and thus allows us to precompute the necessary geometry as what is called the Reeb space. Our demonstration shows that the proposed visualization displays basins in benchmark problems as intended and, reveals the differences in MOEAs' behaviors in response to the basins. The source code of our system is publically available at https://github.com/dsakurai/benchmark-visualizer.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 347-350
Open AccessVisualization of Multiobjective Multimodal Benchmarking Based on Basin Connectivity
Visualization is useful for understanding the behavior of Multiobjective Evolutionary Algorithms (MOEAs). However, it has been challenging to investigate how an MOEA may be trapped by local Pareto optima, in which case some individuals stay inside a "valley" (also known as basins of attraction). To address this, we propose a novel visualization that projects the high-dimensional basins in a 2D plot, in which the individuals of benchmarked MOEAs for user-specified generations are visible. For this, we target specialized benchmark problems known as the Benchmarking Based on Basin Connectivity (3BC), which explicitly models basins of attraction and thus allows us to precompute the necessary geometry as what is called the Reeb space. Our demonstration shows that the proposed visualization displays basins in benchmark problems as intended and, reveals the differences in MOEAs' behaviors in response to the basins. The source code of our system is publically available at https://github.com/dsakurai/benchmark-visualizer.
- Open Access
- 26 June 2023
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 37 (4) , 5266-5275
GenéLive! Generating Rhythm Actions in Love Live!
This article presents our generative model for rhythm action games together with applications in business operation. Rhythm action games are video games in which the player is challenged to issue commands at the right timings during a music session. The timings are rendered in the chart, which consists of visual symbols, called notes, flying through the screen. We introduce our deep generative model, GenéLive!, which outperforms the state-of-the-art model by taking into account musical structures through beats and temporal scales. Thanks to its favorable performance, GenéLive! was put into operation at KLab Inc., a Japan-based video game developer, and reduced the business cost of chart generation by as much as half. The application target included the phenomenal "Love Live!", which has more than 10 million users across Asia and beyond, and is one of the few rhythm action franchises that has led the online era of the genre. In this article, we evaluate the generative performance of GenéLive! using production datasets at KLab as well as open datasets for reproducibility, while the model continues to operate in their business. Our code and the model, tuned and trained using a supercomputer, are publicly available.
- 26 June 2023
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 37 (4) , 5266-5275
Open AccessGenéLive! Generating Rhythm Actions in Love Live!
This article presents our generative model for rhythm action games together with applications in business operation. Rhythm action games are video games in which the player is challenged to issue commands at the right timings during a music session. The timings are rendered in the chart, which consists of visual symbols, called notes, flying through the screen. We introduce our deep generative model, GenéLive!, which outperforms the state-of-the-art model by taking into account musical structures through beats and temporal scales. Thanks to its favorable performance, GenéLive! was put into operation at KLab Inc., a Japan-based video game developer, and reduced the business cost of chart generation by as much as half. The application target included the phenomenal "Love Live!", which has more than 10 million users across Asia and beyond, and is one of the few rhythm action franchises that has led the online era of the genre. In this article, we evaluate the generative performance of GenéLive! using production datasets at KLab as well as open datasets for reproducibility, while the model continues to operate in their business. Our code and the model, tuned and trained using a supercomputer, are publicly available.
- 9 November 2021
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 192 (1) , 248-270
Free Disposal Hull Condition to Verify When Efficiency Coincides with Weak Efficiency
- 9 November 2021
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 192 (1) , 248-270
Free Disposal Hull Condition to Verify When Efficiency Coincides with Weak Efficiency
- Open Access
Characterization of the equality of weak efficiency and efficiency on convex free disposal hulls
In solving a multi-objective optimization problem by scalarization techniques, solutions to a scalarized problem are, in general, weakly efficient rather than efficient to the original problem. Thus, it is crucial to understand what problem ensures that all weakly efficient solutions are efficient. In this paper, we give a characterization of the equality of the weakly efficient set and the efficient set, provided that the free disposal hull of the domain is convex. By using this characterization, we obtain various mathematical applications. As a practical application, we show that all weakly efficient solutions to a multi-objective LASSO with mild modification are efficient.
Open AccessCharacterization of the equality of weak efficiency and efficiency on convex free disposal hulls
In solving a multi-objective optimization problem by scalarization techniques, solutions to a scalarized problem are, in general, weakly efficient rather than efficient to the original problem. Thus, it is crucial to understand what problem ensures that all weakly efficient solutions are efficient. In this paper, we give a characterization of the equality of the weakly efficient set and the efficient set, provided that the free disposal hull of the domain is convex. By using this characterization, we obtain various mathematical applications. As a practical application, we show that all weakly efficient solutions to a multi-objective LASSO with mild modification are efficient.
- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 30 (3) , 2659-2686
Topology of Pareto Sets of Strongly Convex Problems
A multiobjective optimization problem is simplicial if the Pareto set and front are homeomorphic to a simplex and, under the homeomorphisms, each face of the simplex corresponds to the Pareto set and front of a subproblem that treats a subset of objective functions. In this paper, we show that strongly convex problems are simplicial under a mild assumption on the ranks of the differentials of the objective mappings. We further prove that one can make any strongly convex problem satisfy the assumption by a generic linear perturbation, provided that the dimension of the source is sufficiently larger than that of the target. We demonstrate that the location problems, a biological modeling, and the ridge regression can be reduced to multiobjective strongly convex problems via appropriate transformations preserving the Pareto ordering and the topology.
- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 30 (3) , 2659-2686
Topology of Pareto Sets of Strongly Convex Problems
A multiobjective optimization problem is simplicial if the Pareto set and front are homeomorphic to a simplex and, under the homeomorphisms, each face of the simplex corresponds to the Pareto set and front of a subproblem that treats a subset of objective functions. In this paper, we show that strongly convex problems are simplicial under a mild assumption on the ranks of the differentials of the objective mappings. We further prove that one can make any strongly convex problem satisfy the assumption by a generic linear perturbation, provided that the dimension of the source is sufficiently larger than that of the target. We demonstrate that the location problems, a biological modeling, and the ridge regression can be reduced to multiobjective strongly convex problems via appropriate transformations preserving the Pareto ordering and the topology.
- 9 December 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 52, 1913-1918
Applications of fuzzy logic/neural network to securities trading decision support system
- 9 December 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 52, 1913-1918
Applications of fuzzy logic/neural network to securities trading decision support system