Arseny Kuznetsov

dblp:218/5305 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
Optimization for machine learning · 67% Learning paradigms · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
gradient conflict resolution
0.712023
Independent Component Alignment for Multi-Task Learning · CVPR 2023
Machine learning › Learning paradigms
multi-task learning
0.712023
Independent Component Alignment for Multi-Task Learning · CVPR 2023
Machine learning › Optimization for machine learning
multi-task optimization
0.712023
Independent Component Alignment for Multi-Task Learning · CVPR 2023

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

gradient alignment · 0.7condition number analysis · 0.7
YearPublicationVenuePosition
2023 Independent Component Alignment for Multi-Task Learning
abstract
In a multi-task learning (MTL) setting, a single model is trained to tackle a diverse set of tasks Jointly. Despite rapid progress in the field, MTL remains challenging due to optimization issues such as conflicting and dominating gradients. In this work, we propose using a condition number of a linear system of gradients as a stability criterion of an MTL optimization. We theoretically demonstrate that a condition number reflects the afore-mentioned optimization issues. Accordingly, we present Aligned-MTL, a novel MTL optimization approach based on the proposed criterion, that eliminates instability in the training process by aligning the orthogonal components of the linear system of gradients. While many recent MTL approaches guaran-tee convergence to a minimum, task trade-offs cannot be specified in advance. In contrast, Aligned-MTL provably converges to an optimal point with pre-defined task-specific weights, which provides more control over the optimization result. Through experiments, we show that the proposed approach consistently improves performance on a diverse set of MTL benchmarks, including semantic and instance segmentation, depth estimation, surface normal estimation, and reinforcement learning. The source code is publicly available at https://github.com/SamsungLabs/MTL.
Dmitry Senushkin, Nikolay Patakin, Arseny Kuznetsov, Anton Konushin
CVPR3