← Search

Shuang Qiu

25 accepted papers

2026

Certain Head, Uncertain Tail: Expert-Sample for Test-Time Scaling in Fine-Grained MoE

ICML 2026poster

Test-time scaling improves LLM performance by generating multiple candidate solutions, yet token-level sampling requires temperature tuning that trades off diversity against stability. Fine-grained MoE, featuring hundreds of well-trained experts per layer and multi-expert activation per token, offer…

Cited by 0SourceScholar
2026

Dual-Robust Cross-Domain Offline Reinforcement Learning Against Dynamics Shifts

ICLR 2026poster

Single-domain offline reinforcement learning (RL) often suffers from limited data coverage, while cross-domain offline RL handles this issue by leveraging additional data from other domains with dynamics shifts. However, existing studies primarily focus on train-time robustness (handling dynamics sh…

Cited by 0SourceScholar
2026

Model-based Offline RL via Robust Value-Aware Model Learning with Implicitly Differentiable Adaptive Weighting

ICLR 2026poster

Model-based offline reinforcement learning (RL) aims to enhance offline RL with a dynamics model that facilitates policy exploration. However, model exploitation could occur due to inevitable model errors, which degrades algorithm performance. Adversarial model learning offers a theoretical framewor…

Cited by 0SourceScholar
2026

SparVAR: Exploring Sparsity in Visual AutoRegressive Modeling for Training-Free Acceleration

CVPR 2026

Visual AutoRegressive (VAR) modeling has garnered significant attention for its innovative next-scale prediction paradigm. However, mainstream VAR paradigms attend to all tokens across historical scales at each autoregressive step. As the next scale resolution grows, the computational complexity of

Cited by 0SourcecodeScholar
2026

T-POP: Test-Time Personalization with Online Preference Feedback

ICML 2026poster

Personalizing large language models (LLMs) to individual user preferences is a critical step beyond generating generically helpful responses. However, current personalization methods are ill-suited for new users, as they typically require either slow, resource-intensive fine-tuning or a substantial …

Cited by 0SourceScholar
2026

Unifying Value Alignment and Assignment in Cross-Domain Offline Reinforcement Learning with Heterogeneous Datasets

ICML 2026poster

Cross-domain offline reinforcement learning (RL) aims to train an agent that performs well in the target domain using a limited target domain dataset and a source domain dataset that exhibits a dynamics shift. Training directly on the original source dataset typically leads to performance collapse. …

Cited by 0SourceScholar
2025

Forward KL Regularized Preference Optimization for Aligning Diffusion Policies

AAAI 2025technical

Diffusion models have achieved remarkable success in sequential decision-making by leveraging the highly expressive model capabilities in policy learning. A central problem for learning diffusion policies is to align the policy output with human intents in various tasks. To achieve this, previous me…

Cited by 3SourcePDFScholar
2025

Online Preference Alignment for Language Models via Count-based Exploration

ICLR 2025spotlight

Reinforcement Learning from Human Feedback (RLHF) has shown great potential in fine-tuning Large Language Models (LLMs) to align with human preferences. Existing methods perform preference alignment from a fixed dataset, which can be limited in data coverage and the resulting reward model is hard to…

2025

ROPO: Robust Preference Optimization for Large Language Models

ICML 2025poster

The prevalent noise in the preference data unavoidably poses significant challenges to the preference alignment of large language models (LLMs). Existing efforts for this problem either marginally alleviate the impact of noise without noise reduction, or rely on external LLMs that incur substantial…

Cited by 2SourcePDFScholar
2025

Revisiting Multi-Agent World Modeling from a Diffusion-Inspired Perspective

NeurIPS 2025poster

World models have recently attracted growing interest in Multi-Agent Reinforcement Learning (MARL) due to their ability to improve sample efficiency for policy learning. However, accurately modeling environments in MARL is challenging due to the exponentially large joint action space and highly unce…

Cited by 0SourcecodeScholar
2025

Segment Policy Optimization: Effective Segment-Level Credit Assignment in RL for Large Language Models

NeurIPS 2025poster

Enhancing the reasoning capabilities of large language models effectively using reinforcement learning (RL) remains a crucial challenge. Existing approaches primarily adopt two contrasting advantage estimation granularities: token-level methods (e.g., PPO) aim to provide fine-grained advantage signa…

Cited by 0SourcecodeScholar
2025

Tackling Data Corruption in Offline Reinforcement Learning via Sequence Modeling

ICLR 2025poster

Learning policy from offline datasets through offline reinforcement learning (RL) holds promise for scaling data-driven decision-making while avoiding unsafe and costly online interactions. However, real-world data collected from sensors or humans often contains noise and errors, posing a significan…

2024

Arithmetic Control of LLMs for Diverse User Preferences: Directional Preference Alignment with Multi-Objective Rewards

ACL 2024long

Fine-grained control over large language models (LLMs) remains a significant challenge, hindering their adaptability to diverse user needs. While Reinforcement Learning from Human Feedback (RLHF) shows promise in aligning LLMs, its reliance on scalar rewards often limits its ability to capture diver…

2024

Design-Modeling and Control of a Novel Wearable Exoskeleton for Lower-Limb Enhancement

RA-L 2024

In this paper, a novel powered lower limb exoskeleton prototype called PTEXO for reducing user burden and enhancing following comfort is presented. The PTEXO is designed with a new control strategy, Enhanced Sensitivity Amplification Control (ESAC), and improves comfort of lower-limb locomotion thro

Cited by 5SourceScholar
2024

Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning

ICML 2024spotlight

We study risk-sensitive reinforcement learning (RL), a crucial field due to its ability to enhance decision-making in scenarios where it is essential to manage uncertainty and minimize potential adverse outcomes. Particularly, our work focuses on applying the entropic risk measure to RL problems. Wh…

Cited by 2SourcePDFScholar
2024

Rewards-in-Context: Multi-objective Alignment of Foundation Models with Dynamic Preference Adjustment

ICML 2024poster

We consider the problem of multi-objective alignment of foundation models with human preferences, which is a critical step towards helpful and harmless AI systems. However, it is generally costly and unstable to fine-tune large foundation models using reinforcement learning (RL), and the multi-dimen…

2023

Gradient-Variation Bound for Online Convex Optimization with Constraints

AAAI 2023technical

We study online convex optimization with constraints consisting of multiple functional constraints and a relatively simple constraint set, such as a Euclidean ball. As enforcing the constraints at each time step through projections is computationally challenging in general, we allow decisions to vio…

Cited by 1SourcePDFScholar
2023

Optimistic Exploration with Learned Features Provably Solves Markov Decision Processes with Neural Dynamics

ICLR 2023poster

Incorporated with the recent advances in deep learning, deep reinforcement learning (DRL) has achieved tremendous success in empirical study. However, analyzing DRL is still challenging due to the complexity of the neural network class. In this paper, we address such a challenge by analyzing the Mar…

Cited by 4SourcePDFScholar
2023

Posterior Sampling for Competitive RL: Function Approximation and Partial Observation

NeurIPS 2023poster

This paper investigates posterior sampling algorithms for competitive reinforcement learning (RL) in the context of general function approximations. Focusing on zero-sum Markov games (MGs) under two critical settings, namely self-play and adversarial learning, we first propose the self-play and adve…

Cited by 4SourcePDFScholar
2022

Contrastive UCB: Provably Efficient Contrastive Self-Supervised Learning in Online Reinforcement Learning

ICML 2022spotlight

In view of its power in extracting feature representation, contrastive self-supervised learning has been successfully integrated into the practice of (deep) reinforcement learning (RL), leading to efficient policy learning on various applications. Despite its tremendous empirical successes, the unde…

2021

On Reward-Free RL with Kernel and Neural Function Approximations: Single-Agent MDP and Markov Game

ICML 2021oral

To achieve sample efficiency in reinforcement learning (RL), it necessitates to efficiently explore the underlying environment. Under the offline setting, addressing the exploration challenge lies in collecting an offline dataset with sufficient coverage. Motivated by such a challenge, we study the…

Cited by 31SourcePDFScholar
2021

Provably Efficient Fictitious Play Policy Optimization for Zero-Sum Markov Games with Structured Transitions

ICML 2021oral

While single-agent policy optimization in a fixed environment has attracted a lot of research attention recently in the reinforcement learning community, much less is known theoretically when there are multiple agents playing in a potentially competitive environment. We take steps forward by proposi…

Cited by 15SourcePDFScholar
2020

Robust One-Bit Recovery via ReLU Generative Networks: Near-Optimal Statistical Rate and Global Landscape Analysis

ICML 2020poster

We study the robust one-bit compressed sensing problem whose goal is to design an algorithm that faithfully recovers any sparse target vector $\theta_0\in\mathbb{R}^d$ \emph{uniformly} via $m$ quantized noisy measurements. Specifically, we consider a new framework for this problem where the sparsity…

Cited by 22SourcePDFScholar
2020

Upper Confidence Primal-Dual Reinforcement Learning for CMDP with Adversarial Loss

NeurIPS 2020poster

We consider online learning for episodic stochastically constrained Markov decision processes (CMDP), which plays a central role in ensuring the safety of reinforcement learning. Here the loss function can vary arbitrarily across the episodes, whereas both the loss received and the budget consumptio…

Cited by 61SourcePDFScholar