Arrow Research search

Author name cluster

Min Cheng

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

NeurIPS Conference 2023 Conference Paper

Natural Actor-Critic for Robust Reinforcement Learning with Function Approximation

  • Ruida Zhou
  • Tao Liu
  • Min Cheng
  • Dileep Kalathil
  • P. R. Kumar
  • Chao Tian

We study robust reinforcement learning (RL) with the goal of determining a well-performing policy that is robust against model mismatch between the training simulator and the testing environment. Previous policy-based robust RL algorithms mainly focus on the tabular setting under uncertainty sets that facilitate robust policy evaluation, but are no longer tractable when the number of states scales up. To this end, we propose two novel uncertainty set formulations, one based on double sampling and the other on an integral probability metric. Both make large-scale robust RL tractable even when one only has access to a simulator. We propose a robust natural actor-critic (RNAC) approach that incorporates the new uncertainty sets and employs function approximation. We provide finite-time convergence guarantees for the proposed RNAC algorithm to the optimal robust policy within the function approximation error. Finally, we demonstrate the robust performance of the policy learned by our proposed RNAC approach in multiple MuJoCo environments and a real-world TurtleBot navigation task.

AAAI Conference 2018 Short Paper

Deep Modeling of Social Relations for Recommendation

  • Wenqi Fan
  • Qing Li
  • Min Cheng

Social-based recommender systems have been recently proposed by incorporating social relations of users to alleviate sparsity issue of user-to-item rating data and to improve recommendation performance. Many of these social-based recommender systems linearly combine the multiplication of social features between users. However, these methods lack the ability to capture complex and intrinsic non-linear features from social relations. In this paper, we present a deep neural network based model to learn non-linear features of each user from social relations, and to integrate into probabilistic matrix factorization for rating prediction problem. Experiments demonstrate the advantages of the proposed method over stateof-the-art social-based recommender systems.

AAMAS Conference 2011 Conference Paper

Towards Robot Incremental Learning Constraints from Comparative Demonstration

  • Rong Zhang
  • Shangfei Wang
  • Xiaoping Chen
  • Dong Yin
  • Shijia Chen
  • Min Cheng
  • Yanpeng Lv
  • Jianmin Ji

This paper presents an attempt on incremental robot learning from demonstration. Based on previously learnt knowledge about a task in simpler situations, a robot learns to fulfill the same task properly in a more complicated situation through analyzing comparative demonstrations and extracting new knowledge, especially the constraints that the task in the new situation imposes on the robot's behaviors.

v2026.09.13