SearcharxivSearch

arXiv subjects

Hiroaki Yamada

Publications and source records attributed to Hiroaki Yamada.

At least 19 recordsLinked to original sources

Relation Geometry in Semantic Space of Language Models

When it comes to generating vector representations of words, current language models are achieving high-quality results. However, what is not known is the extent to which knowledge about semantic relations is represented in the geometry of the semantic spaces created in this way. In order to answer this question, we study the relation geometry of such semantic spaces from three perspectives. We first examine whether words standing in a particular relation to a target word~(called relata) occupy the same region in semantic space, and whether the regions corresponding to different relations are distinct from each other. We then verify to what extent semantic spaces reflect certain well-known properties of relations, such as symmetry, asymmetry, and transitivity. Finally, we consider which information about the target words and relata is more important for relation geometry: their surface forms, or their contexts. We conduct experiments on six semantic relations using causal, masked, and diffusion language models. The results show that relata in asymmetric relations relatively clearly occupy a distinct region in semantic space. Asymmetric relations' properties are only moderately well encoded in the semantic space, yet better than those of symmetric ones. Furthermore, when considering the question which information source has the strongest impact on results amongst the models we evaluated, we find that lexical information tends to be more important for the causal language model, whereas contextual information is more important for the masked and diffusion language models. Our results empirically show that relation geometry is not equally well-represented for all relations in semantic space, suggesting that there is a difference in how well semantic relations might be learned from distributional information alone.

cs.CL

Expert Evaluation of LLM's Open-Ended Legal Reasoning on the Japanese Bar Exam Writing Task

Large language models (LLMs) have shown strong performance on legal benchmarks, including multiple-choice components of bar exams. However, their capacity for generating open-ended legal reasoning in realistic scenarios remains insufficiently explored. Notably, to our best knowledge, there are no prior studies or datasets addressing this issue in the Japanese context. This study presents the first dataset designed to evaluate the open-ended legal reasoning performance of LLMs within the Japanese jurisdiction. The dataset is based on the writing component of the Japanese bar examination, which requires examinees to identify multiple legal issues from long narratives and to construct structured legal arguments in free text format. Our key contribution is the manual evaluation of LLMs' generated responses by legal experts, which reveals limitations and challenges in legal reasoning. Moreover, we conducted a manual analysis of hallucinations to characterize when and how the models introduce content not supported by precedent or law. Our real exam questions, model-generated responses, and expert evaluations reveal the milestones of current LLMs in the Japanese legal domain. Our dataset and relevant resources will be available online.

cs.AI

RAG System for Supporting Japanese Litigation Procedures: Faithful Response Generation Complying with Legal Norms

This study discusses the essential components that a Retrieval-Augmented Generation (RAG)-based LLM system should possess in order to support Japanese medical litigation procedures complying with legal norms. In litigation, expert commissioners, such as physicians, architects, accountants, and engineers, provide specialized knowledge to help judges clarify points of dispute. When considering the substitution of these expert roles with a RAG-based LLM system, the constraint of strict adherence to legal norms is imposed. Specifically, three requirements arise: (1) the retrieval module must retrieve appropriate external knowledge relevant to the disputed issues in accordance with the principle prohibiting the use of private knowledge, (2) the responses generated must originate from the context provided by the RAG and remain faithful to that context, and (3) the retrieval module must reference external knowledge with appropriate timestamps corresponding to the issues at hand. This paper discusses the design of a RAG-based LLM system that satisfies these requirements.

cs.CL

JBE-QA: Japanese Bar Exam QA Dataset for Assessing Legal Domain Knowledge

