← Search

Shaofeng Zhang

31 accepted papers

2026

Beyond Majority Voting: Self-Reflective Test-Time Reinforcement Learning for LLM Reasoning

ICML 2026poster

The core challenge of Test-Time Reinforcement Learning (TTRL) lies in estimating rewards without access to ground-truth supervision. Existing TTRL methods predominantly rely on majority voting to generate pseudo-labels, under the assumption that the most frequent answer among sampled trajectories is…

Cited by 0SourceScholar
2026

Dynamic Important Example Mining for Reinforcement Finetuning

CVPR 2026

Reinforcement fine-tuning (RFT) is increasingly used to strengthen the reasoning abilities of large models, yet its effectiveness is bound by how training data are selected and used. Most data-centric RFT methods rely on static or heuristic sample selection, implicitly assuming a sample's value is f

Cited by 0SourcecodeScholar
2026

NITP: Next Implicit Token Prediction for LLM Pre-training

ICML 2026poster

Standard Next-Token Prediction (NTP) supervises language models solely through discrete labels in the output logit space. We argue that this sparse, one-hot supervision leaves the latent representation space under-constrained, allowing hidden states to drift into degenerate and anisotropic configura…

Cited by 0SourceScholar
2026

PointAlign: Feature-Level Alignment Regularization for 3D Vision-Language Models

CVPR 2026

The development of 3D Vision-Language Models (VLMs), crucial for applications in robotics, autonomous driving, and augmented reality, is severely constrained by the scarcity of paired 3D-text data. Existing methods rely solely on next-token prediction loss, using only language tokens for supervision

Cited by 0SourcecodeScholar
2026

SAME: Sparse and Anchored Model Editing for Heterogeneous Incremental Learning under Limited Data

CVPR 2026

Existing Incremental Learning (IL) methods are primarily evaluated under either a single-domain class-incremental setting, or a multi-domain task-incremental setting with known task identifiers. However, these assumptions often fail to hold in real-world applications. To bridge this gap, we introduc

Cited by 0SourceScholar
2026

SSR-Merge: Subspace Signal Routing for Training-Free LoRA Merging in Diffusion Models

ICML 2026poster

Low-Rank Adaptation (LoRA) merging can efficiently combine diverse generative capabilities from multiple trained LoRAs for a diffusion model. However, existing LoRA merging techniques often suffer from severe parameter interference, causing destructive collisions in the shared parameter space. To ad…

Cited by 0SourceScholar
2026

Spatial Retrieval Augmented Autonomous Driving

CVPR 2026

Existing autonomous driving systems rely on onboard sensors (cameras, LiDAR, IMU, etc) for environmental perception. However, this paradigm is limited by the drive-time perception horizon and often fails under limited view scope, occlusion or extreme conditions such as darkness and rain. In contrast

Cited by 0SourcecodeScholar
2026

Unlocking Token Rewards via Training-Free Reward Attribution

CVPR 2026

In this paper, we propose an extremely efficient, training-free method to extract token-level reward signals directly from an existing deep reward model. Our core idea is to attribute the overall process reward to individual tokens by estimating each token's influence. This influence is defined as t

Cited by 0SourcecodeScholar
2025

CR2PQ: Continuous Relative Rotary Positional Query for Dense Visual Representation Learning

ICLR 2025poster

Dense visual contrastive learning (DRL) shows promise for learning localized information in dense prediction tasks, but struggles with establishing pixel/patch correspondence across different views (cross-contrasting). Existing methods primarily rely on self-contrasting the same view with variations…

Cited by 0SourcePDFScholar
2025

DLoFT: Gradient-Decoupled Fine-Tuning for Generalizable Long Chain-of-Thought Reasoning

NeurIPS 2025poster

Long chain-of-thought (LongCoT) has emerged as a powerful reasoning paradigm for enabling large language models (LLMs) to solve complex tasks through a systematic and thorough thinking phase. Although supervised fine-tuning (SFT) on high-quality LongCoT traces has proven effective to activate LongCo…

Cited by 0SourceScholar
2025

Graph Pooling via Dropping Task-Irrelevant Nodes

ICASSP 2025accepted

Graph neural networks (GNNs) face scalability challenges. While recent approaches have adopted pooling strategies inspired by convolutional neural networks (CNNs) to reduce graph size and improve efficiency, these methods often focus on local information and are optimized for single graph-level task…

Cited by 0SourceScholar
2025

Mixture-of-Scores: Robust Image-Text Data Valuation via Three Lines of Code

ICCV 2025poster

Evaluating the quality of image-text pairs is essential for data processing in vision-language pre-training. Most metrics currently use off-the-shelf models, like CLIP-Score, to score pairs based on feature similarity. However, we find that different scoring models often produce inconsistent quality…

2025

Point2RBox-v2: Rethinking Point-supervised Oriented Object Detection with Spatial Layout Among Instances

CVPR 2025poster

With the rapidly increasing demand for oriented object detection (OOD), recent research involving weakly-supervised detectors for learning OOD from point annotations has gained great attention. In this paper, we rethink this challenging task setting with the layout among instances and present Point2…

