Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/138942
題名: 應用深度雙Q網路於股票自動交易系統
Double Deep Q-Network in Automated Stock Trading
作者: 黃冠棋
Huang, Kuan-Chi
貢獻者: 蔡炎龍
黃冠棋
Huang, Kuan-Chi
關鍵詞: 深度強化學習
神經網路
Q學習
深度雙Q網路
股票交易
Deep reinforcement learning
Neural network
Q-learning
DDQN
Stocks trading
日期: 2021
上傳時間: 10-Feb-2022
摘要: 本篇文章使用了強化學習結合深度學習的技術去訓練自動交易系統,我們分別建立了深度卷積網路和全連接網路去預測動作的Q值,並使用DDQN的模型去更新我們的動作價值。我們的交易系統每天採用10天前的股票資訊,去預測股票的趨勢,並最大化我們的利益。\n\nDDQN是一種深度強化學習模型,透過建立目標網路和調整誤差函數使得他能夠避免DQN的過估計問題,並得到更好的效能,在我們的實驗中,我們得到了一個良好的效果,證明DDQN在自動交易系統上是有效的。
In this paper, we use the artificial neural network combined with reinforcement learning to train the automated trading system. We construct the CNN model and the fully-connected model to predict the Q-values of the actions and use the algorithm of DDQN to correct the TD error. According to past 10 days data, the system predicts the trend of the stocks and maximize our profit.\n\nDDQN is a deep reinforcement model, which is an improvement of DQN, build the target network and modify loss function to avoid overestimation and get better performance. In our experiment, we get a good result that DDQN is feasible on automated trading systems.
參考文獻: [1] Fei-Ting Chen. Convolutional deep q-learning for etf automated trading system, 2017.\n[2] Ian Goodfellow, Yoshua Bengio, and Aaron Courville. Machine learning basics. Deep\nlearning, 1(7):98–164, 2016.\n[3] RobertHecht-Nielsen.Theoryofthebackpropagationneuralnetwork.InNeuralnetworks\nfor perception, pages 65–93. Elsevier, 1992.\n[4] Yu-Ping Huang. A comparison of deep reinforcement learning models: The case of stock\nautomated trading system, 2021.\n[5] Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning\napplied to document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998.\n[6] Moshe Leshno, Vladimir Ya Lin, Allan Pinkus, and Shimon Schocken. Multilayer feedforward networks with a nonpolynomial activation function can approximate any function. Neural networks, 6(6):861–867, 1993.\n[7] Timothy P Lillicrap, Jonathan J Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. arXiv preprint arXiv:1509.02971, 2015.\n[8] Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, and Martin Riedmiller. Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602, 2013.\n[9] Jerome H Saltzer, David P Reed, and David D Clark. End-to-end arguments in system design. ACM Transactions on Computer Systems (TOCS), 2(4):277–288, 1984.\n31\n[10] David Silver, Aja Huang, Chris J Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al. Mastering the game of go with deep neural networks and tree search. nature, 529(7587):484–489, 2016.\n[11] David Silver, Guy Lever, Nicolas Heess, Thomas Degris, Daan Wierstra, and Martin Riedmiller. Deterministic policy gradient algorithms. In International conference on machine learning, pages 387–395. PMLR, 2014.\n[12] Richard S Sutton, David A McAllester, Satinder P Singh, and Yishay Mansour. Policy gradient methods for reinforcement learning with function approximation. In Advances in neural information processing systems, pages 1057–1063, 2000.\n[13] Hado Van Hasselt, Arthur Guez, and David Silver. Deep reinforcement learning with double q-learning. In Proceedings of the AAAI conference on artificial intelligence, volume 30, 2016.\n[14] Christopher John Cornish Hellaby Watkins. Learning from delayed rewards. 1989.\n[15] Bayya Yegnanarayana. Artificial neural networks. PHI Learning Pvt. Ltd., 2009.
描述: 碩士
國立政治大學
應用數學系
107751007
資料來源: http://thesis.lib.nccu.edu.tw/record/#G0107751007
資料類型: thesis
Appears in Collections:學位論文

Files in This Item:
File Description SizeFormat
100701.pdf1.55 MBAdobe PDF2View/Open
Show full item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.