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

Jixie Ge

dblp:290/1156 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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 · 50% Transfer learning and domain adaptation · 25% Representation and self-supervised learning · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.512021
Pareto Self-Supervised Training for Few-Shot Learning · CVPR 2021
Machine learning › Optimization for machine learning
multi-objective optimization
0.512021
Pareto Self-Supervised Training for Few-Shot Learning · CVPR 2021
Machine learning › Optimization for machine learning › multi-objective optimization
pareto optimization
0.512021
Pareto Self-Supervised Training for Few-Shot Learning · CVPR 2021
Machine learning › Representation and self-supervised learning
self-supervised auxiliary learning
0.512021
Pareto Self-Supervised Training for Few-Shot Learning · CVPR 2021

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

self-supervised learning · 0.5pareto exploration · 0.5
YearPublicationVenuePosition
2021 Pareto Self-Supervised Training for Few-Shot Learning
abstract
While few-shot learning (FSL) aims for rapid generalization to new concepts with little supervision, self-supervised learning (SSL) constructs supervisory signals directly computed from unlabeled data. Exploiting the complementarity of these two manners, few-shot auxiliary learning has recently drawn much attention to deal with few labeled data. Previous works benefit from sharing inductive bias between the main task (FSL) and auxiliary tasks (SSL), where the shared parameters of tasks are optimized by minimizing a linear combination of task losses. However, it is challenging to select a proper weight to balance tasks and reduce task conflict. To handle the problem as a whole, we propose a novel approach named as Pareto self-supervised training (PSST) for FSL. PSST explicitly decomposes the few-shot auxiliary problem into multiple constrained multi-objective subproblems with different trade-off preferences, and here a preference region in which the main task achieves the best performance is identified. Then, an effective preferred Pareto exploration is proposed to find a set of optimal solutions in such a preference region. Extensive experiments on several public benchmark datasets validate the effectiveness of our approach by achieving state-of-the-art performance.
Zhengyu Chen 0001, Jixie Ge, Heshen Zhan, Siteng Huang
CVPR2