{"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/domain-adversarial-spatial-temporal-network-a","title":"Domain Adversarial Spatial-Temporal Network: A Transferable Framework for Short-term Traffic Forecasting across Cities","arxiv_id":"2202.03630","date":"2022-02-08","proceeding":null,"authors":["Yihong Tang","Ao Qu","Andy H. F. Chow","William H. K. Lam","S. C. Wong","Wei Ma"],"abstract":"Accurate real-time traffic forecast is critical for intelligent transportation systems (ITS) and it serves as the cornerstone of various smart mobility applications. Though this research area is dominated by deep learning, recent studies indicate that the accuracy improvement by developing new model structures is becoming marginal. Instead, we envision that the improvement can be achieved by transferring the \"forecasting-related knowledge\" across cities with different data distributions and network topologies. To this end, this paper aims to propose a novel transferable traffic forecasting framework: Domain Adversarial Spatial-Temporal Network (DASTNet). DASTNet is pre-trained on multiple source networks and fine-tuned with the target network's traffic data. Specifically, we leverage the graph representation learning and adversarial domain adaptation techniques to learn the domain-invariant node embeddings, which are further incorporated to model the temporal traffic data. To the best of our knowledge, we are the first to employ adversarial multi-domain adaptation for network-wide traffic forecasting problems. DASTNet consistently outperforms all state-of-the-art baseline methods on three benchmark datasets. The trained DASTNet is applied to Hong Kong's new traffic detectors, and accurate traffic predictions can be delivered immediately (within one day) when the detector is available. Overall, this study suggests an alternative to enhance the traffic forecasting methods and provides practical implications for cities lacking historical traffic data.","url_abs":"https://arxiv.org/abs/2202.03630v2","url_pdf":"https://arxiv.org/pdf/2202.03630v2.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":"domain-adversarial-spatial-temporal-network-a","repo_url":"https://github.com/yihongt/dastnet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"graph-mining","task_name":"Graph Mining"},{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"spatio-temporal-forecasting","task_name":"Spatio-Temporal Forecasting"},{"task_slug":"time-series-forecasting","task_name":"Time Series Forecasting"},{"task_slug":"time-series-regression","task_name":"Time Series Regression"},{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[{"method_slug":"gin","method_name":"GIN"},{"method_slug":"gru","method_name":"GRU"},{"method_slug":"node2vec","method_name":"node2vec"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/traffic-prediction-on-pemsd4-10-days-training","task":"Traffic Prediction","dataset":"PeMSD4 (10 days' training data, 15min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"19.25","MAPE":"13.30","RMSE":"28.91"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd4-10-days-training-1","task":"Traffic Prediction","dataset":"PeMSD4 (10 days' training data, 30min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"20.67","MAPE":"14.56","RMSE":"30.78"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd4-10-days-training-2","task":"Traffic Prediction","dataset":"PeMSD4 (10 days' training data, 60min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"22.82","MAPE":"16.1","RMSE":"33.77"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd7-10-days-training","task":"Traffic Prediction","dataset":"PeMSD7 (10 days' training data, 15min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"20.91","MAPE":"8.95","RMSE":"31.85"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd7-10-days-training-1","task":"Traffic Prediction","dataset":"PeMSD7 (10 days' training data, 30min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"22.96","MAPE":"9.87","RMSE":"34.8"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd7-10-days-training-2","task":"Traffic Prediction","dataset":"PeMSD7 (10 days' training data, 60min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"26.88","MAPE":"11.75","RMSE":"40.12"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd8-10-days-training","task":"Traffic Prediction","dataset":"PeMSD8 (10 days' training data, 15min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"15.26","MAPE":"9.64","RMSE":"22.7"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd8-10-days-training-1","task":"Traffic Prediction","dataset":"PeMSD8 (10 days' training data, 30min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"16.41","MAPE":"10.46","RMSE":"24.57"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd8-10-days-training-2","task":"Traffic Prediction","dataset":"PeMSD8 (10 days' training data, 60min)","model":"DASTNet","rank_in_archive_order":1,"of":1,"metrics":{"MAE":"18.84","MAPE":"11.72","RMSE":"28.06"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2202.03630","atlas_url":"https://app.syntology.ai/?focus=2202.03630","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2202.03630"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2202.03630\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2202.03630"},"call":"get_concepts_for_paper(arxiv_id=\"2202.03630\")"}],"by_repo":[{"repo":"yihongt/dastnet","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":"9ec4f97087c0dd0864d53a935ffa01588313365c8fab533a5f800184736c7d93","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}