Xing Chen

Dr. Xing Chen

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
XCXing Chen
Xing Chen
DDDongcui Diao
Dongcui Diao
HCHechang Chen
Hechang Chen
HYHengshuai Yao
Hengshuai Yao
HPHaiyin Piao
Haiyin Piao
YCYi Chang
Yi Chang
The popular Proximal Policy Optimization (PPO) algorithm approximates the solution in a clipped policy space. Does there exist better policies outside of this space? By using a novel surrogate objective that employs the sigmoid function (which provides an interesting way of exploration), we found that the answer is "YES", and the better policies are in fact located very far from the clipped space. We show that PPO is insufficient in "off-policyness", according to an off-policy metric called DEON. Our algorithm explores in a much larger policy space than PPO, and it maximizes the Conservative Policy Iteration (CPI) objective better than PPO during training. To the best of our knowledge, all current PPO methods have the clipping operation and optimize in the clipped policy space. Our method is the first of this kind, which advances the understanding of CPI optimization and policy gradient methods. Code is available at https://github.com/raincchio/P3O.

20 May 2022 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
YLYinan Lu
Yinan Lu
YZYan Zhao
Yan Zhao
XCXing Chen
Xing Chen
XGXiaoxin Guo
Xiaoxin Guo
Medical multiobjective image segmentation aims to group pixels to form multiple regions based on the different properties of the medical images. Segmenting the 3D cardiovascular magnetic resonance (CMR) images is still a challenging task owing to several reasons, including individual differences in heart shapes, varying signal intensities, and differences in data signal-to-noise ratios. This paper proposes a novel and efficient U-Net-based 3D sparse convolutional network named SparseVoxNet. In this network, there are direct connections between any two layers with the same feature-map size, and the number of connections is reduced. Therefore, the SparseVoxNet can effectively cope with the optimization problem of gradients vanishing when training a 3D deep neural network model on small sample data by significantly decreasing the network depth, and achieveing better feature representation using a spatial self-attention mechanism finally. The proposed method in this paper has been thoroughly evaluated on the HVSMR 2016 dataset. Compared with other methods, the method achieves better performance.

1 September 2012 in Information Processing Letters
Verified
Journal Article
Closed access
XCXing Chen
Xing Chen
JLJuan LIU
Juan LIU
JMJixiang Meng
Jixiang Meng

30 January 2025 in Pattern Recognition
Verified
Journal Article
Closed access
SZShutong Zhang
Shutong Zhang
XCXing Chen
Xing Chen
ZLZhaogeng Liu
Zhaogeng Liu
HCHechang Chen
Hechang Chen
YCYi Chang
Yi Chang

19 November 2025 in Pattern Recognition
Verified
Journal Article
Closed access
XCXing Chen
Xing Chen
HCHechang Chen
Hechang Chen
YCYi Chang
Yi Chang

4 December 2025 in Pattern Recognition
Verified
Journal Article
Closed access
HCHaotian Chi
Haotian Chi
ZLZhaogeng Liu
Zhaogeng Liu
XCXing Chen
Xing Chen
BQBohao Qu
Bohao Qu
JHJifeng Hu
Jifeng Hu
YCYi Chang
Yi Chang