arXiv subjects

Kenshin Abe

Publications and source records attributed to Kenshin Abe.

5 recordsLinked to original sources

arXiv2025

Learning to detect continuous gravitational waves: an open data-analysis competition

We report results of a public data-analysis challenge, hosted on the open data-science platform Kaggle, to detect simulated continuous gravitational-wave signals (CWs). These are weak signals from rapidly spinning neutron stars that remain undetected despite extensive searches. The competition dataset consisted of a population of CW signals using both simulated and real LIGO detector data matching the conditions of actual CW searches. The competition attracted more than 1,000 participants to develop realistic CW search algorithms. We describe the top 10 approaches and discuss their applicability as a pre-processing step compared to standard CW-search approaches. For the competition's dataset, we find that top approaches can reduce the computing cost by 1 to 3 orders of magnitude at a false-dismissal probability comparable to standard CW searches. Additionally, the competition drove the development of new GPU-accelerated detection pipelines, which facilitated their adoption in other areas of gravitational-wave data analysis. We release the associated dataset, which constitutes the first open standardized benchmark for CW detection, to enable reproducible method comparisons and to encourage further developments toward the first detection of these elusive signals.

gr-qc↗

arXiv2025

Tree-Structured Parzen Estimator Can Solve Black-Box Combinatorial Optimization More Efficiently

Tree-structured Parzen estimator (TPE) is a versatile hyperparameter optimization (HPO) method supported by popular HPO tools. Since these HPO tools have been developed in line with the trend of deep learning (DL), the problem setups often used in the DL domain have been discussed for TPE such as multi-objective optimization and multi-fidelity optimization. However, the practical applications of HPO are not limited to DL, and black-box combinatorial optimization is actively utilized in some domains, e.g., chemistry and biology. As combinatorial optimization has been an untouched, yet very important, topic in TPE, we propose an efficient combinatorial optimization algorithm for TPE. In this paper, we first generalize the categorical kernel with the numerical kernel in TPE, enabling us to introduce a distance structure to the categorical kernel. Then we discuss modifications for the newly developed kernel to handle a large combinatorial search space. These modifications reduce the time complexity of the kernel calculation with respect to the size of a combinatorial search space. In the experiments using synthetic problems, we verified that our proposed method identifies better solutions with fewer evaluations than the original TPE. Our algorithm is available in Optuna, an open-source framework for HPO.

cs.LG↗

arXiv2024

PLaMo-100B: A Ground-Up Language Model Designed for Japanese Proficiency

We introduce PLaMo-100B, a large-scale language model designed for Japanese proficiency. The model was trained from scratch using 2 trillion tokens, with architecture such as QK Normalization and Z-Loss to ensure training stability during the training process. Post-training techniques, including Supervised Fine-Tuning and Direct Preference Optimization, were applied to refine the model's performance. Benchmark evaluations suggest that PLaMo-100B performs well, particularly in Japanese-specific tasks, achieving results that are competitive with frontier models like GPT-4. The base model is available at https://huggingface.co/pfnet/plamo-100b.

cs.CL↗

arXiv2021

Abelian Neural Networks

We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it to Abelian semigroup operations using the characterization of associative symmetric polynomials. Both models take advantage of the analytic invertibility of invertible neural networks. For each case, by repeating the binary operations, we can represent a function for multiset input thanks to the algebraic structure. Naturally, our multiset architecture has size-generalization ability, which has not been obtained in existing methods. Further, we present modeling the Abelian group operation itself is useful in a word analogy task. We train our models over fixed word embeddings and demonstrate improved performance over the original word2vec and another naive learning method.

cs.LG↗

arXiv2020

Solving NP-Hard Problems on Graphs with Extended AlphaGo Zero

There have been increasing challenges to solve combinatorial optimization problems by machine learning. Khalil et al. proposed an end-to-end reinforcement learning framework, S2V-DQN, which automatically learns graph embeddings to construct solutions to a wide range of problems. To improve the generalization ability of their Q-learning method, we propose a novel learning strategy based on AlphaGo Zero which is a Go engine that achieved a superhuman level without the domain knowledge of the game. Our framework is redesigned for combinatorial problems, where the final reward might take any real number instead of a binary response, win/lose. In experiments conducted for five kinds of NP-hard problems including {\sc MinimumVertexCover} and {\sc MaxCut}, our method is shown to generalize better to various graphs than S2V-DQN. Furthermore, our method can be combined with recently-developed graph neural network (GNN) models such as the \emph{Graph Isomorphism Network}, resulting in even better performance. This experiment also gives an interesting insight into a suitable choice of GNN models for each task.

cs.LG↗