← Search

Yanhua Yang

12 accepted papers

2026

Channel-masked Asymmetric Distribution Matching for Cross-Domain Generalized Dataset Distillation

AAAI 2026technical

Dataset distillation has achieved remarkable progress as an effective approach for data compression. However, real-world data often comes from diverse domains, leading to potential mismatches between the domains of synthesized images and those of the evaluation set. Existing methods primarily assume

Cited by 0SourcePDFScholar
2026

Decomposing Prompts, Composing Actions: A Multi-Granularity Prompting Approach for Incremental Action Learning

AAAI 2026technical

Continual learning for action recognition is a critical capability for next-generation Extended Reality (XR) systems. Yet it faces a severe real-world challenge: strict user privacy that prohibits data rehearsal. While recent prompt-based continual learning methods show promise, we argue their core

Cited by 0SourcePDFScholar
2026

Your AI-Generated Image Detector Can Secretly Achieve SOTA Accuracy, If Calibrated

AAAI 2026technical

Despite being trained on balanced datasets, existing AI-generated image detectors often exhibit systematic bias at test time, frequently misclassifying fake images as real. We hypothesize that this behavior stems from distributional shift in fake samples and implicit priors learned during training.

Cited by 0SourcePDFScholar
2025

Detecting Open World Objects via Partial Attribute Assignment

CVPR 2025poster

Despite being trained on massive data, today's vision foundation models still fall short in detecting open world objects. Apart from recognizing known objects from training, a successful Open World Object Detection (OWOD) system must also be able to detect unknown objects never seen before, without…

2025

Q-MiniSAM2: A Quantization-based Benchmark for Resource-Efficient Video Segmentation

IJCAI 2025

Segment Anything Model 2 (SAM2) is a new-generation, high-precision model for image and video segmentation, offering extensive application prospects across numerous computer vision fields. However, as a large-scale model, its huge memory demands and expansive computing costs pose challenges for prac

Cited by 0SourcePDFScholar
2023

Learning with Diversity: Self-Expanded Equalization for Better Generalized Deep Metric Learning

ICCV 2023poster

Exploring good generalization ability is essential in deep metric learning (DML). Most existing DML methods focus on improving the model robustness against category shift to keep the performance on unseen categories. However, in addition to category shift, domain shift also widely exists in real-wor…

Cited by 8PDFScholar
2022

Learning Universal Adversarial Perturbation by Adversarial Example

AAAI 2022technical

Deep learning models have shown to be susceptible to universal adversarial perturbation (UAP), which has aroused wide concerns in the community. Compared with the conventional adversarial attacks that generate adversarial samples at the instance level, UAP can fool the target model for different ins…

2021

Understanding and Improving Early Stopping for Learning with Noisy Labels

NeurIPS 2021poster

The memorization effect of deep neural network (DNN) plays a pivotal role in many state-of-the-art label-noise learning methods. To exploit this property, the early stopping trick, which stops the optimization at the early stage of training, is usually adopted. Current methods generally decide the…

2020

Progressive Domain-Independent Feature Decomposition Network for Zero-Shot Sketch-Based Image Retrieval

IJCAI 2020poster

Zero-Shot Sketch-Based Image Retrieval (ZS-SBIR) is a specific cross-modal retrieval task for searching natural images given free-hand sketches under the zero-shot scenario. Most existing methods solve this problem by simultaneously projecting visual features and semantic supervision into a low-dime…

Cited by 0SourcePDFScholar
2018

Unsupervised Deep Generative Adversarial Hashing Network

CVPR 2018poster

Unsupervised deep hash functions have not shown satisfactory improvements against the shallow alternatives, and usually, require supervised pretraining to avoid getting stuck in bad local minima. In this paper, we propose a deep unsupervised hashing function, called HashGAN, which outperforms unsupe…

Cited by 144SourcePDFScholar