Author
Listed:
- Gautam Gupta
- Priyanshi Goel
- Divyanshi Verma
- Amarjit Malhotra
Abstract
Industry experts as well as academic scholars have directed substantial attention toward researching stock market volatility. Most of the past research has focused on using singular features such as closing prices, opening prices, or news stories to predict stock movement. In recent times, there has been a growing interest in using multimodal graph neural networks which can analyze a variety of features. Most of these methods focus on node aggregation to extract relevant features from related stocks to further improve model accuracy. The current state‐of‐the‐art model—ML‐GAT: Multilevel Graph Attention Model—constructs a graph network between the stocks using Wikidata relations. It uses multiple layers of graph attention to aggregate features such as historical price features and current news. However, the high number of intercompany relationships in ML‐GAT may include irrelevant and noisy edges. It also uses individual attention coefficients for each layer, leading to inefficient utilization of computational resources. To overcome these challenges, a Sparse Graph Attention Network for Stock Prediction (SGAT‐SP) is proposed in this paper. SGAT‐SP uses a single set of attention coefficients to reduce training and inference time. It assigns a binary mask to every edge which represents whether they will be used for node aggregation to reduce noisy edges. The proposed approach achieves an average accuracy score of 0.83, a slight improvement over ML‐GAT, which has an accuracy score of 0.827. Additionally, it significantly reduces inference time by 85%, resulting in faster results and decreased computational expenses.
Suggested Citation
Gautam Gupta & Priyanshi Goel & Divyanshi Verma & Amarjit Malhotra, 2026.
"SGAT‐SP: Sparse Graph Attention Network for Stock Prediction,"
Journal of Forecasting, John Wiley & Sons, Ltd., vol. 45(6), pages 2942-2953, September.
Handle:
RePEc:wly:jforec:v:45:y:2026:i:6:p:2942-2953
DOI: 10.1002/for.70169
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jforec:v:45:y:2026:i:6:p:2942-2953. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www3.interscience.wiley.com/cgi-bin/jhome/2966 .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.