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

Hayoung Yun

dblp:366/2265 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 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
1 paper
Learning paradigms · 34% Optimization for machine learning · 34% Image recognition and object detection · 10%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
multi-task learning
0.712023
Achievement-based Training Progress Balancing for Multi-Task Learning · ICCV 2023
Machine learning › Optimization for machine learning › multi-task optimization
task balancing
0.712023
Achievement-based Training Progress Balancing for Multi-Task Learning · ICCV 2023
Computer vision › 3D vision
depth estimation
0.212023
Achievement-based Training Progress Balancing for Multi-Task Learning · ICCV 2023
Computer vision › Image recognition and object detection
object detection
0.212023
Achievement-based Training Progress Balancing for Multi-Task Learning · ICCV 2023
Computer vision › Segmentation and scene understanding
semantic segmentation
0.212023
Achievement-based Training Progress Balancing for Multi-Task Learning · ICCV 2023

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

geometric mean loss · 0.7achievement-based loss weighting · 0.7
YearPublicationVenuePosition
2023 Achievement-based Training Progress Balancing for Multi-Task Learning
abstract
Multi-task learning faces two challenging issues: (1) the high cost of annotating labels for all tasks and (2) balancing the training progress of various tasks with different natures. To resolve the label annotation issue, we construct a large-scale "partially annotated" multi-task dataset by combining task-specific datasets. However, the numbers of annotations for individual tasks are imbalanced, which may escalate an imbalance in training progress. To balance the training progress, we propose an achievement-based multi-task loss to modulate training speed based on the "achievement," defined as the ratio of current accuracy to single-task accuracy. Then, we formulate the multitask loss as a weighted geometric mean of individual task losses instead of a weighted sum to prevent any task from dominating the loss. In experiments, we evaluated the accuracy and training speed of the proposed multi-task loss on the large-scale multi-task dataset against recent multitask losses. The proposed loss achieved the best multi-task accuracy without incurring training time overhead. Compared to single-task models, the proposed one achieved 1.28%, 1.65%, and 1.18% accuracy improvement in object detection, semantic segmentation, and depth estimation, respectively, while reducing computations to 33.73%. Source code is available at https://github.com/samsung/Achievement-based-MTL.
Hayoung Yun, Hanjoo Cho
ICCV1