We introduce JBE-QA, a Japanese Bar Exam Question-Answering dataset to evaluate large language models' legal knowledge. Derived from the multiple-choice (tanto-shiki) section of the Japanese bar exam (2015-2024), JBE-QA provides the first comprehensive benchmark for Japanese legal-domain evaluation of LLMs. It covers the Civil Code, the Penal Code, and the Constitution, extending beyond the Civil Code focus of prior Japanese resources. Each question is decomposed into independent true/false judgments with structured contextual fields. The dataset contains 3,464 items with balanced labels. We evaluate 26 LLMs, including proprietary, open-weight, Japanese-specialised, and reasoning models. Our results show that proprietary models with reasoning enabled perform best, and the Constitution questions are generally easier than the Civil Code or the Penal Code questions.

cs.CL

Augmenting Dialog with Think-Aloud Utterances for Modeling Individual Personality Traits by LLM

This study proposes augmenting dialog data with think-aloud utterances (TAUs) for modeling individual personalities in text chat by LLM. TAU is a verbalization of a speaker's thought before articulating the utterance. We expect "persona LLMs" trained with TAU-augmented data can mimic the speaker's personality trait better. We tested whether the trained persona LLMs obtain the human personality with respect to Big Five, a framework characterizing human personality traits from five aspects. The results showed that LLMs trained with TAU-augmented data more closely align to the speakers' Agreeableness and Neuroticism of Big Five than those trained with original dialog data. We also found that the quality of TAU-augmentation impacts persona LLM's performance.

cs.CL

On the Distinctive Co-occurrence Characteristics of Antonymy

Antonymy has long received particular attention in lexical semantics. Previous studies have shown that antonym pairs frequently co-occur in text, across genres and parts of speech, more often than would be expected by chance. However, whether this co-occurrence pattern is distinctive of antonymy remains unclear, due to a lack of comparison with other semantic relations. This work fills the gap by comparing antonymy with three other relations across parts of speech using robust co-occurrence metrics. We find that antonymy is distinctive in three respects: antonym pairs co-occur with high strength, in a preferred linear order, and within short spans. All results are available online.

cs.CL

A Comprehensive Evaluation of Semantic Relation Knowledge of Pretrained Language Models and Humans

Recently, much work has concerned itself with the enigma of what exactly pretrained language models~(PLMs) learn about different aspects of language, and how they learn it. One stream of this type of research investigates the knowledge that PLMs have about semantic relations. However, many aspects of semantic relations were left unexplored. Generally, only one relation has been considered, namely hypernymy. Furthermore, previous work did not measure humans' performance on the same task as that performed by the PLMs. This means that at this point in time, there is only an incomplete view of the extent of these models' semantic relation knowledge. To address this gap, we introduce a comprehensive evaluation framework covering five relations beyond hypernymy, namely hyponymy, holonymy, meronymy, antonymy, and synonymy. We use five metrics (two newly introduced here) for recently untreated aspects of semantic relation knowledge, namely soundness, completeness, symmetry, prototypicality, and distinguishability. Using these, we can fairly compare humans and models on the same task. Our extensive experiments involve six PLMs, four masked and two causal language models. The results reveal a significant knowledge gap between humans and models for all semantic relations. In general, causal language models, despite their wide use, do not always perform significantly better than masked language models. Antonymy is the outlier relation where all models perform reasonably well. The evaluation materials can be found at https://github.com/hancules/ProbeResponses.

cs.CL

Misalignment of Semantic Relation Knowledge between WordNet and Human Intuition

WordNet provides a carefully constructed repository of semantic relations, created by specialists. But there is another source of information on semantic relations, the intuition of language users. We present the first systematic study of the degree to which these two sources are aligned. Investigating the cases of misalignment could make proper use of WordNet and facilitate its improvement. Our analysis which uses templates to elicit responses from human participants, reveals a general misalignment of semantic relation knowledge between WordNet and human intuition. Further analyses find a systematic pattern of mismatch among synonymy and taxonomic relations~(hypernymy and hyponymy), together with the fact that WordNet path length does not serve as a reliable indicator of human intuition regarding hypernymy or hyponymy relations.

cs.CL

Japanese Tort-case Dataset for Rationale-supported Legal Judgment Prediction

