{"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/pyraformer-low-complexity-pyramidal-attention","title":"Pyraformer: Low-Complexity Pyramidal Attention for Long-Range Time Series Modeling and Forecasting","arxiv_id":null,"date":"2021-09-29","proceeding":"ICLR 2022 4","authors":["Shizhan Liu","Hang Yu","Cong Liao","Jianguo Li","Weiyao Lin","Alex X. Liu","Schahram Dustdar"],"abstract":"Accurate prediction of the future given the past based on time series data is of paramount importance, since it opens the door for decision making and risk management ahead of time. In practice, the challenge is to build a flexible but parsimonious model that can capture a wide range of temporal dependencies. In this paper, we propose Pyraformer by exploring the multiresolution representation of the time series. Specifically, we introduce the pyramidal attention module (PAM) in which the inter-scale tree structure summarizes features at different resolutions and the intra-scale neighboring connections model the temporal dependencies of different ranges. Under mild conditions, the maximum length of the signal traversing path in Pyraformer is a constant (i.e., $\\mathcal O(1)$) with regard to the sequence length $L$, while its time and space complexity scale linearly with $L$. Extensive numerical results show that Pyraformer typically achieves the highest prediction accuracy in both single-step and long-range forecasting tasks with the least amount of time and memory consumption, especially when the sequence is long. Full code will be available at the time of publication.","url_abs":"https://openreview.net/forum?id=0EXmFzUn5I","url_pdf":"https://openreview.net/pdf?id=0EXmFzUn5I","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":"pyraformer-low-complexity-pyramidal-attention","repo_url":"https://github.com/WenjieDu/PyPOTS","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"pyraformer-low-complexity-pyramidal-attention","repo_url":"https://github.com/AndrzejMiskow/TradeAI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"pyraformer-low-complexity-pyramidal-attention","repo_url":"https://github.com/alipay/Pyraformer","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"management","task_name":"Management"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"WenjieDu/PyPOTS","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":8,"harvested_for":["1706.03762","2012.07436","2101.10318","2103.07719","2106.13008","2211.14730","2312.16427","2404.08472"],"harvested_for_calls":[{"arxiv_id":"1706.03762","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.03762"},"call":"get_harvested_code_for_paper(arxiv_id=\"1706.03762\")"},{"arxiv_id":"2012.07436","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2012.07436"},"call":"get_harvested_code_for_paper(arxiv_id=\"2012.07436\")"},{"arxiv_id":"2101.10318","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2101.10318"},"call":"get_harvested_code_for_paper(arxiv_id=\"2101.10318\")"},{"arxiv_id":"2103.07719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.07719"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.07719\")"},{"arxiv_id":"2106.13008","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.13008"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.13008\")"},{"arxiv_id":"2211.14730","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2211.14730"},"call":"get_harvested_code_for_paper(arxiv_id=\"2211.14730\")"},{"arxiv_id":"2312.16427","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2312.16427"},"call":"get_harvested_code_for_paper(arxiv_id=\"2312.16427\")"},{"arxiv_id":"2404.08472","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2404.08472"},"call":"get_harvested_code_for_paper(arxiv_id=\"2404.08472\")"}]},{"repo":"AndrzejMiskow/TradeAI","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2012.07436"],"harvested_for_calls":[{"arxiv_id":"2012.07436","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2012.07436"},"call":"get_harvested_code_for_paper(arxiv_id=\"2012.07436\")"}]},{"repo":"alipay/Pyraformer","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"d15ab37a76fce96d2809e00c0bbc00fdeedd9f70921662a4da57161da6e1b0dd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}