{"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/fits-modeling-time-series-with-10k-parameters","title":"FITS: Modeling Time Series with $10k$ Parameters","arxiv_id":"2307.03756","date":"2023-07-06","proceeding":null,"authors":["Zhijian Xu","Ailing Zeng","Qiang Xu"],"abstract":"In this paper, we introduce FITS, a lightweight yet powerful model for time series analysis. Unlike existing models that directly process raw time-domain data, FITS operates on the principle that time series can be manipulated through interpolation in the complex frequency domain. By discarding high-frequency components with negligible impact on time series data, FITS achieves performance comparable to state-of-the-art models for time series forecasting and anomaly detection tasks, while having a remarkably compact size of only approximately $10k$ parameters. Such a lightweight model can be easily trained and deployed in edge devices, creating opportunities for various applications. The code is available in: \\url{https://github.com/VEWOXIC/FITS}","url_abs":"https://arxiv.org/abs/2307.03756v3","url_pdf":"https://arxiv.org/pdf/2307.03756v3.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":"fits-modeling-time-series-with-10k-parameters","repo_url":"https://github.com/vewoxic/fits","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"fits-modeling-time-series-with-10k-parameters","repo_url":"https://github.com/WenjieDu/PyPOTS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"time-series-forecasting","task_name":"Time Series Forecasting"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/time-series-forecasting-on-etth1-336-1","task":"Time Series Forecasting","dataset":"ETTh1 (336) Multivariate","model":"FITS","rank_in_archive_order":25,"of":72,"metrics":{"MSE":"0.427"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2307.03756","atlas_url":"https://app.syntology.ai/?focus=2307.03756","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":"2307.03756"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2307.03756\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2307.03756"},"call":"get_concepts_for_paper(arxiv_id=\"2307.03756\")"}],"by_repo":[{"repo":"vewoxic/fits","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2405.13522","2509.23597"],"harvested_for_calls":[{"arxiv_id":"2405.13522","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.13522"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.13522\")"},{"arxiv_id":"2509.23597","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2509.23597"},"call":"get_harvested_code_for_paper(arxiv_id=\"2509.23597\")"}]},{"repo":"WenjieDu/PyPOTS","kind":"listed","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\")"}]}],"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":"29eb0dae9fd1d7576fe119cabef0d2309fda2b494047b96f2f338f655356c1f8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}