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

Yan Fan 0002

dblp:35/8310-2 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2026
0000-0002-5877-8523ORCID · verified

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 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
4 papers
Learning paradigms · 42% Segmentation and scene understanding · 14% Representation and self-supervised learning · 12%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
continual learning
1.522024
Persistence Homology Distillation for Semi-supervised Continual Learning · NeurIPS 2024
Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning · AAAI 2024
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
1.522024
Persistence Homology Distillation for Semi-supervised Continual Learning · NeurIPS 2024
Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning · AAAI 2024
Machine learning › Learning paradigms › continual learning
semi-supervised continual learning
1.522024
Persistence Homology Distillation for Semi-supervised Continual Learning · NeurIPS 2024
Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning · AAAI 2024
Computer vision › Segmentation and scene understanding
3d semantic segmentation
1.012026
Multi-Granularity Superpoint Graph Learning for Weakly Supervised 3D Semantic Segmentation · IEEE Trans. Multim. 2026
Machine learning › Learning paradigms › semi-supervised learning › graph-based semi-supervised learning
label propagation
1.012026
Multi-Granularity Superpoint Graph Learning for Weakly Supervised 3D Semantic Segmentation · IEEE Trans. Multim. 2026
Computer vision › 3D vision
point cloud processing
1.012026
Multi-Granularity Superpoint Graph Learning for Weakly Supervised 3D Semantic Segmentation · IEEE Trans. Multim. 2026
Computer vision › Segmentation and scene understanding › pseudo-label learning
pseudo-label generation
1.012026
Multi-Granularity Superpoint Graph Learning for Weakly Supervised 3D Semantic Segmentation · IEEE Trans. Multim. 2026
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.912025
Reducing Class-wise Confusion for Incremental Learning with Disentangled Manifolds · CVPR 2025
Machine learning › Learning paradigms › continual learning
class-incremental learning
0.912025
Reducing Class-wise Confusion for Incremental Learning with Disentangled Manifolds · CVPR 2025
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.912025
Reducing Class-wise Confusion for Incremental Learning with Disentangled Manifolds · CVPR 2025
Machine learning › Graph learning › graph neural network training › graph distillation
graph knowledge distillation
0.812024
Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning · AAAI 2024
Machine learning › Graph learning › topological data analysis
persistent homology
0.812024
Persistence Homology Distillation for Semi-supervised Continual Learning · NeurIPS 2024
Machine learning › Representation and self-supervised learning
topological representation
0.812024
Persistence Homology Distillation for Semi-supervised Continual Learning · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.212024
Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning · AAAI 2024
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift
0.212024
Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning · AAAI 2024

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

