Shangdong Yang
Orcid: 0000-0001-5379-9539
According to our database1,
Shangdong Yang
authored at least 22 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
IEEE Trans. Cybern., August, 2024
Modeling Rationality: Toward Better Performance Against Unknown Agents in Sequential Games.
IEEE Trans. Cybern., May, 2024
Neural Networks, 2024
Knowl. Based Syst., 2024
Proceedings of the IEEE International Conference on Acoustics, 2024
2023
Knowl. Based Syst., October, 2023
Leveraging transition exploratory bonus for efficient exploration in Hard-Transiting reinforcement learning problems.
Future Gener. Comput. Syst., August, 2023
Effective Interpretable Policy Distillation via Critical Experience Point Identification.
IEEE Intell. Syst., 2023
Proceedings of the Uncertainty in Artificial Intelligence, 2023
Convergence Analysis of Graphical Game-Based Nash Q-Learning using the Interaction Detection Signal of N-Step Return.
Proceedings of the IEEE International Conference on Acoustics, 2023
Enhancing OOD Generalization in Offline Reinforcement Learning with Energy-Based Policy Optimization.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023
Learning Explicit Credit Assignment for Cooperative Multi-Agent Reinforcement Learning via Polarization Policy Gradient.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
CoRR, 2022
GUARD: Multigranularity-based Unsupervised Anomaly Detection Algorithm for Multivariate Time Series.
Proceedings of the 8th IEEE International Conference on Cloud Computing and Intelligent Systems, 2022
2021
An Optimal Algorithm for the Stochastic Bandits While Knowing the Near-Optimal Mean Reward.
IEEE Trans. Neural Networks Learn. Syst., 2021
2020
Contextual Bandits With Hidden Features to Online Recommendation via Sparse Interactions.
IEEE Intell. Syst., 2020
2019
A Contextual Bandit Approach to Personalized Online Recommendation via Sparse Interactions.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2019
2018
An Optimal Algorithm for the Stochastic Bandits with Knowing Near-optimal Mean Reward.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2016
Incremental Nonnegative Matrix Factorization Based on Matrix Sketching and k-means Clustering.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2016, 2016
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016