← Search

Nan Pu

18 accepted papers

2026

CORE: Conflict-Oriented Reasoning for General Multimodal Manipulation Detection

ICML 2026poster

The rapid rise of generative AI has made multimodal fake news increasingly realistic and pervasive, posing severe threats to public trust and social stability. Existing detection methods rely heavily on manipulation-specific models and large-scale labeled data, resulting in poor generalization to em…

Cited by 0SourceScholar
2026

GeCo: Geometry-Consistent Regularization for Domain Generalized Semantic Segmentation

CVPR 2026

Vision Foundation Models (VFMs) provide rich and transferable representations through large-scale pretraining, yet their high-capacity representations remain underutilized when adapted to downstream tasks. In Domain Generalization Semantic Segmentation (DGSS), parameter-efficient fine-tuning (PEFT)

Cited by 0SourcecodeScholar
2026

OmniVL-Guard: Towards Unified Vision-Language Forgery Detection and Grounding via Balanced RL

ICML 2026poster

Existing forgery detection methods are often limited to uni-modal or bi-modal settings, failing to handle the interleaved text, images, and videos prevalent in real-world misinformation. To bridge this gap, we propose **OmniVL-Guard**, a unified framework for omni vision-language forgery detection a…

Cited by 0SourceScholar
2026

Open-Vocabulary Domain Generalization in Urban-Scene Segmentation

CVPR 2026

Domain Generalization in Semantic Segmentation (DG-SS) aims to enable segmentation models to perform robustly in unseen environments. However, conventional DG-SS methods are restricted to a fixed set of known categories, limiting their applicability in open-world scenarios. Recent progress in Vision

Cited by 0SourcecodeScholar
2026

Open-World Deepfake Attribution via Confidence-Aware Asymmetric Learning

AAAI 2026technical

The proliferation of synthetic facial imagery has intensified the need for robust Open-World DeepFake Attribution (OW-DFA), which aims to attribute both known and unknown forgeries using labeled data for known types and unlabeled data containing a mixture of known and novel types. However, existing

Cited by 0SourcePDFScholar
2026

SANER: Switchable Adapter with Non-parametric Enhanced Routing for Person De-Reidentification

CVPR 2026

Person De-Reidentification (De-ReID) is an emerging and safety-critical task that aims to selectively forget specific individuals in surveillance systems while preserving the recognition capability for others. Existing methods typically learn both forgetting and retaining objectives within a unified

Cited by 0SourcecodeScholar
2026

The Devil Is in Gradient Entanglement: Energy-Aware Gradient Coordinator for Robust Generalized Category Discovery

CVPR 2026

Generalized Category Discovery (GCD) leverages labeled data to categorize unlabeled samples from known or unknown classes. Most previous methods jointly optimize supervised and unsupervised objectives and achieve promising results. However, inherent optimization interference still limits their abili

Cited by 0SourcecodeScholar
2025

Generate, Refine, and Encode: Leveraging Synthesized Novel Samples for On-the-Fly Fine-Grained Category Discovery

ICCV 2025poster

In this paper, we investigate a practical yet challenging task: On-the-fly Category Discovery (OCD). This task focuses on the online identification of newly arriving stream data that may belong to both known and unknown categories, utilizing the category knowledge from only labeled data. Existing OC…

2025

Robust Consensus Anchor Learning for Efficient Multi-view Subspace Clustering

ICML 2025poster

As a leading unsupervised classification algorithm in artificial intelligence, multi-view subspace clustering segments unlabeled data from different subspaces. Recent works based on the anchor have been proposed to decrease the computation complexity for the datasets with large scales in multi-view…

Cited by 0SourcePDFScholar
2024

Learning to Distinguish Samples for Generalized Category Discovery

ECCV 2024poster

"Generalized Category Discovery (GCD) utilizes labelled data from seen categories to cluster unlabelled samples from both seen and unseen categories. Previous methods have demonstrated that assigning pseudo-labels for representation learning is effective. However, these methods commonly predict pseu…

2024

Novel Class Discovery for Ultra-Fine-Grained Visual Categorization

CVPR 2024highlight

Ultra-fine-grained visual categorization (Ultra-FGVC) aims at distinguishing highly similar sub-categories within fine-grained objects such as different soybean cultivars. Compared to traditional fine-grained visual categorization Ultra-FGVC encounters more hurdles due to the small inter-class and l…

2024

Prototypical Hash Encoding for On-the-Fly Fine-Grained Category Discovery

NeurIPS 2024poster

In this paper, we study a practical yet challenging task, On-the-fly Category Discovery (OCD), aiming to online discover the newly-coming stream data that belong to both known and unknown classes, by leveraging only known category knowledge contained in labeled data. Previous OCD methods employ the…

2024

Textual Knowledge Matters: Cross-Modality Co-Teaching for Generalized Visual Class Discovery

ECCV 2024poster

"In this paper, we study the problem of Generalized Category Discovery (GCD), which aims to cluster unlabeled data from both known and unknown categories using the knowledge of labeled data from known categories. Current GCD methods rely on only visual cues, which however neglect the multi-modality…

2023

COCA: COllaborative CAusal Regularization for Audio-Visual Question Answering

AAAI 2023technical

Audio-Visual Question Answering (AVQA) is a sophisticated QA task, which aims at answering textual questions over given video-audio pairs with comprehensive multimodal reasoning. Through detailed causal-graph analyses and careful inspections of their learning processes, we reveal that AVQA models ar…

Cited by 21SourcePDFScholar
2023

Dynamic Conceptional Contrastive Learning for Generalized Category Discovery

CVPR 2023poster

Generalized category discovery (GCD) is a recently proposed open-world problem, which aims to automatically cluster partially labeled data. The main challenge is that the unlabeled data contain instances that are not only from known categories of the labeled data but also from novel categories. This…

2022

VQA-BC: Robust Visual Question Answering Via Bidirectional Chaining

ICASSP 2022accepted

Current VQA models are suffering from the problem of overdependence on language bias, which severely reduces their robustness in real-world scenarios. In this paper, we analyze VQA models from the view of forward/backward chaining in the inference engine, and propose to enhance their robustness via…

Cited by 0SourceScholar
2021

Lifelong Person Re-Identification via Adaptive Knowledge Accumulation

CVPR 2021poster

Person ReID methods always learn through a stationary domain that is fixed by the choice of a given dataset. In many contexts (e.g., lifelong learning), those methods are ineffective because the domain is continually changing in which case incremental learning over multiple domains is required poten…

Cited by 115PDFcodeScholar