2025

Towards More Diverse and Challenging Pre-training for Point Cloud Learning: Self-Supervised Cross Reconstruction with Decoupled Views

ICCV 2025poster

Point cloud learning, especially in a self-supervised way without manual labels, has gained growing attention in both vision and learning communities due to its potential utility in a wide range of applications. Most existing generative approaches for point cloud self-supervised learning focus on re…

2025

Understanding Data Influence in Reinforcement Finetuning

NeurIPS 2025poster

Reinforcement fine-tuning (RFT) is essential for enhancing the reasoning and generalization capabilities of large language models, but its success heavily relies on the quality of the training data. While data selection has been extensively studied in supervised learning, its role in reinforcement l…

Cited by 0SourceScholar
2025

VideoREPA: Learning Physics for Video Generation through Relational Alignment with Foundation Models

NeurIPS 2025poster

Recent advancements in text-to-video (T2V) diffusion models have enabled high-fidelity and realistic video synthesis. However, current T2V models often struggle to generate physically plausible content due to their limited inherent ability to accurately understand physics. We found that while the re…

Cited by 0SourcecodeScholar
2024

ChronoMagic-Bench: A Benchmark for Metamorphic Evaluation of Text-to-Time-lapse Video Generation

NeurIPS 2024spotlight

We propose a novel text-to-video (T2V) generation benchmark, *ChronoMagic-Bench*, to evaluate the temporal and metamorphic knowledge skills in time-lapse video generation of the T2V models (e.g. Sora and Lumiere). Compared to existing benchmarks that focus on visual quality and text relevance of gen…

2024

Continuous-Multiple Image Outpainting in One-Step via Positional Query and A Diffusion-based Approach

ICLR 2024poster

Image outpainting aims to generate the content of an input sub-image beyond its original boundaries. It is an important task in content generation yet remains an open problem for generative models. This paper pushes the technical frontier of image outpainting in two directions that have not been res…

2024

PCP-MAE: Learning to Predict Centers for Point Masked Autoencoders

NeurIPS 2024spotlight

Masked autoencoder has been widely explored in point cloud self-supervised learning, whereby the point cloud is generally divided into visible and masked parts. These methods typically include an encoder accepting visible patches (normalized) and corresponding patch centers (position) as input, with…

2024

View Crafting For Instance-Level Representation from Scene Images

ICASSP 2024accepted

Existing image-level self-supervised learning (SSL) methods pre-trained on natural scene data can have difficulty in adating to dense prediction tasks. However, scene images contain multiple varied instances. We devise two techniques to craft high-quality scene and instance views for instance-level…

Cited by 0SourceScholar
2023

Contextual Image Masking Modeling via Synergized Contrasting without View Augmentation for Faster and Better Visual Pretraining

ICLR 2023poster

We propose a new contextual masking image modeling (MIM) approach called contrasting-aided contextual MIM (ccMIM), under the MIM paradigm for visual pretraining. Specifically, we adopt importance sampling to select the masked patches with richer semantic information for reconstruction, instead of ra…

Cited by 22SourcePDFScholar
2023

HAP: Structure-Aware Masked Image Modeling for Human-Centric Perception

NeurIPS 2023poster

Model pre-training is essential in human-centric perception. In this paper, we first introduce masked image modeling (MIM) as a pre-training approach for this task. Upon revisiting the MIM training strategy, we reveal that human structure priors offer significant potential. Motivated by this insight…

2023

Patch-Level Contrasting without Patch Correspondence for Accurate and Dense Contrastive Representation Learning

ICLR 2023poster

We propose ADCLR: \underline{A}ccurate and \underline{D}ense \underline{C}ontrastive \underline{R}epresentation \underline{L}earning, a novel self-supervised learning framework for learning accurate and dense vision representation. To extract spatial-sensitive information, ADCLR introduces query pat…

Cited by 19SourcePDFScholar
2023

Patch-level Contrastive Learning via Positional Query for Visual Pre-training

ICML 2023poster

Dense contrastive learning (DCL) has been recently explored for learning localized information for dense prediction tasks (e.g., detection and segmentation). It still suffers the difficulty of mining pixels/patches correspondence between two views. A simple way is inputting the same view twice and a…

2022

Align Representations With Base: A New Approach to Self-Supervised Learning

CVPR 2022poster

Existing symmetric contrastive learning methods suffer from collapses (complete and dimensional) or quadratic complexity of objectives. Departure from these methods which maximize mutual information of two generated views, along either instance or feature dimension, the proposed paradigm introduces…

Cited by 30PDFScholar
2022

Zero-CL: Instance and Feature decorrelation for negative-free symmetric contrastive learning

ICLR 2022poster

For self-supervised contrastive learning, models can easily collapse and generate trivial constant solutions. The issue has been mitigated by recent improvement on objective design, which however often requires square complexity either for the size of instances ($\mathcal{O}(N^{2})$) or feature dime…

Cited by 48SourcePDFScholar