This paper presents the first dataset for Japanese Legal Judgment Prediction (LJP), the Japanese Tort-case Dataset (JTD), which features two tasks: tort prediction and its rationale extraction. The rationale extraction task identifies the court's accepting arguments from alleged arguments by plaintiffs and defendants, which is a novel task in the field. JTD is constructed based on annotated 3,477 Japanese Civil Code judgments by 41 legal experts, resulting in 7,978 instances with 59,697 of their alleged arguments from the involved parties. Our baseline experiments show the feasibility of the proposed two tasks, and our error analysis by legal experts identifies sources of errors and suggests future directions of the LJP research.

cs.CL

GPTs and Language Barrier: A Cross-Lingual Legal QA Examination

In this paper, we explore the application of Generative Pre-trained Transformers (GPTs) in cross-lingual legal Question-Answering (QA) systems using the COLIEE Task 4 dataset. In the COLIEE Task 4, given a statement and a set of related legal articles that serve as context, the objective is to determine whether the statement is legally valid, i.e., if it can be inferred from the provided contextual articles or not, which is also known as an entailment task. By benchmarking four different combinations of English and Japanese prompts and data, we provide valuable insights into GPTs' performance in multilingual legal QA scenarios, contributing to the development of more efficient and accurate cross-lingual QA solutions in the legal domain.

cs.CL

Dynamic Sasvi: Strong Safe Screening for Norm-Regularized Least Squares

A recently introduced technique for a sparse optimization problem called "safe screening" allows us to identify irrelevant variables in the early stage of optimization. In this paper, we first propose a flexible framework for safe screening based on the Fenchel-Rockafellar duality and then derive a strong safe screening rule for norm-regularized least squares by the framework. We call the proposed screening rule for norm-regularized least squares "dynamic Sasvi" because it can be interpreted as a generalization of Sasvi. Unlike the original Sasvi, it does not require the exact solution of a more strongly regularized problem; hence, it works safely in practice. We show that our screening rule can eliminate more features and increase the speed of the solver in comparison with other screening rules both theoretically and experimentally.

stat.ML

Nodal-line semimetal superlattices

Spatial modulations, such as multilayers, to realize topological materials have recently been studied in theoretical and experimental works. In this paper, we investigate properties of the multilayers of the nodal-line semimetal (NLS) and the normal insulator. We consider two types of multilayers, with the stacking direction being perpendicular or parallel to the plane where the nodal line lies. In particular, we show that when the stacking direction is parallel to the plane, the nodal lines remain but they change their shapes because of the folding of the Brillouin zone. We also study the multilayers with magnetization. One can expect that the quantum anomalous Hall (QAH) phase emerges in some cases, depending on the direction of the magnetization. If the magnetization is along the $C_2$-invariant axis, the multilayer becomes the Weyl semimetal phase if the $C_2$-invariant axis intersects the nodal lines, and otherwise it becomes the QAH phases.

cond-mat.mes-hall

Some Effective Tight-Binding Models for Electrons in DNA Conduction: A Review

Quantum transport for DNA conduction has widely studied with interest in application as a candidate in making nanowires as well as interest in the scientific mechanism. In this paper, we review recent works with concerning the electronic states and the conduction/transfer in DNA polymers. We have mainly investigated the energy band structure and the correlation effects of localization property in the two- and three-chain systems (ladder model) with long-range correlation as a simple model for electronic property in a double strand of DNA by using the tight-binding model. In addition, we investigated the localization properties of electronic states in several actual DNA sequences such as bacteriophages of Escherichia coli, human-chromosome 22, compared with those of the artificial disordered sequences with correlation. The charge transfer properties for poly(dA)-poly(dT) and poly(dG)-poly(dC) DNA polymers are also presented in terms of localization lengths within the frameworks of the polaron models due to the coupling between the charge carriers and the lattice vibrations of the double strand of DNA.

cond-mat.dis-nn

