Stock Price Prediction Using TD3

Main Article Content

Dr. Ankita V karale
Tejas Verma
Harshal Sonawane
Tejas Patil
Vivek Chaudhari

Abstract

Financial markets are complex, dynamic, and highly non-linear systems where conventional rule-based trading models struggle to adapt to changing price patterns. This work presents a reinforcement-learning-driven framework for stock price prediction and trading strategy optimization based on the Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm. The proposed system integrates data preprocessing, environment simulation, and policy training into a reproducible end-to-end pipeline that functions efficiently even on limited hardware resources


The study addresses key challenges such as non-stationarity, transaction costs, and risk-adjusted performance by embedding drawdown penalties and portfolio constraints directly into the learning process. Unlike discrete-action methods, TD3 enables continuous position sizing, leading to smoother and more realistic trade execution. The implementation follows an Agile development approach, ensuring iterative validation and reproducibility across data sources. Evaluation metrics such as Sharpe ratio, total return, and maximum drawdown are employed to assess agent performance


Experimental results validate that modern reinforcement-learning techniques can produce adaptive, risk-aware trading policies capable of outperforming traditional heuristic systems. The proposed architecture thus bridges the gap between theoretical DRL algorithms and practical algorithmic-trading applications, offering a scalable foundation for future quantitative-finance research.

Article Details

How to Cite
karale, D. A. V., Verma, T., Sonawane, H., Patil, T., & Chaudhari, V. (2025). Stock Price Prediction Using TD3. International Journal on Advanced Computer Engineering and Communication Technology, 14(1), 671–675. Retrieved from https://journals.mriindia.com/index.php/ijacect/article/view/750
Section
Articles

Similar Articles

<< < 5 6 7 8 9 10 11 > >> 

You may also start an advanced similarity search for this article.