Yuki Saito 0002

dblp:36/7818-2 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
6since 2021 · last 2025
0000-0003-0492-414XORCID · conflict

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

Artificial intelligence and machine learning · 6 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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
5 papers
Trustworthy machine learning · 32% Transfer learning and domain adaptation · 22% Representation and self-supervised learning · 14%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 77% Information retrieval · 23%

Topics — the 11 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
explanation generation
0.912025
Disentangling Likes and Dislikes in Personalized Generative Explainable Recommendation · WWW 2025
Machine learning › Trustworthy machine learning › interpretability › attribution methods
feature attribution
0.912025
Explaining Black-box Model Predictions via Two-level Nested Feature Attributions with Consistency Property · IJCAI 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Explaining Black-box Model Predictions via Two-level Nested Feature Attributions with Consistency Property · IJCAI 2025
Machine learning › Trustworthy machine learning › interpretability
local explanation
0.912025
Explaining Black-box Model Predictions via Two-level Nested Feature Attributions with Consistency Property · IJCAI 2025
Machine learning › Efficient and distributed learning
model merging
0.912025
Mastering Task Arithmetic: τJp as a Key Indicator for Weight Disentanglement · ICLR 2025
Machine learning › Transfer learning and domain adaptation › parameter-based transfer learning
task arithmetic
0.912025
Mastering Task Arithmetic: τJp as a Key Indicator for Weight Disentanglement · ICLR 2025
Machine learning › Transfer learning and domain adaptation
weight disentanglement
0.912025
Mastering Task Arithmetic: τJp as a Key Indicator for Weight Disentanglement · ICLR 2025
Machine learning › Representation and self-supervised learning › word representation
word embedding
0.912025
Static Word Embeddings for Sentence Semantic Representation · EMNLP 2025
Recommender systems
explainable recommendation
0.912025
Disentangling Likes and Dislikes in Personalized Generative Explainable Recommendation · WWW 2025
Computer vision › Image recognition and object detection
set matching
0.412020
Exchangeable Deep Neural Networks for Set-to-Set Matching and Learning · ECCV (17) 2020
Machine learning › Representation and self-supervised learning › text embedding
sentence embedding
0.312025
Static Word Embeddings for Sentence Semantic Representation · EMNLP 2025

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

