default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShangdong Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Shaokang Dong
, Chao Li, Shangdong Yang, Wenbin Li, Yang Gao:
Decentralized Counterfactual Value with Threat Detection for Multi-Agent Reinforcement Learning in mixed cooperative and competitive environments. Expert Syst. Appl. 257: 125116 (2024)- [j10]Yunkai Zhuang, Yong Liu, Shangdong Yang, Yang Gao:
Selective policy transfer in multi-agent systems with sparse interactions. Knowl. Based Syst. 300: 112031 (2024) - [j9]Shaokang Dong, Chao Li, Shangdong Yang, Bo An, Wenbin Li, Yang Gao:
Egoism, utilitarianism and egalitarianism in multi-agent reinforcement learning. Neural Networks 178: 106544 (2024) - [j8]Zhenxing Ge, Shangdong Yang, Pinzhuo Tian, Zixuan Chen, Yang Gao:
Modeling Rationality: Toward Better Performance Against Unknown Agents in Sequential Games. IEEE Trans. Cybern. 54(5): 2966-2977 (2024) - [j7]Shaokang Dong, Hangyu Mao, Shangdong Yang, Shengyu Zhu, Wenbin Li, Jianye Hao, Yang Gao:
WToE: Learning When to Explore in Multiagent Reinforcement Learning. IEEE Trans. Cybern. 54(8): 4789-4801 (2024) - [c11]Chao Li, Shaokang Dong, Shangdong Yang, Hongye Cao, Wenbin Li, Yang Gao:
Multi-Agent Sparse Interaction Modeling is an Anomaly Detection Problem. ICASSP 2024: 5890-5894 - [c10]Chao Li, Yujing Hu, Shangdong Yang, Tangjie Lv, Changjie Fan, Wenbin Li, Chongjie Zhang, Yang Gao:
STAR: Spatio-Temporal State Compression for Multi-Agent Tasks with Rich Observations. IJCAI 2024: 120-128 - 2023
- [j6]Xiao Liu, Shuyang Liu, Bo An, Yang Gao, Shangdong Yang, Wenbin Li:
Effective Interpretable Policy Distillation via Critical Experience Point Identification. IEEE Intell. Syst. 38(5): 28-36 (2023) - [j5]Shangdong Yang, Huihui Wang, Shaokang Dong, Xingguo Chen:
Leveraging transition exploratory bonus for efficient exploration in Hard-Transiting reinforcement learning problems. Future Gener. Comput. Syst. 145: 442-453 (2023) - [j4]Xingguo Chen, Guang Yang, Shangdong Yang, Huihui Wang, Shaokang Dong, Yang Gao:
Online attentive kernel-based temporal difference learning. Knowl. Based Syst. 278: 110902 (2023) - [c9]Wubing Chen, Wenbin Li, Xiao Liu, Shangdong Yang, Yang Gao:
Learning Explicit Credit Assignment for Cooperative Multi-Agent Reinforcement Learning via Polarization Policy Gradient. AAAI 2023: 11542-11550 - [c8]Hongye Cao, Shangdong Yang, Jing Huo, Xingguo Chen, Yang Gao:
Enhancing OOD Generalization in Offline Reinforcement Learning with Energy-Based Policy Optimization. ECAI 2023: 335-342 - [c7]Yunkai Zhuang, Shangdong Yang, Wenbin Li, Yang Gao:
Convergence Analysis of Graphical Game-Based Nash Q-Learning using the Interaction Detection Signal of N-Step Return. ICASSP 2023: 1-5 - [c6]Xingguo Chen, Xingzhou Ma, Yang Li, Guang Yang, Shangdong Yang, Yang Gao:
Modified Retrace for Off-Policy Temporal Difference Learning. UAI 2023: 303-312 - 2022
- [j3]Yansheng Wu, Chengju Li, Shangdong Yang:
New Galois hulls of generalized Reed-Solomon codes. Finite Fields Their Appl. 83: 102084 (2022) - [c5]Fan Meng, Qunli Yang, Zhengda He, Shangdong Yang, Weidong Tang:
GUARD: Multigranularity-based Unsupervised Anomaly Detection Algorithm for Multivariate Time Series. CCIS 2022: 25-30 - [i3]Guang Yang, Xingguo Chen, Shangdong Yang, Huihui Wang, Shaokang Dong, Yang Gao:
Online Attentive Kernel-Based Temporal Difference Learning. CoRR abs/2201.09065 (2022) - [i2]Xiao Liu, Shuyang Liu, Wenbin Li, Shangdong Yang, Yang Gao:
Keeping Minimal Experience to Achieve Efficient Interpretable Policy Distillation. CoRR abs/2203.00822 (2022) - [i1]Wubing Chen, Wenbin Li, Xiao Liu, Shangdong Yang:
Learning Credit Assignment for Cooperative Reinforcement Learning. CoRR abs/2210.05367 (2022) - 2021
- [j2]Shangdong Yang, Yang Gao:
An Optimal Algorithm for the Stochastic Bandits While Knowing the Near-Optimal Mean Reward. IEEE Trans. Neural Networks Learn. Syst. 32(5): 2285-2291 (2021) - 2020
- [j1]Shangdong Yang, Hao Wang, Chenyu Zhang, Yang Gao:
Contextual Bandits With Hidden Features to Online Recommendation via Sparse Interactions. IEEE Intell. Syst. 35(5): 62-72 (2020)
2010 – 2019
- 2019
- [c4]Chenyu Zhang, Hao Wang, Shangdong Yang, Yang Gao:
A Contextual Bandit Approach to Personalized Online Recommendation via Sparse Interactions. PAKDD (2) 2019: 394-406 - 2018
- [c3]Shangdong Yang, Hao Wang, Yang Gao, Xingguo Chen:
An Optimal Algorithm for the Stochastic Bandits with Knowing Near-optimal Mean Reward. AAMAS 2018: 2130-2132 - 2016
- [c2]Shangdong Yang, Yang Gao, Bo An, Hao Wang, Xingguo Chen:
Efficient Average Reward Reinforcement Learning Using Constant Shifting Values. AAAI 2016: 2258-2264 - [c1]Chenyu Zhang, Hao Wang, Shangdong Yang, Yang Gao:
Incremental Nonnegative Matrix Factorization Based on Matrix Sketching and k-means Clustering. IDEAL 2016: 426-435
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
