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

Naoya Hasegawa

dblp:50/4841 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 3 since 2021Systems, architecture and hardware · 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
2 papers
Learning paradigms · 33% Deep learning architectures and training · 33% Trustworthy machine learning · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
long-tailed recognition
1.622025
Multiplicative Logit Adjustment Approximates Neural-Collapse-Aware Decision Boundary Adjustment · ICLR 2025
Exploring Weight Balancing on Long-Tailed Recognition Problem · ICLR 2024
Machine learning › Trustworthy machine learning
robustness
1.622025
Multiplicative Logit Adjustment Approximates Neural-Collapse-Aware Decision Boundary Adjustment · ICLR 2025
Exploring Weight Balancing on Long-Tailed Recognition Problem · ICLR 2024
Machine learning › Deep learning architectures and training › loss function design
logit adjustment
0.912025
Multiplicative Logit Adjustment Approximates Neural-Collapse-Aware Decision Boundary Adjustment · ICLR 2025
Machine learning › Deep learning architectures and training
weight balancing
0.812024
Exploring Weight Balancing on Long-Tailed Recognition Problem · ICLR 2024

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

neural collapse · 0.9multiplicative logit adjustment · 0.9decision boundary adjustment · 0.9weight decay · 0.8two-stage training · 0.8neural collapse analysis · 0.8class-balanced loss · 0.8
YearPublicationVenuePosition
2025 Multiplicative Logit Adjustment Approximates Neural-Collapse-Aware Decision Boundary Adjustment
abstract
Real-world data distributions are often highly skewed. This has spurred a growing body of research on long-tailed recognition, aimed at addressing the imbalance in training classification models. Among the methods studied, multiplicative logit adjustment (MLA) stands out as a simple and effective method. What theoretical foundation explains the effectiveness of this heuristic method? We provide a justification for the effectiveness of MLA with the following two-step process. First, we develop a theory that adjusts optimal decision boundaries by estimating feature spread on the basis of neural collapse. Second, we demonstrate that MLA approximates this optimal method. Additionally, through experiments on long-tailed datasets, we illustrate the practical usefulness of MLA under more realistic conditions. We also offer experimental insights to guide the tuning of MLA hyperparameters.
Naoya Hasegawa, Issei Sato
ICLR1
2024 Exploring Weight Balancing on Long-Tailed Recognition Problem
abstract
Recognition problems in long-tailed data, in which the sample size per class is heavily skewed, have gained importance because the distribution of the sample size per class in a dataset is generally exponential unless the sample size is intentionally adjusted. Various methods have been devised to address these problems. Recently, weight balancing, which combines well-known classical regularization techniques with two-stage training, has been proposed. Despite its simplicity, it is known for its high performance compared with existing methods devised in various ways. However, there is a lack of understanding as to why this method is effective for long-tailed data. In this study, we analyze weight balancing by focusing on neural collapse and the cone effect at each training stage and found that it can be decomposed into an increase in Fisher's discriminant ratio of the feature extractor caused by weight decay and cross entropy loss and implicit logit adjustment caused by weight decay and class-balanced loss. Our analysis enables the training method to be further simplified by reducing the number of training stages to one while increasing accuracy. Code is available at https://github.com/HN410/Exploring-Weight-Balancing-on-Long-Tailed-Recognition-Problem.
Naoya Hasegawa, Issei Sato
ICLR1
2024 Test-time Adaptation Meets Image Enhancement: Improving Accuracy via Uncertainty-aware Logit Switching
abstract
Deep neural networks have achieved remarkable success in a variety of computer vision applications. However, there is a problem of degrading accuracy when the data distribution shifts between training and testing. As a solution of this problem, Test-time Adaptation (TTA) has been well studied because of its practicality. Although TTA methods increase accuracy under distribution shift by updating the model at test time, using high-uncertainty predictions is known to degrade accuracy. Since the input image is the root of the distribution shift, we incorporate a new perspective on enhancing the input image into TTA methods to reduce the prediction’s uncertainty. We hypothesize that enhancing the input image reduces prediction’s uncertainty and increase the accuracy of TTA methods. On the basis of our hypothesis, we propose a novel method: Test-time Enhancer and Classifier Adaptation (TECA). In TECA, the classification model is combined with the image enhancement model that transforms input images into recognition-friendly ones, and these models are updated by existing TTA methods. Furthermore, we found that the prediction from the enhanced image does not always have lower uncertainty than the prediction from the original image. Thus, we propose logit switching, which compares the uncertainty measure of these predictions and outputs the lower one. In our experiments, we evaluate TECA with various TTA methods and show that TECA reduces prediction’s uncertainty and increases accuracy of TTA methods despite having no hyperparameters and little parameter overhead.
Shohei Enomoto, Naoya Hasegawa, Kazuki Adachi, Taku Sasaki, Shin'ya Yamaguchi, Takeharu Eda
IJCNN2
2001 Human Interface Using PC Display With Head Pointing Device for Eating Assist Robot and Emotional Evaluation by GSR Sensor
abstract
This paper proposes the human interface of an eating assistant robot to assist people with severe disability to gain/regain independence in eating. A spoon and a CCD camera are attached on the tip of the robotic arm. The spoon can be actuated in three orthogonal directions, and can also be rotated. The PC display indicates the image of the CCD camera and a control panel of the robot. The human interface proposed uses the PC display and a head pointing device. A user can easily control the eating assist robot by using his/her head action and a puff activated switch. This paper describes also the evaluation of user's emotion during the operation of the eating assistant robot. A galvanic skin reflex (GSR) sensor is used to detect the user's emotion. Using the experimental results of the GSR sensor, an optimal movement scheme by considering the user's emotion has been decided. The eating assistant experiments on a disabled person with cervical vertebrae damage are also described briefly.
Yoshihiko Takahashi, Naoya Hasegawa, Katsumi Takahashi, Takuro Hatakeyama
ICRA2