← Search

Songjun Tu

7 accepted papers

2026

One LR Doesn’t Fit All: Heavy-Tail Guided Layerwise Learning Rates for LLMs

ICML 2026poster

Learning rate configuration is a fundamental aspect of modern deep learning. The prevailing practice of applying a uniform learning rate across all layers overlooks the structural heterogeneity of Transformers, potentially limiting their effectiveness as the backbone of Large Language Models (LLMs).…

Cited by 0Source ↗Scholar ↗
2026

SRFT: A Single-Stage Method with Supervised and Reinforcement Fine-Tuning for Reasoning

ICLR 2026poster

Large language models (LLMs) have achieved remarkable progress in reasoning tasks, yet optimally integrating Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL) remains a fundamental challenge. Through a comprehensive analysis of token distributions, learning dynamics, and integration mecha…

Cited by 0Source ↗code ↗Scholar ↗
2026

Saliency-Guided Representation with Consistency Policy Learning for Visual Unsupervised Reinforcement Learning

CVPR 2026

Zero-shot unsupervised reinforcement learning (URL) offers a promising direction for building generalist agents capable of generalizing to unseen tasks without additional supervision. Among existing approaches, successor representations (SR) have emerged as a prominent paradigm due to their effectiv

Cited by 0Source ↗code ↗Scholar ↗
2025

AlphaDecay: Module-wise Weight Decay for Heavy-Tailed Balancing in LLMs

NeurIPS 2025poster

Weight decay is a standard regularization technique for training large language models (LLMs). While it is common to assign a uniform decay rate to every layer, this approach overlooks the structural diversity of LLMs and the varying spectral properties across modules. In this paper, we introduce A…

Cited by 0Source ↗code ↗Scholar ↗
2025

In-Dataset Trajectory Return Regularization for Offline Preference-based Reinforcement Learning

AAAI 2025technical

Offline preference-based reinforcement learning (PbRL) typically operates in two phases: first, use human preferences to learn a reward model and annotate rewards for a reward-free offline dataset; second, learn a policy by optimizing the learned reward via offline RL. However, accurately modeling s…

2025

Learning When to Think: Shaping Adaptive Reasoning in R1-Style Models via Multi-Stage RL

NeurIPS 2025poster

Large reasoning models (LRMs) are proficient at generating explicit, step-by-step reasoning sequences before producing final answers. However, such detailed reasoning can introduce substantial computational overhead and latency, particularly for simple problems. To address this over-thinking problem…

Cited by 0Source ↗code ↗Scholar ↗
2025

Unsupervised Zero-Shot Reinforcement Learning via Dual-Value Forward-Backward Representation

ICLR 2025poster

Online unsupervised reinforcement learning (URL) can discover diverse skills via reward-free pre-training and exhibits impressive downstream task adaptation abilities through further fine-tuning. However, online URL methods face challenges in achieving zero-shot generalization, i.e., directly applyi…

Cited by 0Source ↗PDF ↗Scholar ↗