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

Kangjian Peng

dblp:226/5373 · DBLP profile ↗
← Back
2ranked-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 · 2 · 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
2 papers
Efficient and distributed learning · 60% Transfer learning and domain adaptation · 30% Segmentation and scene understanding · 5%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
0.922021
FNA++: Fast Network Adaptation via Parameter Remapping and Architecture Search · IEEE Trans. Pattern Anal. Mach. Intell. 2021
Fast Neural Network Adaptation via Parameter Remapping and Architecture Search · ICLR 2020
Machine learning › Transfer learning and domain adaptation › model adaptation
architecture adaptation
0.512021
FNA++: Fast Network Adaptation via Parameter Remapping and Architecture Search · IEEE Trans. Pattern Anal. Mach. Intell. 2021
Machine learning › Efficient and distributed learning
model compression
0.512021
FNA++: Fast Network Adaptation via Parameter Remapping and Architecture Search · IEEE Trans. Pattern Anal. Mach. Intell. 2021
Machine learning › Transfer learning and domain adaptation › model adaptation
network adaptation
0.412020
Fast Neural Network Adaptation via Parameter Remapping and Architecture Search · ICLR 2020
Computer vision › Image recognition and object detection
object detection
0.112021
FNA++: Fast Network Adaptation via Parameter Remapping and Architecture Search · IEEE Trans. Pattern Anal. Mach. Intell. 2021
Computer vision › Segmentation and scene understanding
semantic segmentation
0.112021
FNA++: Fast Network Adaptation via Parameter Remapping and Architecture Search · IEEE Trans. Pattern Anal. Mach. Intell. 2021

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

parameter remapping · 0.9neural architecture search · 0.5knowledge transfer · 0.5architecture search · 0.4
YearPublicationVenuePosition
2021 FNA++: Fast Network Adaptation via Parameter Remapping and Architecture Search
abstract
Deep neural networks achieve remarkable performance in many computer vision tasks. Most state-of-the-art (SOTA) semantic segmentation and object detection approaches reuse neural network architectures designed for image classification as the backbone, commonly pre-trained on ImageNet. However, performance gains can be achieved by designing network architectures specifically for detection and segmentation, as shown by recent neural architecture search (NAS) research for detection and segmentation. One major challenge though is that ImageNet pre-training of the search space representation (a.k.a. super network) or the searched networks incurs huge computational cost. In this paper, we propose a Fast Network Adaptation (FNA++) method, which can adapt both the architecture and parameters of a seed network (e.g., an ImageNet pre-trained network) to become a network with different depths, widths, or kernel sizes via a parameter remapping technique, making it possible to use NAS for segmentation and detection tasks a lot more efficiently. In our experiments, we apply FNA++ on MobileNetV2 to obtain new networks for semantic segmentation, object detection, and human pose estimation that clearly outperform existing networks designed both manually and by NAS. We also implement FNA++ on ResNets and NAS networks, which demonstrates a great generalization ability. The total computation cost of FNA++ is significantly less than SOTA segmentation and detection NAS approaches: 1737× less than DPC, 6.8× less than Auto-DeepLab, and 8.0× less than DetNAS. A series of ablation studies are performed to demonstrate the effectiveness, and detailed analysis is provided for more insights into the working mechanism. Codes are available at https://github.com/JaminFong/FNA.
Jiemin Fang, Yuzhu Sun, Qian Zhang 0009, Kangjian Peng, Wenyu Liu 0001, Xinggang Wang
IEEE Trans. Pattern Anal. Mach. Intell.4
2020 Fast Neural Network Adaptation via Parameter Remapping and Architecture Search
Jiemin Fang, Yuzhu Sun, Kangjian Peng, Qian Zhang 0009, Wenyu Liu 0001, Xinggang Wang
ICLR3