arXiv subjects

Taiki Yamaguchi

Publications and source records attributed to Taiki Yamaguchi.

4 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

A Practical Two-Stage Recipe for Mathematical LLMs: Maximizing Accuracy with SFT and Efficiency with Reinforcement Learning

Enhancing the mathematical reasoning of Large Language Models (LLMs) is a pivotal challenge in advancing AI capabilities. While Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL) are the dominant training paradigms, a systematic methodology for combining them to maximize both accuracy and efficiency remains largely unexplored. This paper introduces a practical and effective training recipe that strategically integrates extended SFT with RL from online inference (GRPO). We posit that these methods play complementary, not competing, roles: a prolonged SFT phase first pushes the model's accuracy to its limits, after which a GRPO phase dramatically improves token efficiency while preserving this peak performance. Our experiments reveal that extending SFT for as many as 10 epochs is crucial for performance breakthroughs, and that the primary role of GRPO in this framework is to optimize solution length. The efficacy of our recipe is rigorously validated through top-tier performance on challenging benchmarks, including a high rank among over 2,200 teams in the strictly leak-free AI Mathematical Olympiad (AIMO). This work provides the community with a battle-tested blueprint for developing state-of-the-art mathematical reasoners that are both exceptionally accurate and practically efficient. To ensure full reproducibility and empower future research, we will open-source our entire framework, including all code, model checkpoints, and training configurations at https://github.com/analokmaus/kaggle-aimo2-fast-math-r1.

cs.LG↗

arXiv2022

Towards Universal Neural Network Potential for Material Discovery Applicable to Arbitrary Combination of 45 Elements

Computational material discovery is under intense study owing to its ability to explore the vast space of chemical systems. Neural network potentials (NNPs) have been shown to be particularly effective in conducting atomistic simulations for such purposes. However, existing NNPs are generally designed for narrow target materials, making them unsuitable for broader applications in material discovery. To overcome this issue, we have developed a universal NNP called PreFerred Potential (PFP), which is able to handle any combination of 45 elements. Particular emphasis is placed on the datasets, which include a diverse set of virtual structures used to attain the universality. We demonstrated the applicability of PFP in selected domains: lithium diffusion in LiFeSO${}_4$F, molecular adsorption in metal-organic frameworks, an order-disorder transition of Cu-Au alloys, and material discovery for a Fischer-Tropsch catalyst. They showcase the power of PFP, and this technology provides a highly useful tool for material discovery.

cond-mat.mtrl-sci↗

arXiv2019

Einconv: Exploring Unexplored Tensor Network Decompositions for Convolutional Neural Networks

Tensor decomposition methods are widely used for model compression and fast inference in convolutional neural networks (CNNs). Although many decompositions are conceivable, only CP decomposition and a few others have been applied in practice, and no extensive comparisons have been made between available methods. Previous studies have not determined how many decompositions are available, nor which of them is optimal. In this study, we first characterize a decomposition class specific to CNNs by adopting a flexible graphical notation. The class includes such well-known CNN modules as depthwise separable convolution layers and bottleneck layers, but also previously unknown modules with nonlinear activations. We also experimentally compare the tradeoff between prediction accuracy and time/space complexity for modules found by enumerating all possible decompositions, or by using a neural architecture search. We find some nonlinear decompositions outperform existing ones.

cs.LG↗