{"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/reversible-instance-normalization-for","title":"Reversible Instance Normalization for Accurate Time-Series Forecasting against Distribution Shift","arxiv_id":null,"date":"2021-09-29","proceeding":"ICLR 2022 4","authors":["Taesung Kim","Jinhee Kim","Yunwon Tae","Cheonbok Park","Jang-Ho Choi","Jaegul Choo"],"abstract":"The statistical properties in a time-series often change, i.e., the data distributions differ over time. This temporal distribution change is one of the main challenges that prevent accurate time-series forecasting. To address this issue, we propose a simple but effective normalization method called reversible instance normalization (RevIN). To be specific, RevIN consists of two different steps, normalization and denormalization. The former normalizes the input to fix its distribution in terms of the mean and variance, while the latter returns the output to the original distribution.\nIn addition, RevIN is model-agnostic, generally applicable to various time-series forecasting models with significant improvements in forecasting performance. As shown in Fig. 1, RevIN effectively enhances the performance of the baselines. Our extensive experimental results verify the general applicability and performance improvements on various real-world datasets.","url_abs":"https://openreview.net/forum?id=cGDAkQo1C0p","url_pdf":"https://openreview.net/pdf?id=cGDAkQo1C0p","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":"reversible-instance-normalization-for","repo_url":"https://github.com/WenjieDu/PyPOTS","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"reversible-instance-normalization-for","repo_url":"https://github.com/ts-kim/RevIN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"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":[{"method_slug":"instance-normalization","method_name":"Instance Normalization"}],"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":"ts-kim/RevIN","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":"f44c864c7b34d2ff631d4a7303617ac714dc9de641f57be53ac9393f77664dc6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}