← Search

Haoru Tan

18 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

DreamOmni2: Multimodal Instruction-based Generation and Editing

CVPR 2026

Recent advancements in instruction-based image editing and subject-driven generation have garnered significant attention, yet both tasks still face limitations in meeting practical user needs. Instruction-based editing relies solely on language instructions, which often fail to capture specific edit

Cited by 0SourcecodeScholar
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

Fast Data Mixture Optimization via Gradient Descent

ICLR 2026poster

While large and diverse datasets have driven recent advances in large models, identifying the optimal data mixture for pre-training and post-training remains a significant open problem. We address this challenge with FastMix, a novel framework that automates data mixture discovery while training onl…

Cited by 0SourcecodeScholar
2026

Scaf-GRPO: Scaffolded Group Relative Policy Optimization for Enhancing LLM Reasoning

ICLR 2026poster

Reinforcement learning from verifiable rewards has emerged as a powerful technique for enhancing the complex reasoning abilities of Large Language Models (LLMs). However, these methods are fundamentally constrained by the ''learning cliff'' phenomenon: when faced with problems far beyond their curre…

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

Equipping Vision Foundation Model with Mixture of Experts for Out-of-Distribution Detection

ICCV 2025poster

Pre-trained vision foundation models have transformed many computer vision tasks. Despite their strong ability to learn discriminative and generalizable features crucial for out-of-distribution (OOD) detection, their impact on this task remains underexplored. Motivated by this gap, we systematically…

Cited by 0SourcePDFScholar
2025

Mixture Compressor for Mixture-of-Experts LLMs Gains More

ICLR 2025poster

Mixture-of-Experts large language models (MoE-LLMs) marks a significant step forward of language models, however, they encounter two critical challenges in practice: 1) expert parameters lead to considerable memory consumption and loading latency; and 2) the current activated experts are redundant,…

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

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
2024

SaCo Loss: Sample-wise Affinity Consistency for Vision-Language Pre-training

CVPR 2024poster

Vision-language pre-training (VLP) aims to learn joint representations of vision and language modalities. The contrastive paradigm is currently dominant in this field. However we observe a notable misalignment phenomenon that is the affinity between samples has an obvious disparity across different…

Cited by 2SourcePDFScholar
2022

Pale Transformer: A General Vision Transformer Backbone with Pale-Shaped Attention

AAAI 2022technical

Recently, Transformers have shown promising performance in various vision tasks. To reduce the quadratic computation complexity caused by the global self-attention, various methods constrain the range of attention within a local region to improve its efficiency. Consequently, their receptive fields…