{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/deep-reinforcement-learning-for-time-series","title":"Deep reinforcement learning for time series: playing idealized trading games","arxiv_id":"1803.03916","date":"2018-03-11","proceeding":null,"authors":["Xiang Gao"],"abstract":"Deep Q-learning is investigated as an end-to-end solution to estimate the\noptimal strategies for acting on time series input. Experiments are conducted\non two idealized trading games. 1) Univariate: the only input is a wave-like\nprice time series, and 2) Bivariate: the input includes a random stepwise price\ntime series and a noisy signal time series, which is positively correlated with\nfuture price changes. The Univariate game tests whether the agent can capture\nthe underlying dynamics, and the Bivariate game tests whether the agent can\nutilize the hidden relation among the inputs. Stacked Gated Recurrent Unit\n(GRU), Long Short-Term Memory (LSTM) units, Convolutional Neural Network (CNN),\nand multi-layer perceptron (MLP) are used to model Q values. For both games,\nall agents successfully find a profitable strategy. The GRU-based agents show\nbest overall performance in the Univariate game, while the MLP-based agents\noutperform others in the Bivariate game.","url_abs":"http://arxiv.org/abs/1803.03916v1","url_pdf":"http://arxiv.org/pdf/1803.03916v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"deep-reinforcement-learning-for-time-series","repo_url":"https://github.com/golsun/deep-RL-time-series","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"deep-reinforcement-learning-for-time-series","repo_url":"https://github.com/siddharthnishtala/DQN-Trader","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"q-learning","task_name":"Q-Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[{"method_slug":"q-learning","method_name":"Q-Learning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"golsun/deep-RL-time-series","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"siddharthnishtala/DQN-Trader","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a2b9f7e4a49913d158fa3d4c1ba3fef1ced25e0ad630c0963b84bb1db4c3c4d7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}