SearcharxivSearch

arXiv subjects

Kosuke Nakago

Publications and source records attributed to Kosuke Nakago.

7 recordsLinked to original sources

EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements

Large Language Models (LLMs) have made remarkable progress, surpassing human performance on several benchmarks in domains such as mathematics and coding. A key driver of this progress has been the development of benchmark datasets. In contrast, the financial domain poses higher entry barriers due to its demand for specialized expertise, and benchmarks remain relatively scarce compared to those in mathematics or coding. We introduce EDINET-Bench, an open-source Japanese financial benchmark designed to evaluate LLMs on challenging tasks such as accounting fraud detection, earnings forecasting, and industry classification. EDINET-Bench is constructed from ten years of annual reports filed by Japanese companies. These tasks require models to process entire annual reports and integrate information across multiple tables and textual sections, demanding expert-level reasoning that is challenging even for human professionals. Our experiments show that even state-of-the-art LLMs struggle in this domain, performing only marginally better than logistic regression in binary classification tasks such as fraud detection and earnings forecasting. Our results show that simply providing reports to LLMs in a straightforward setting is not enough. This highlights the need for benchmark frameworks that better reflect the environments in which financial professionals operate, with richer scaffolding such as realistic simulations and task-specific reasoning support to enable more effective problem solving. We make our dataset and code publicly available to support future research.

q-fin.ST

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

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

Calculations of Real-System Nanoparticles Using Universal Neural Network Potential PFP

It is essential to explore the stability and activity of real-system nanoparticles theoretically. While applications of theoretical methods for this purpose can be found in literature, the expensive computational costs of conventional theoretical methods hinder their massive applications to practical materials design. With the recent development of neural network algorithms along with the advancement of computer systems, neural network potentials have emerged as a promising candidate for the description of a wide range of materials, including metals and molecules, with a reasonable computational time. In this study, we successfully validate a universal neural network potential, PFP, for the description of monometallic Ru nanoparticles, PdRuCu ternary alloy nanoparticles, and the NO adsorption on Rh nanoparticles against first-principles calculations. We further conduct molecular dynamics simulations on the NO-Rh system and challenge the PFP to describe a large, supported Pt nanoparticle system.

cond-mat.mtrl-sci

GraphNVP: An Invertible Flow Model for Generating Molecular Graphs

We propose GraphNVP, the first invertible, normalizing flow-based molecular graph generation model. We decompose the generation of a graph into two steps: generation of (i) an adjacency tensor and (ii) node attributes. This decomposition yields the exact likelihood maximization on graph-structured data, combined with two novel reversible flows. We empirically demonstrate that our model efficiently generates valid molecular graphs with almost no duplicated molecules. In addition, we observe that the learned latent space can be used to generate molecules with desired chemical properties.

stat.ML

BayesGrad: Explaining Predictions of Graph Convolutional Networks

Recent advances in graph convolutional networks have significantly improved the performance of chemical predictions, raising a new research question: "how do we explain the predictions of graph convolutional networks?" A possible approach to answer this question is to visualize evidence substructures responsible for the predictions. For chemical property prediction tasks, the sample size of the training data is often small and/or a label imbalance problem occurs, where a few samples belong to a single class and the majority of samples belong to the other classes. This can lead to uncertainty related to the learned parameters of the machine learning model. To address this uncertainty, we propose BayesGrad, utilizing the Bayesian predictive distribution, to define the importance of each node in an input graph, which is computed efficiently using the dropout technique. We demonstrate that BayesGrad successfully visualizes the substructures responsible for the label prediction in the artificial experiment, even when the sample size is small. Furthermore, we use a real dataset to evaluate the effectiveness of the visualization. The basic idea of BayesGrad is not limited to graph-structured data and can be applied to other data types.

cs.LG

Parallelizable adiabatic gate teleportation

We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of $L$ unitary gates increases at most as $O(L^5)$. However, we show that it has the interesting property that it can map the temporal order of gates to the spatial order of interactions specified by the final Hamiltonian. Using this property, we present a controlled-PAGT scheme to manipulate the order of gates by a control-qubit. In the controlled-PAGT scheme, two differently ordered sequential unitary gates $FG$ and $GF$ are coherently performed depending on the state of a control-qubit by simultaneously applying the twisted Heisenberg-type interaction Hamiltonians implementing unitary gates $F$ and $G$. We investigate why the twisted Heisenberg-type interaction Hamiltonian allows PAGT. We show that the twisted Heisenberg-type interaction Hamiltonian has an ability to perform a transposed unitary gate by just modifying the space ordering of the final Hamiltonian implementing a unitary gate in adiabatic gate teleportation. The dynamics generated by the time-reversed Hamiltonian represented by the transposed unitary gate enables deterministic simulation of a postselected event of parallelized gate teleportation in adiabatic implementation.

quant-ph