Shangdong Yang

Orcid: 0000-0001-5379-9539

According to our database1, Shangdong Yang authored at least 17 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Online attentive kernel-based temporal difference learning.
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

Modified Retrace for Off-Policy Temporal Difference Learning.
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
New Galois hulls of generalized Reed-Solomon codes.
Finite Fields Their Appl., 2022

Learning Credit Assignment for Cooperative Reinforcement Learning.
CoRR, 2022

Keeping Minimal Experience to Achieve Efficient Interpretable Policy Distillation.
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

Efficient Average Reward Reinforcement Learning Using Constant Shifting Values.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016


  Loading...