Demo Data from EDBT 2026 / reviewers in the wild / expert
Yuki Hirakawa
dblp:165/3654
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1
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
1 paper |
Representation and self-supervised learning · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 77% Performance modeling and evaluation · 23% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › word representation
word embedding |
0.9 | 1 | 2025 | Static Word Embeddings for Sentence Semantic Representation · EMNLP 2025 |
Machine learning › Representation and self-supervised learning › text embedding
sentence embedding |
0.3 | 1 | 2025 | Static Word Embeddings for Sentence Semantic Representation · EMNLP 2025 |
Programming languages and type systems › programming paradigms
nonprocedural language |
0.0 | 1 | 1987 | A Prototype Switching System Employing a Matching-Based Language · IEEE Trans. Commun. 1987 |
Methods — techniques the papers use, named apart from their topics
principal component analysis · 0.9knowledge distillation · 0.9contrastive learning · 0.9matching-based language · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Static Word Embeddings for Sentence Semantic RepresentationabstractWe propose new static word embeddings optimised for sentence semantic representation.We first extract word embeddings from a pretrained Sentence Transformer, and improve them with sentence-level principal component analysis, followed by either knowledge distillation or contrastive learning.During inference, we represent sentences by simply averaging word embeddings, which requires little computational cost.We evaluate models on both monolingual and cross-lingual tasks and show that our model substantially outperforms existing static models on sentence semantic tasks, and even surpasses a basic Sentence Transformer model (SimCSE) on a text embedding benchmark.Lastly, we perform a variety of analyses and show that our method successfully removes word embedding components that are not highly relevant to sentence semantics, and adjusts the vector norms based on the influence of words on sentence semantics. Takashi Wada 0001, Yuki Hirakawa, Ryotaro Shimizu, Takahiro Kawashima, Yuki Saito 0002 |
EMNLP | 2 |
| 1988 | Extensible packaged architecture
Yuki Hirakawa, Nobuo Kawashima, M. Imase |
Microprocess. Microprogramming | 1 |
| 1987 | A Prototype Switching System Employing a Matching-Based LanguageabstractThis paper describes an experimental switching system employing a nonprocedural language. It presents a study of the appropriate architecture for implementing the language, and examines the system's performance characteristics. Furthermore, it identifies the critical part of the architecture, and provides two strategies for throughput improvement and indicates their effects. Nobuo Kawashima, Yuki Hirakawa |
IEEE Trans. Commun. | 2 |