Zhaopeng Meng

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Guangyong Chen

> Home > Persons > Zhaopeng Meng

Publications

2021
[c29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/TangMCCCYZLH21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/TangMCCCYZLH21
Hongyao Tang, Zhaopeng Meng, Guangyong Chen, Pengfei Chen, Chen Chen, Yaodong Yang, Luo Zhang, Wulong Liu, Jianye Hao:
Foresee then Evaluate: Decomposing Value Estimation with Latent Future Prediction. AAAI 2021: 9834-9842
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2103-02225
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2103-02225
Hongyao Tang, Jianye Hao, Guangyong Chen, Pengfei Chen, Chen Chen, Yaodong Yang, Luo Zhang, Wulong Liu, Zhaopeng Meng:
Foresee then Evaluate: Decomposing Value Estimation with Latent Future Prediction. CoRR abs/2103.02225 (2021)
2019
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-11100
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-11100
Hongyao Tang, Jianye Hao, Guangyong Chen, Pengfei Chen, Zhaopeng Meng, Yaodong Yang, Li Wang:
Disentangling Dynamics and Returns: Value Function Decomposition with Future Prediction. CoRR abs/1905.11100 (2019)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.