
OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Boosting Offline Reinforcement Learning with Residual Generative Modeling
Hua Wei, Deheng Ye, Zhao Liu, et al.
(2021), pp. 3574-3580
Open Access | Times Cited: 3
Hua Wei, Deheng Ye, Zhao Liu, et al.
(2021), pp. 3574-3580
Open Access | Times Cited: 3
Showing 3 citing articles:
Generative AI in mobile networks: a survey
Athanasios Karapantelakis, Pegah Alizadeh, Abdulrahman Al-Abassi, et al.
Annals of Telecommunications (2023) Vol. 79, Iss. 1-2, pp. 15-33
Closed Access | Times Cited: 32
Athanasios Karapantelakis, Pegah Alizadeh, Abdulrahman Al-Abassi, et al.
Annals of Telecommunications (2023) Vol. 79, Iss. 1-2, pp. 15-33
Closed Access | Times Cited: 32
UAC: Offline Reinforcement Learning With Uncertain Action Constraint
Jiayi Guan, Shangding Gu, Zhijun Li, et al.
IEEE Transactions on Cognitive and Developmental Systems (2023) Vol. 16, Iss. 2, pp. 671-680
Closed Access | Times Cited: 4
Jiayi Guan, Shangding Gu, Zhijun Li, et al.
IEEE Transactions on Cognitive and Developmental Systems (2023) Vol. 16, Iss. 2, pp. 671-680
Closed Access | Times Cited: 4
Compressive Features in Offline Reinforcement Learning for Recommender Systems
Minh Phạm, Hung T. Nguyen, Long H. Dang, et al.
2021 IEEE International Conference on Big Data (Big Data) (2021), pp. 5719-5726
Open Access | Times Cited: 3
Minh Phạm, Hung T. Nguyen, Long H. Dang, et al.
2021 IEEE International Conference on Big Data (Big Data) (2021), pp. 5719-5726
Open Access | Times Cited: 3