Demo Data from VLDB 2026 / reviewers in the wild / expert
Kangye Ji
dblp:378/1613
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0007-2763-3114ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 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
2 papers |
Trustworthy machine learning · 43% Segmentation and scene understanding · 29% Learning paradigms · 14% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms
continual learning |
1.0 | 1 | 2026 | SAMCL: Empowering SAM to Continually Learn from Dynamic Domains with Extreme Storage Efficiency · AAAI 2026 |
Machine learning › Transfer learning and domain adaptation
domain adaptation |
1.0 | 1 | 2026 | SAMCL: Empowering SAM to Continually Learn from Dynamic Domains with Extreme Storage Efficiency · AAAI 2026 |
Computer vision › Segmentation and scene understanding
image segmentation |
1.0 | 1 | 2026 | SAMCL: Empowering SAM to Continually Learn from Dynamic Domains with Extreme Storage Efficiency · AAAI 2026 |
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels |
1.0 | 1 | 2026 | Jump-teaching: Combating Sample Selection Bias via Temporal Disagreement · AAAI 2026 |
Machine learning › Trustworthy machine learning
robustness |
1.0 | 1 | 2026 | Jump-teaching: Combating Sample Selection Bias via Temporal Disagreement · AAAI 2026 |
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
sample selection |
1.0 | 1 | 2026 | Jump-teaching: Combating Sample Selection Bias via Temporal Disagreement · AAAI 2026 |
Computer vision › Segmentation and scene understanding › prompt-based segmentation
segment anything model |
1.0 | 1 | 2026 | SAMCL: Empowering SAM to Continually Learn from Dynamic Domains with Extreme Storage Efficiency · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
temporal disagreement · 1.0sample selection · 1.0parameter-efficient fine-tuning · 1.0module selection · 1.0LoRA · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Jump-teaching: Combating Sample Selection Bias via Temporal DisagreementabstractSample selection is a straightforward technique to combat noisy labels, aiming to prevent mislabeled samples from degrading the robustness of neural networks. However, existing methods mitigate compounding selection bias either by leveraging dual-network disagreement or additional forward propagations, leading to multiplied training overhead. To address this challenge, we introduce Jump-teaching, an efficient sample selection framework for debiased model update and simplified selection criterion. Based on a key observation that a neural network exhibits significant disagreement across different training iterations, Jump-teaching proposes a jump-manner model update strategy to enable self-correction of selection bias by harnessing temporal disagreement, eliminating the need for multi-network or multi-round training. Furthermore, we employ a sample-wise selection criterion building on the intra variance of a decomposed single loss for a fine-grained selection without relying on batch-wise ranking or dataset-wise modeling. Extensive experiments demonstrate that Jump-teaching outperforms state-of-the-art counterparts while achieving a nearly overhead-free selection procedure, which boosts training speed by up to 4.47× and reduces peak memory footprint by 54%. Kangye Ji, Zeqing Wang, Qichang Zhang, Bohu Huang |
AAAI | 1 |
| 2026 | SAMCL: Empowering SAM to Continually Learn from Dynamic Domains with Extreme Storage EfficiencyabstractSegment Anything Model (SAM) struggles in open-world scenarios with diverse domains. In such settings, naive fine-tuning with a well-designed learning module is inadequate and often causes catastrophic forgetting issue when learning incrementally. To address this issue, we propose a novel continual learning (CL) method for SAM, termed SAMCL. Rather than relying on a fixed learning module, our method decomposes incremental knowledge into separate modules and trains a selector to choose the appropriate one during inference. However, this intuitive design introduces two key challenges: ensuring effective module learning and selection, and managing storage as tasks accumulate. To tackle these, we introduce two components: AugModule and Module Selector. AugModule reduces the storage of the popular LoRA learning module by sharing parameters across layers while maintaining accuracy. It also employs heatmaps—generated from point prompts—to further enhance domain adaptation with minimal additional cost. Module Selector leverages the observation that SAM’s embeddings can effectively distinguish domains, enabling high selection accuracy by training on low-consumed embeddings instead of raw images. Experiments show that SAMCL outperforms state-of-the-art methods, achieving only 0.19% forgetting and at least 2.5% gain on unseen domains. Each AugModule requires just 0.233 MB, reducing storage by at least 24.3% over other fine-tuning approaches. The buffer storage for Module Selector is further reduced by up to 256x. Zeqing Wang, Kangye Ji |
AAAI | 2 |
| 2025 | LightCL: Compact Continual Learning with Low Memory Footprint For Edge DeviceabstractContinual learning (CL) is a technique that enables neural networks to constantly adapt to their dynamic surroundings. Despite being overlooked for a long time, this technology can considerably address the customized needs of users in edge devices. Actually, most CL methods require huge resource consumption by the training behavior to acquire generalizability among all tasks for delaying forgetting regardless of edge scenarios. Therefore, this paper proposes a compact algorithm called LightCL, which evaluates and compresses the redundancy of already generalized components in structures of the neural network. Specifically, we consider two factors of generalizability, learning plasticity and memory stability, and design metrics of both to quantitatively assess generalizability of neural networks during CL. This evaluation shows that generalizability of different layers in a neural network exhibits a significant variation. Thus, we Maintain Generalizability by freezing generalized parts without the resource-intensive training process and Memorize Feature Patterns by stabilizing feature extracting of previous tasks to enhance generalizability for less-generalized parts with a little extra memory, which is far less than the reduction by freezing. Experiments illustrate that LightCL outperforms other state-of-the-art methods and reduces at most 6.16× memory footprint. We also verify the effectiveness of LightCL on the edge device. Zeqing Wang, Kangye Ji, Bohu Huang |
ASP-DAC | 3 |