text generation · 1.7LLM-based opinion extraction · 1.7task arithmetic · 0.9principal component analysis · 0.9nested feature attribution · 0.9knowledge distillation · 0.9contrastive learning · 0.9consistency optimization · 0.9exchangeable deep neural networks · 0.4
YearPublicationVenuePosition
2025 Static Word Embeddings for Sentence Semantic Representation
abstract
We 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
EMNLP5
2025 Mastering Task Arithmetic: τJp as a Key Indicator for Weight Disentanglement
Kotaro Yoshida, Yuji Naraki, Takafumi Horie, Ryosuke Yamaki, Ryotaro Shimizu, Yuki Saito 0002, Julian J. McAuley, Hiroki Naganuma
ICLR6
2025 Explaining Black-box Model Predictions via Two-level Nested Feature Attributions with Consistency Property
abstract
Techniques that explain the predictions of black-box machine learning models are crucial to make the models transparent, thereby increasing trust in AI systems. The input features to the models often have a nested structure that consists of high- and low-level features, and each high-level feature is decomposed into multiple low-level features. For such inputs, both high-level feature attributions (HiFAs) and low-level feature attributions (LoFAs) are important for better understanding the model's decision. In this paper, we propose a model-agnostic local explanation method that effectively exploits the nested structure of the input to estimate the two-level feature attributions simultaneously. A key idea of the proposed method is to introduce the consistency property that should exist between the HiFAs and LoFAs, thereby bridging the separate optimization problems for estimating them. Thanks to this consistency property, the proposed method can produce HiFAs and LoFAs that are both faithful to the black-box models and consistent with each other, using a smaller number of queries to the models. In experiments on image classification in multiple instance learning and text classification using language models, we demonstrate that the HiFAs and LoFAs estimated by the proposed method are accurate, faithful to the behaviors of the black-box models, and provide consistent explanations.
Yuya Yoshikawa, Masanari Kimura, Ryotaro Shimizu, Yuki Saito 0002
IJCAI4
2025 Disentangling Likes and Dislikes in Personalized Generative Explainable Recommendation
abstract
Recent research on explainable recommendation generally frames the task as a standard text generation problem, and evaluates models simply based on the textual similarity between the predicted and ground-truth explanations. However, this approach fails to consider one crucial aspect of the systems: whether their outputs accurately reflect the users' (post-purchase) sentiments, i.e., whether and why they would like and/or dislike the recommended items. To shed light on this issue, we introduce new datasets and evaluation methods that focus on the users' sentiments. Specifically, we construct the datasets by explicitly extracting users' positive and negative opinions from their post-purchase reviews using an LLM, and propose to evaluate systems based on whether the generated explanations 1) align well with the users' sentiments, and 2) accurately identify both positive and negative opinions of users on the target items. We benchmark several recent models on our datasets and demonstrate that achieving strong performance on existing metrics does not ensure that the generated explanations align well with the users' sentiments. Lastly, we find that existing models can provide more sentiment-aware explanations when the users' (predicted) ratings for the target items are directly fed into the models as input. The datasets and benchmark implementation are available at: https://github.com/jchanxtarov/sent_xrec.
Ryotaro Shimizu, Takashi Wada 0001, Yu Wang 0170, Johannes Kruse 0002, Sean O'Brien, Sai Htaung Kham, Linxin Song, Yuya Yoshikawa, Yuki Saito 0002, Fugee Tsung, Masayuki Goto, Julian J. McAuley
WWW9
2024 Set representative vector and its asymmetric attention-based transformation for heterogeneous set-to-set matching
Hirotaka Hachiya, Yuki Saito 0002
Neurocomputing2
2023 Fashion intelligence system: An outfit interpretation utilizing images and rich abstract tags
abstract
In recent years, it has become common for consumers to familiarize themselves with the latest fashion trends through the internet and engage in their own fashion-inspired shopping activities. Therefore, making fashion-inspired shopping and browsing activities (internet surfing in the fashion domain) comfortable is essential because it leads to interactions in the fashion industry. However, fashion is a fuzzy and complex domain that contains many abstract elements, and this ambiguity and complexity can hinder users’ deep interest in the fashion industry. Therefore, we define a novel technology and domain called “fashion intelligence” and propose a system based on a visual-semantic embedding method for automatically learning and interpreting fashion and obtaining answers to users’ questions. Our proposed method can embed the abundant abstract tag information in the same projective space as outfit images. Mapping of images and tags in a projective space helps search for outfit images using fashion-specific abstract words. In addition, visually estimating the degree of relevance between images and tags helps interpret abstract words. As a result, this research helps decrease fashion-specific ambiguity and complexity and supports the marketing activities and fashion choices of both experts and non-experts.
Ryotaro Shimizu, Yuki Saito 0002, Megumi Matsutani, Masayuki Goto
Expert Syst. Appl.2
2020 Exchangeable Deep Neural Networks for Set-to-Set Matching and Learning
Yuki Saito 0002, Takuma Nakamura, Hirotaka Hachiya, Kenji Fukumizu
ECCV (17)1
2018 2.5D Faster R-CNN for Distance Estimation
abstract
Estimating the distance of a target object from a single image is a challenging task since a large variation in the object appearance makes the regression of the distance difficult. In this paper, to tackle such the challenge, we propose 2.5D anchors which provide good candidates of distances, based on a perspective camera model. This candidate is expected to relax the difficulty of the regression model since only the residual from the candidate distance needs to be taken into account. We show the effectiveness of our proposed anchors, by comparing with ordinary regression methods, through experiments with Pascal 3D+ TV monitor dataset and Tsukuba challenge task.
Hirotaka Hachiya, Yuki Saito 0002, Kazuma Iteya, Masaya Nomura, Takayuki Nakamura
SMC2