{"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/co-evolutionary-multi-task-learning-for","title":"Co-evolutionary multi-task learning for dynamic time series prediction","arxiv_id":"1703.01887","date":"2017-02-27","proceeding":null,"authors":["Rohitash Chandra","Yew-Soon Ong","Chi-Keong Goh"],"abstract":"Time series prediction typically consists of a data reconstruction phase\nwhere the time series is broken into overlapping windows known as the timespan.\nThe size of the timespan can be seen as a way of determining the extent of past\ninformation required for an effective prediction. In certain applications such\nas the prediction of wind-intensity of storms and cyclones, prediction models\nneed to be dynamic in accommodating different values of the timespan. These\napplications require robust prediction as soon as the event takes place. We\nidentify a new category of problem called dynamic time series prediction that\nrequires a model to give prediction when presented with varying lengths of the\ntimespan. In this paper, we propose a co-evolutionary multi-task learning\nmethod that provides a synergy between multi-task learning and co-evolutionary\nalgorithms to address dynamic time series prediction. The method features\neffective use of building blocks of knowledge inspired by dynamic programming\nand multi-task learning. It enables neural networks to retain modularity during\ntraining for making a decision in situations even when certain inputs are\nmissing. The effectiveness of the method is demonstrated using one-step-ahead\nchaotic time series and tropical cyclone wind-intensity prediction.","url_abs":"http://arxiv.org/abs/1703.01887v2","url_pdf":"http://arxiv.org/pdf/1703.01887v2.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":"co-evolutionary-multi-task-learning-for","repo_url":"https://github.com/rohitash-chandra/CMTL_dynamictimeseries","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"time-series-prediction","task_name":"Time Series Prediction"}],"methods":[],"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":"rohitash-chandra/CMTL_dynamictimeseries","kind":"official","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":"c6839683523a33cee66ca9fd7c10cf377735ecc0275db1280b5ff8e1da984b35","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}