multi-granularity consistency loss · 1.0graph learning · 1.0contrastive learning · 1.0prototype learning · 0.9autoencoder · 0.9structural distillation · 0.8persistence homology · 0.8knowledge distillation · 0.8graph construction · 0.8dynamic sub-graph distillation · 0.8
YearPublicationVenuePosition
2026 Multi-Granularity Superpoint Graph Learning for Weakly Supervised 3D Semantic Segmentation
abstract
Weakly supervised 3D semantic segmentation has proven effective in alleviating the heavy dependence on dense annotations by generating high-quality pseudo-labels. However, due to the scene complexity and disorder of the point cloud, merely applying the model semantic prediction or hand-crafted feature similarity for pseudo labeling is inefficient and biased. This limitation inevitably results in incorrect pseudo labels. To tackle this challenge, we propose a new method called Multi-granularity Superpoint Graph Learning (MSGL) that leverages the multi-scale local features of point clouds to improve the quality of pseudo labels. We first design a multi-granularity local representation learning module on the superpoint graph to capture the neighboring structure information of each superpoint within complex scenes. Subsequently, the generated structural embedding is utilized to enhance the affinity matrix of label propagation, thereby yielding high-quality pseudo labels. To further enforce the generalization of the structural representation module under scenario changes or data fluctuations, we present a multi-granularity consistency loss in MSGL. This loss is applied across different views of the superpoint graph within each scene to ensure a robust and consistent learning process. Our experiments conducted on three benchmarks show that the proposed method outperforms existing weakly supervised methods under several sparse label settings, and improves the baseline by an average of 7.7% with only 1% extra computation cost. Moreover, our approach even compares favorably to some fully supervised methods with only one point labeled for each thing.
Yan Fan 0002, Yu Wang 0106, Pengfei Zhu 0001, Le Hui, Jin Xie 0001, Bin Xiao 0002, Qinghua Hu
IEEE Trans. Multim.1
2025 Reducing Class-wise Confusion for Incremental Learning with Disentangled Manifolds
abstract
Class incremental learning (CIL) aims to enable models to continuously learn new classes without catastrophically forgetting old ones. A promising direction is to learn and use prototypes of classes during incremental updates. Despite simplicity and intuition, we find that such methods suffer from inadequate representation capability and unsatisfied feature overlap. These two factors cause class-wise confusion and limited performance. In this paper, we develop a Confusion-REduced AuTo-Encoder classifier (CREATE) for CIL. Specifically, our method employs a lightweight auto-encoder module to learn compact manifold for each class in the latent subspace, constraining samples to be well reconstructed only on the semantically correct auto-encoder. Thus, the representation stability and capability of class distributions are enhanced, alleviating the potential class-wise confusion problem. To further distinguish the overlapped features, we propose a confusion-aware latent space separation loss that ensures samples are closely distributed in their corresponding low-dimensional manifold while keeping away from the distributions of features from other classes. Our method demonstrates stronger representational capacity and discrimination ability by learning disentangled manifolds and reduces class confusion. Extensive experiments on multiple datasets and settings show that CREATE outperforms other state-of-the-art methods up to 5.41%. The code is available at https://github.com/lilyht/CREATE.
Huitong Chen, Yu Wang 0106, Yan Fan 0002, Guosong Jiang, Qinghua Hu
CVPR3
2025 Uncertainty-Aware Superpoint Graph Transformer for Weakly Supervised 3-D Semantic Segmentation
abstract
Weakly supervised 3-D semantic segmentation has successfully mitigated the labor-intensive and time-consuming task of annotating 3-D point clouds. However, reliably utilizing the minimal point-wise annotations for unlabeled data in complex and large-scale scenes is still challenging, such as only 20 points labeled in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlabeled data learning through reliable long-range supervision propagation from labeled superpoints to unlabeled superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlabeled superpoints to clusters centered on labeled superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intraclass membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% labeled points.
Yan Fan 0002, Yu Wang 0106, Pengfei Zhu 0001, Le Hui, Jin Xie 0001, Qinghua Hu
IEEE Trans. Fuzzy Syst.1
2024 Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning
abstract
Continual learning (CL) has shown promising results and comparable performance to learning at once in a fully supervised manner. However, CL strategies typically require a large number of labeled samples, making their real-life deployment challenging. In this work, we focus on semi-supervised continual learning (SSCL), where the model progressively learns from partially labeled data with unknown categories. We provide a comprehensive analysis of SSCL and demonstrate that unreliable distributions of unlabeled data lead to unstable training and refinement of the progressing stages. This problem severely impacts the performance of SSCL. To address the limitations, we propose a novel approach called Dynamic Sub-Graph Distillation (DSGD) for semi-supervised continual learning, which leverages both semantic and structural information to achieve more stable knowledge distillation on unlabeled data and exhibit robustness against distribution bias. Firstly, we formalize a general model of structural distillation and design a dynamic graph construction for the continual learning progress. Next, we define a structure distillation vector and design a dynamic sub-graph distillation algorithm, which enables end-to-end training and adaptability to scale up tasks. The entire proposed method is adaptable to various CL methods and supervision settings. Finally, experiments conducted on three datasets CIFAR10, CIFAR100, and ImageNet-100, with varying supervision ratios, demonstrate the effectiveness of our proposed approach in mitigating the catastrophic forgetting problem in semi-supervised continual learning scenarios. Our code is available: https://github.com/fanyan0411/DSGD.
Yan Fan 0002, Yu Wang 0106, Pengfei Zhu 0001, Qinghua Hu
AAAI1
2024 Persistence Homology Distillation for Semi-supervised Continual Learning
abstract
Semi-supervised continual learning (SSCL) has attracted significant attention for addressing catastrophic forgetting in semi-supervised data. Knowledge distillation, which leverages data representation and pair-wise similarity, has shown significant potential in preserving information in SSCL. However, traditional distillation strategies often fail in unlabeled data with inaccurate or noisy information, limiting their efficiency in feature spaces undergoing substantial changes during continual learning. To address these limitations, we propose Persistence Homology Distillation (PsHD) to preserve intrinsic structural information that is insensitive to noise in semi-supervised continual learning. First, we capture the structural features using persistence homology by homological evolution across different scales in vision data, where the multi-scale characteristic established its stability under noise interference. Next, we propose a persistence homology distillation loss in SSCL and design an acceleration algorithm to reduce the computational cost of persistence homology in our module. Furthermore, we demonstrate the superior stability of PsHD compared to sample representation and pair-wise similarity distillation methods theoretically and experimentally. Finally, experimental results on three widely used datasets validate that the new PsHD outperforms state-of-the-art with 3.9% improvements on average, and also achieves 1.5% improvements while reducing 60% memory buffer size, highlighting the potential of utilizing unlabeled data in SSCL. Our code is available: https://github.com/fanyan0411/PsHD.
Yan Fan 0002, Yu Wang 0106, Pengfei Zhu 0001, Qinghua Hu
NeurIPS1