Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hiroaki Yamagiwa

dblp:333/0809 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Representation and self-supervised learning · 51% Information extraction and text analysis · 30% Language models and text generation · 15%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
language model analysis
0.912025
Mapping 1, 000+ Language Models via the Log-Likelihood Vector · ACL (1) 2025
Natural language and speech › Information extraction and text analysis
lexical semantics
0.912025
Quantifying Lexical Semantic Shift via Unbalanced Optimal Transport · ACL (1) 2025
Natural language and speech › Information extraction and text analysis › lexical semantics
semantic change detection
0.912025
Quantifying Lexical Semantic Shift via Unbalanced Optimal Transport · ACL (1) 2025
Machine learning › Representation and self-supervised learning › blind source separation
independent component analysis
0.812024
Understanding Higher-Order Correlations Among Semantic Components in Embeddings · EMNLP 2024
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
interpretable embedding
0.812024
Understanding Higher-Order Correlations Among Semantic Components in Embeddings · EMNLP 2024
Machine learning › Representation and self-supervised learning › word representation
word embedding
0.812024
Understanding Higher-Order Correlations Among Semantic Components in Embeddings · EMNLP 2024
Machine learning › Representation and self-supervised learning › representation analysis
embedding analysis
0.712023
Discovering Universal Geometry in Embeddings with ICA · EMNLP 2023
Information theory › information measures › divergence measures
kullback-leibler divergence
0.312025
Mapping 1, 000+ Language Models via the Log-Likelihood Vector · ACL (1) 2025
Machine learning › Trustworthy machine learning › interpretability › explainable AI
interpretable representation
0.212023
Discovering Universal Geometry in Embeddings with ICA · EMNLP 2023

Methods — techniques the papers use, named apart from their topics

log-likelihood vector · 1.7independent component analysis · 1.4unbalanced optimal transport · 0.9contextualized word embeddings · 0.9higher-order correlation analysis · 0.8principal component analysis · 0.7
YearPublicationVenuePosition
2025 Quantifying Lexical Semantic Shift via Unbalanced Optimal Transport
abstract
Lexical semantic change detection aims to identify shifts in word meanings over time. While existing methods using embeddings from a diachronic corpus pair estimate the degree of change for target words, they offer limited insight into changes at the level of individual usage instances. To address this, we apply Unbalanced Optimal Transport (UOT) to sets of contextualized word embeddings, capturing semantic change through the excess and deficit in the alignment between usage instances. In particular, we propose Sense Usage Shift (SUS), a measure that quantifies changes in the usage frequency of a word sense at each usage instance. By leveraging SUS, we demonstrate that several challenges in semantic change detection can be addressed in a unified manner, including quantifying instance-level semantic change and word-level tasks such as measuring the magnitude of semantic change and the broadening or narrowing of meaning.
Ryo Kishino, Hiroaki Yamagiwa, Ryo Nagata, Sho Yokoi, Hidetoshi Shimodaira
ACL (1)2
2025 Mapping 1, 000+ Language Models via the Log-Likelihood Vector
abstract
To compare autoregressive language models at scale, we propose using log-likelihood vectors computed on a predefined text set as model features.This approach has a solid theoretical basis: when treated as model coordinates, their squared Euclidean distance approximates the Kullback-Leibler divergence of text-generation probabilities.Our method is highly scalable, with computational cost growing linearly in both the number of models and text samples, and is easy to implement as the required features are derived from cross-entropy loss.Applying this method to over 1,000 language models, we constructed a "model map," providing a new perspective on large-scale model analysis. CodeLlama-7b-Instruct-hf deepseek-coder-1.3b-base Mistral-7B-v0.
Momose Oyama, Hiroaki Yamagiwa, Yusuke Takase, Hidetoshi Shimodaira
ACL (1)2
2025 Revisiting Cosine Similarity via Normalized ICA-transformed Embeddings
abstract
Cosine similarity is widely used to measure the similarity between two embeddings, while interpretations based on angle and correlation coefficient are common. In this study, we focus on the interpretable axes of embeddings transformed by Independent Component Analysis (ICA), and propose a novel interpretation of cosine similarity as the sum of semantic similarities over axes. The normalized ICA-transformed embeddings exhibit sparsity, enhancing the interpretability of each axis, and the semantic similarity defined by the product of the components represents the shared meaning between the two embeddings along each axis. The effectiveness of this approach is demonstrated through intuitive numerical examples and thorough numerical experiments. By deriving the probability distributions that govern each component and the product of components, we propose a method for selecting statistically significant axes.
Hiroaki Yamagiwa, Momose Oyama, Hidetoshi Shimodaira
COLING1
2025 Norm of Mean Contextualized Embeddings Determines their Variance
abstract
Contextualized embeddings vary by context, even for the same token, and form a distribution in the embedding space. To analyze this distribution, we focus on the norm of the mean embedding and the variance of the embeddings. In this study, we first demonstrate that these values follow the well-known formula for variance in statistics and provide an efficient sequential computation method. Then, by observing embeddings from intermediate layers of several Transformer models, we found a strong trade-off relationship between the norm and the variance: as the mean embedding becomes closer to the origin, the variance increases. Furthermore, when the sets of token embeddings are treated as clusters, we show that the variance of the entire embedding set can theoretically be decomposed into the within-cluster variance and the between-cluster variance. We found experimentally that as the layers of Transformer models deepen, the embeddings move farther from the origin, the between-cluster variance relatively decreases, and the within-cluster variance relatively increases. These results are consistent with existing studies on the anisotropy of the embedding spaces across layers.
Hiroaki Yamagiwa, Hidetoshi Shimodaira
COLING1
2024 Understanding Higher-Order Correlations Among Semantic Components in Embeddings
abstract
Independent Component Analysis (ICA) offers interpretable semantic components of embeddings.While ICA theory assumes that embeddings can be linearly decomposed into independent components, real-world data often do not satisfy this assumption.Consequently, non-independencies remain between the estimated components, which ICA cannot eliminate.We quantified these non-independencies using higher-order correlations and demonstrated that when the higher-order correlation between two components is large, it indicates a strong semantic association between them, along with many words sharing common meanings with both components.The entire structure of non-independencies was visualized using a maximum spanning tree of semantic components.These findings provide deeper insights into embeddings through ICA.
Momose Oyama, Hiroaki Yamagiwa, Hidetoshi Shimodaira
EMNLP2
2023 Discovering Universal Geometry in Embeddings with ICA
abstract
This study utilizes Independent Component Analysis (ICA) to unveil a consistent semantic structure within embeddings of words or images. Our approach extracts independent semantic components from the embeddings of a pre-trained model by leveraging anisotropic information that remains after the whitening process in Principal Component Analysis (PCA). We demonstrate that each embedding can be expressed as a composition of a few intrinsic interpretable axes and that these semantic axes remain consistent across different languages, algorithms, and modalities. The discovery of a universal semantic structure in the geometric patterns of embeddings enhances our understanding of the representations in embeddings.
Hiroaki Yamagiwa, Momose Oyama, Hidetoshi Shimodaira
EMNLP1