← Search

Peisong Wen

15 accepted papers

2026

From Static to Dynamic: Exploring Self-supervised Image-to-Video Representation Transfer Learning

CVPR 2026

Recent studies have made notable progress in video representation learning by transferring image-pretrained models to video tasks, typically with complex temporal modules and video fine-tuning. However, fine-tuning heavy modules may compromise inter-video semantic separability, i.e., the essential a

Cited by 0SourcecodeScholar
2026

HiGFA: Hierarchical Guidance for Fine-grained Data Augmentation with Diffusion Models

AAAI 2026technical

Generative diffusion models show promise for data augmentation. However, applying them to fine-grained tasks presents a significant challenge: ensuring synthetic images accurately capture the subtle, category-defining features critical for high fidelity. Standard approaches, such as text-based Class

Cited by 0SourcePDFScholar
2026

The Devil is in the Condition Numbers: Why is GLU Better than non-GLU Structure?

ICML 2026poster

Gated Linear Units (GLU) and their variants are widely adopted in modern open-source large language model architectures and consistently outperform their non-gated counterparts, yet the underlying reasons for this advantage remain unclear. In this work, we study GLU by analyzing two-layer networks i…

Cited by 0SourceScholar
2026

TuckA: Hierarchical Compact Tensor Experts for Efficient Fine-Tuning

AAAI 2026technical

Efficiently fine-tuning pre-trained models for downstream tasks is a key challenge in the era of foundation models. Parameter-efficient fine-tuning (PEFT) presents a promising solution, achieving performance comparable to full fine-tuning by updating only a small number of adaptation weights per lay

Cited by 0SourcePDFScholar
2025

Exploring Structural Degradation in Dense Representations for Self-supervised Learning

NeurIPS 2025poster

In this work, we observe a counterintuitive phenomenon in self-supervised learning (SSL): longer training may impair the performance of dense prediction tasks (e.g., semantic segmentation). We refer to this phenomenon as Self-supervised Dense Degradation (SDD) and demonstrate its consistent presence…

Cited by 0SourcecodeScholar
2024

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation

NeurIPS 2024poster

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization method…

2023

Building Bridge Across the Time: Disruption and Restoration of Murals In the Wild

ICCV 2023poster

In this paper, we focus on the mural-restoration task, which aims to detect damaged regions in the mural and repaint them automatically. Different from traditional image restoration tasks like in/out/blind-painting and image renovation, the corrupted mural suffers from more complicated degradation.…

Cited by 11PDFScholar
2023

Feature Directions Matter: Long-Tailed Learning via Rotated Balanced Representation

ICML 2023poster

Long-tailed learning is one of the most challenging problems in visual recognition. There are some studies aiming to solve long-tailed classification from the perspective of feature learning. Recent work proposes to learn the balanced representation by fixing the linear classifier as Equiangular Tig…

Cited by 19SourcePDFScholar
2023

Towards Decision-Friendly AUC: Learning Multi-Classifier with AUCµ

AAAI 2023technical

Area Under the ROC Curve (AUC) is a widely used ranking metric in imbalanced learning due to its insensitivity to label distributions. As a well-known multiclass extension of AUC, Multiclass AUC (MAUC, a.k.a. M-metric) measures the average AUC of multiple binary classifiers. In this paper, we argue…

Cited by 0SourcePDFScholar
2023

Weighted ROC Curve in Cost Space: Extending AUC to Cost-Sensitive Learning

NeurIPS 2023poster

In this paper, we aim to tackle flexible cost requirements for long-tail datasets, where we need to construct a (a) cost-sensitive and (b) class-distribution robust learning framework. The misclassification cost and the area under the ROC curve (AUC) are popular metrics for (a) and (b), respectively…

Cited by 9SourcePDFScholar
2022

A Sparse-Motif Ensemble Graph Convolutional Network against Over-smoothing

IJCAI 2022poster

The over-smoothing issue is a well-known challenge for Graph Convolutional Networks (GCN). Specifically, it is often observed that increasing the depth of GCN ends up in a trivial embedding subspace where the difference among node embeddings belonging to the same cluster tends to vanish. This paper…

2022

Dist-PU: Positive-Unlabeled Learning From a Label Distribution Perspective

CVPR 2022poster

Positive-Unlabeled (PU) learning tries to learn binary classifiers from a few labeled positive examples with many unlabeled ones. Compared with ordinary semi-supervised learning, this task is much more challenging due to the absence of any known negative labels. While existing cost-sensitive-based m…

Cited by 58PDFcodeScholar
2022

Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability

NeurIPS 2022accept

Stochastic optimization of the Area Under the Precision-Recall Curve (AUPRC) is a crucial problem for machine learning. Although various algorithms have been extensively studied for AUPRC optimization, the generalization is only guaranteed in the multi-query case. In this work, we present the first…

2021

Seeking the Shape of Sound: An Adaptive Framework for Learning Voice-Face Association

CVPR 2021poster

Nowadays, we have witnessed the early progress on learning the association between voice and face automatically, which brings a new wave of studies to the computer vision community. However, most of the prior arts along this line (a) merely adopt local information to perform modality alignment and (…

Cited by 36PDFcodeScholar
2021

When False Positive is Intolerant: End-to-End Optimization with Low FPR for Multipartite Ranking

NeurIPS 2021poster

Multipartite ranking is a basic task in machine learning, where the Area Under the receiver operating characteristics Curve (AUC) is generally applied as the evaluation metric. Despite that AUC reflects the overall performance of the model, it is inconsistent with the expected performance in some ap…

Cited by 5SourcePDFScholar