activity
20232026
most citedA Finite Sample Complexity Bound for Distributionally Robust Q-learning

6 citations · 8 across the 17 of their papers we have counts for

collaborators
Showing 2026Show all

7 papers · 1 filter

cs.LG2026

Q-Learning with Stable Infinite-Dimensional Linear Function Approximation

Shengbo Wang

Q-learning with linear function approximation can be unstable because an arbitrary approximation architecture need not preserve the Bellman contraction. We develop a stable infinit…

math.OC2026

Lipschitz Regularity in Wasserstein Robust Stochastic Optimal Control

Shengbo Wang, Jose Blanchet

Robust Markov decision processes provide a principled framework for protecting sequential decision-making against transition-law misspecification and have attracted substantial rec…

math.OC2026

Fast Convergence of Policy Regret in Learning Stochastic Optimal Control

Shengbo Wang, Jose Blanchet, Peter Glynn

Policy learning in modern operations environments faces a fundamental tension between limited operational data and the large, often continuous, state and action spaces over which g…

cs.LG2026

Central Limit Theorem for Two-Time-Scale Approximate Distributionally Robust RL

Shengbo Wang, Zexi Zhang

Designing model-free algorithms for distributionally robust reinforcement learning (DRRL) poses fundamental challenges. The robust Bellman operator is nonlinear in the transition k…

math.OC2026

Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values

Shengbo Wang, Nian Si

We study non-rectangular robust Markov decision processes under the average-reward criterion, where the ambiguity set couples transition probabilities across states and the adversa…

cs.LG2026

Q-Measure-Learning for Continuous State RL: Efficient Implementation and Convergence

Shengbo Wang

We study reinforcement learning in infinite-horizon discounted Markov decision processes with continuous state spaces, where data are generated online from a single trajectory unde…

cs.LG2026

Achieving Dependence for Average-Reward Q-Learning with a New Contraction Principle

Zijun Chen, Zaiwei Chen, Nian Si +1

We present the convergence rates of synchronous and asynchronous Q-learning for average-reward Markov decision processes, where the absence of contraction poses a fundamental chall…