Pengqian Yu

Pengqian Yu

Auto-generated profile, based on publicly available information

Pengqian Yu

IBM Research Singapore

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 October 2015 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
PYPengqian Yu
Pengqian Yu
HXHuan Xu
Huan Xu
This technical note studies Markov decision processes under parameter uncertainty. We adapt the distributionally robust optimization framework, assume that the uncertain parameters are random variables following an unknown distribution, and seek the strategy which maximizes the expected performance under the most adversarial distribution. In particular, we generalize a previous study which concentrates on distribution sets with very special structure to a considerably more generic class of distribution sets, and show that the optimal strategy can be obtained efficiently under mild technical conditions. This significantly extends the applicability of distributionally robust MDPs by incorporating probabilistic information of uncertainty in a more flexible way.

18 August 2019 in Optimization
Verified
Journal Article
Closed access
ZCZhi Chen
Zhi Chen
PYPengqian Yu
Pengqian Yu
WHWilliam B. Haskell
William B. Haskell
The distributionally robust Markov Decision Process (MDP) approach asks for a distributionally robust strategy that achieves the maximal expected total reward under the most adversarial distribution of uncertain parameters. In this paper, we study distributionally robust MDPs where ambiguity sets for the uncertain parameters are of a format that can easily incorporate in its description the generalized moment as well as statistical distance information of the uncertainty. In this way, we generalize existing works on distributionally robust MDPs with generalized-moment-based and statistical-distance-based ambiguity sets to incorporate information from the former class such as moments and dispersions to the latter class that critically depends on empirical observations of the uncertain parameters. We show that under this format of ambiguity sets, the resulting distributionally robust MDP remains tractable under mild technical conditions and a distributionally robust strategy can be constructed by solving a sequence of one-stage convex optimization subproblems through a Bellman type backward induction.

5 January 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
PYPengqian Yu
Pengqian Yu
WHWilliam B. Haskell
William B. Haskell
HXHuan Xu
Huan Xu
We consider large-scale Markov decision processes (MDPs) with a time-consistent risk measure of variability in cost under the risk-aware MDP paradigm. Previous studies showed that risk-aware MDPs, based on a minimax approach to handling risk, can be solved using dynamic programming for small- to medium-sized problems. However, due to the “curse of dimensionality,” MDPs that model real-life problems are typically prohibitively large for such approaches. In this technical note, we employ an approximate dynamic programming approach and develop a family of simulation-based algorithms to approximately solve large-scale risk-aware MDPs with time-consistent risk measures. In parallel, we develop a unified convergence analysis technique to derive sample complexity bounds for this new family of algorithms.

1 April 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WHWilliam B. Haskell
William B. Haskell
RJRahul Jain
Rahul Jain
HSHiteshi Sharma
Hiteshi Sharma
PYPengqian Yu
Pengqian Yu
We propose universal randomized function approximation-based empirical value learning (EVL) algorithms for Markov decision processes. The “empirical” nature comes from each iteration being done empirically from samples available from simulations of the next state. This makes the Bellman operator a random operator. A parametric and a nonparametric method for function approximation using a parametric function space and a reproducing kernel Hilbert space respectively are then combined with EVL. Both function spaces have the universal function approximation property. Basis functions are picked randomly. Convergence analysis is performed using a random operator framework with techniques from the theory of stochastic dominance. Finite time sample complexity bounds are derived for both universal approximate dynamic programming algorithms. Numerical experiments support the versatility and computational tractability of this approach.


7 July 2020 in arXiv
Verified
Preprint
Open access
PDF file
XDXinhan Di
Xinhan Di
PYPengqian Yu
Pengqian Yu
HZHong Zhu
Hong Zhu
LCLei Cai
Lei Cai
QSQiuyan Sheng
Qiuyan Sheng
CSChangyu Sun
Changyu Sun
In this paper, we propose an adversarial model for producing furniture layout for interior scene synthesis when the interior room is rotated. The proposed model combines a conditional adversarial network, a rotation module, a mode module, and a rotation discriminator module. As compared with the prior work on scene synthesis, our proposed three modules enhance the ability of auto-layout generation and reduce the mode collapse during the rotation of the interior room. We conduct our experiments on a proposed real-world interior layout dataset that contains 14400 designs from the professional designers. Our numerical results demonstrate that the proposed model yields higher-quality layouts for four types of rooms, including the bedroom, the bathroom, the study room, and the tatami room.