Evidence map›Paper›PMID 41238637›Full record

ArticleScientific reports2025

Enhanced exploration in reinforcement learning using graph neural network based intrinsic reward mechanism.

J Arun Pandian, Ramkumar Thirunavukarasu, Rajganesh Nagarajan

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

J Arun PandianSchool of Computer Science Engineering and Information Systems, Vellore Institute of Technology, Vellore, India. arunpandian.j@vit.ac.in.
Ramkumar ThirunavukarasuSchool of Computer Science Engineering and Information Systems, Vellore Institute of Technology, Vellore, India. ramkumar.thirunavukarasu@vit.ac.in.
Rajganesh NagarajanSri Venkateswara College of Engineering, Sriperumbudur, India.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We propose a Graph Neural Network-based Intrinsic Reward Learning (GNN-IRL) framework to address the exploration-exploitation trade-off in Reinforcement Learning (RL). This approach leverages the structural modeling capabilities of Graph Neural Networks (GNNs) to represent the transitions and relationships between states in the environment. Intrinsic rewards are computed based on centrality measures and inverse degree analysis within the state graph, enabling the agent to identify and explore novel or under-visited states. The effectiveness of GNN-IRL was validated in four benchmark environments with discrete action spaces: CartPole-v1, MountainCar-v0, Taxi-v3, and LunarLander-v3. Continuous state variables were discretized to construct state graphs, which facilitates the implementation of GNN-IRL but may limit scalability to very high-dimensional continuous spaces. The experimental results show that GNN-IRL outperforms state-of-the-art extrinsic and intrinsic exploration strategies in terms of convergence rate, cumulative reward, exploration efficiency, and state coverage. These findings demonstrate that GNN-IRL effectively balances exploration and exploitation, thereby improving sample efficiency and accelerating policy learning in discretized RL domains.

Indexed as

Exploration–exploitation trade-offGraph neural networksIntrinsic rewardReinforcement learningState space exploration

Identifiers

PMID41238637
PMCPMC12618532

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.