General Connectivity Distribution Functions for Growing Networks with Preferential Attachment of Fractional Power

We study the general connectivity distribution functions for growing networks with preferential attachment of fractional power, $Π_{i} \propto k^α$, using the Simon's method. We first show that the heart of the previously known methods of the rate equations for the connectivity distribution functions is nothing but the Simon's method for word problem. Secondly, we show that the case of fractional $α$ the $Z$-transformation of the rate equation provides a fractional differential equation of new type, which coincides with that for PA with linear power, when $α= 1$. We show that to solve such a fractional differential equation we need define a transidental function $Υ(a,s,c;z)$ that we call {\it upsilon function}. Most of all previously known results are obtained consistently in the frame work of a unified theory.

cond-mat.stat-mech

Controllability of Wavepacket Dynamics in Coherently Driven Double-Well Potential

We numerically study the controllability of quantum dynamics in perturbed one-dimensional double-well potential by using an optimal control theory. As the perturbation strength is small the dynamics of the initially localized aussian wavepacket in the right well shows coherent oscillation between the wells like a behavior of instanton. It was found that as the increase of the strength and/or the number of frequency components of the perturbation the coherent motion changes the irregular one with irreversible delocalization of the wavepacket. We investigate the controllability of the system depending on the perturbation parameters and the initial state by focusing mainly on the delocalized state generated in the polychromatically perturbed system. In the relatively long-time control for the Gaussian wavepacket and the delocalized state, we show that it is well-controllable via the first excited state doublet in spite of the perturbation parameters. On the other hand, in the relatively shor-time control we show the difficulty of the control for the delocalized state because of the numerous local minima. Furthermore, it is demonstrated that chaotic phase space structure of the system assists the controllability of the delocalized state.

cond-mat.other

Rugged Fitness Landscapes of Kauffman Model with a Scale-Free Network

We study the nature of fitness landscapes of 'quenched' Kauffman's Boolean model with a scale-free network. We have numerically calculated the rugged fitness landscapes, the distributions, its tails, and the correlation between the fitness of local optima and their Hamming distance from the highest optimum found, respectively. We have found that (a) there is an interesting difference between the random and the scale-free networks such that the statistics of the rugged fitness landscapes is Gaussian for the random network while it is non-Gaussian with a tail for the scale-free network; (b) as the average degree $ $ increases, there is a phase transition at the critical value of $ = < k >_{c} = 2$, below which there is a global order and above which the order goes away.

cond-mat.stat-mech

Vibrational modes and spectrum of oscillators on a scale-free network

We study vibrational modes and spectrum of a model system of atoms and springs on a scale-free network in order to understand the nature of excitations with many degrees of freedom on the scale-free network. We assume that the atoms and springs are distributed as nodes and links of a scale-free network, assigning the mass $M_{i}$ and the specific oscillation frequency $ω_{i}$ of the $i$-th atom and the spring constant $K_{ij}$ between the $i$-th and $j$-th atoms.

cond-mat.stat-mech

Localization of Electronic States in Chain Model Based on Real DNA Sequence

We investigate the localization property of an electron in the disordered two-chain system (ladder model) with long-range correlation as a simple model for electronic property in DNA sequence. The chains are constructed by repetition of the sugar-phosphate sites, and the inter-chain hopping at the sugar sites come from nucleotide pairs, i.e., $A-T$ or $G-C$ pairs. It has been found that some DNA sequences have long-range correlation. In this paper we use some actual DNA sequences such as bacteriophages of escherichia coli, human omosome 22 and histone protein as the correlated sequence for the interchain hopping at the sugar sites. We will present some numerical results for the Lyapunov exponent (inverse localization length) of the wave function in the cases in comparison to the results for artificial sequence generated by an asymmetric modified Bernoulli map. It is shown that the correlation and asymmetry of the sequence affect on the localization in both the artificial and real DNA sequences.

cond-mat.dis-nn