{"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/frequency-domain-mlps-are-more-effective-1","title":"Frequency-domain MLPs are More Effective Learners in Time Series Forecasting","arxiv_id":"2311.06184","date":"2023-11-10","proceeding":"NeurIPS 2023 11","authors":["Kun Yi","Qi Zhang","Wei Fan","Shoujin Wang","Pengyang Wang","Hui He","Defu Lian","Ning An","Longbing Cao","Zhendong Niu"],"abstract":"Time series forecasting has played the key role in different industrial, including finance, traffic, energy, and healthcare domains. While existing literatures have designed many sophisticated architectures based on RNNs, GNNs, or Transformers, another kind of approaches based on multi-layer perceptrons (MLPs) are proposed with simple structure, low complexity, and {superior performance}. However, most MLP-based forecasting methods suffer from the point-wise mappings and information bottleneck, which largely hinders the forecasting performance. To overcome this problem, we explore a novel direction of applying MLPs in the frequency domain for time series forecasting. We investigate the learned patterns of frequency-domain MLPs and discover their two inherent characteristic benefiting forecasting, (i) global view: frequency spectrum makes MLPs own a complete view for signals and learn global dependencies more easily, and (ii) energy compaction: frequency-domain MLPs concentrate on smaller key part of frequency components with compact signal energy. Then, we propose FreTS, a simple yet effective architecture built upon Frequency-domain MLPs for Time Series forecasting. FreTS mainly involves two stages, (i) Domain Conversion, that transforms time-domain signals into complex numbers of frequency domain; (ii) Frequency Learning, that performs our redesigned MLPs for the learning of real and imaginary part of frequency components. The above stages operated on both inter-series and intra-series scales further contribute to channel-wise and time-wise dependency learning. Extensive experiments on 13 real-world benchmarks (including 7 benchmarks for short-term forecasting and 6 benchmarks for long-term forecasting) demonstrate our consistent superiority over state-of-the-art methods.","url_abs":"https://arxiv.org/abs/2311.06184v1","url_pdf":"https://arxiv.org/pdf/2311.06184v1.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":"frequency-domain-mlps-are-more-effective-1","repo_url":"https://github.com/WenjieDu/PyPOTS","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"frequency-domain-mlps-are-more-effective-1","repo_url":"https://github.com/aikunyi/frets","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"frequency-domain-mlps-are-more-effective-1","repo_url":"https://github.com/master-plc/fredf","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series-forecasting","task_name":"Time Series Forecasting"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2311.06184","atlas_url":"https://app.syntology.ai/?focus=2311.06184","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":"2311.06184"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2311.06184\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2311.06184"},"call":"get_concepts_for_paper(arxiv_id=\"2311.06184\")"}],"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":"aikunyi/frets","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2411.01623"],"harvested_for_calls":[{"arxiv_id":"2411.01623","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2411.01623"},"call":"get_harvested_code_for_paper(arxiv_id=\"2411.01623\")"}]},{"repo":"master-plc/fredf","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2205.13504","2402.02399"],"harvested_for_calls":[{"arxiv_id":"2205.13504","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2205.13504"},"call":"get_harvested_code_for_paper(arxiv_id=\"2205.13504\")"},{"arxiv_id":"2402.02399","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.02399"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.02399\")"}]}],"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":"c35dc61bd227633f227353131c55aa55d864b2f8767e7451673c0f6835600dfa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}