← Search

Weixin Wang

5 accepted papers

2026

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set

ICLR 2026poster

Recent years have witnessed increasing interests in tackling heteroscedastic noise in bandits and reinforcement learning \citep{zhou2021nearly, zhao2023variance, jia2024does, pacchiano2025second}. In these works, the cumulative variance of the noise $\Lambda = \sum_{t=1}^T \sigma_t^2$, where $\sigma…

Cited by 0Source ↗Scholar ↗
2026

Inverse Reinforcement Learning with Dynamic Reward Scaling for LLM Alignment

ICLR 2026poster

Alignment is vital for safely deploying large language models (LLMs). Existing techniques are either reward-based--train a reward model on preference pairs and optimize with reinforcement learning (RL)--or reward-free--directly fine-tune on ranked outputs. Recent research show that well-tuned reward…

Cited by 0Source ↗Scholar ↗
2025

A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time

UAI 2025

Large language models (LLMs) have played a pivotal role in revolutionizing various facets of our daily existence. Solving attention regression is a fundamental task in optimizing LLMs. In this work, we focus on providing a provable guarantee for the one-layer attention network objective function: gi

Cited by 0Source ↗PDF ↗Scholar ↗
2025

Sample Complexity of Distributionally Robust Off-Dynamics Reinforcement Learning with Online Interaction

ICML 2025poster

Off-dynamics reinforcement learning (RL), where training and deployment transition dynamics are different, can be formulated as learning in a robust Markov decision process (RMDP) where uncertainties in transition dynamics are imposed. Existing literature mostly assumes access to generative models a…

Cited by 0Source ↗PDF ↗Scholar ↗
2024

Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning

NeurIPS 2024poster

We present the first study on provably efficient randomized exploration in cooperative multi-agent reinforcement learning (MARL). We propose a unified algorithm framework for randomized exploration in parallel Markov Decision Processes (MDPs), and two Thompson Sampling (TS)-type algorithms, CoopTS-P…

Cited by 7Source ↗PDF ↗Scholar ↗