{"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/aim-2020-challenge-on-efficient-super","title":"AIM 2020 Challenge on Efficient Super-Resolution: Methods and Results","arxiv_id":"2009.06943","date":"2020-09-15","proceeding":null,"authors":["Kai Zhang","Martin Danelljan","Yawei Li","Radu Timofte","Jie Liu","Jie Tang","Gangshan Wu","Yu Zhu","Xiangyu He","Wenjie Xu","Chenghua Li","Cong Leng","Jian Cheng","Guangyang Wu","Wenyi Wang","Xiaohong Liu","Hengyuan Zhao","Xiangtao Kong","Jingwen He","Yu Qiao","Chao Dong","Maitreya Suin","Kuldeep Purohit","A. N. Rajagopalan","Xiaochuan Li","Zhiqiang Lang","Jiangtao Nie","Wei Wei","Lei Zhang","Abdul Muqeet","Jiwon Hwang","Subin Yang","JungHeum Kang","Sung-Ho Bae","Yongwoo Kim","Geun-Woo Jeon","Jun-Ho Choi","Jun-Hyuk Kim","Jong-Seok Lee","Steven Marty","Eric Marty","Dongliang Xiong","Siang Chen","Lin Zha","Jiande Jiang","Xinbo Gao","Wen Lu","Haicheng Wang","Vineeth Bhaskara","Alex Levinshtein","Stavros Tsogkas","Allan Jepson","Xiangzhen Kong","Tongtong Zhao","Shanshan Zhao","Hrishikesh P. S","Densen Puthussery","Jiji C. V","Nan Nan","Shuai Liu","Jie Cai","Zibo Meng","Jiaming Ding","Chiu Man Ho","Xuehui Wang","Qiong Yan","Yuzhi Zhao","Long Chen","Jiangtao Zhang","Xiaotong Luo","Liang Chen","Yanyun Qu","Long Sun","Wenhao Wang","Zhenbing Liu","Rushi Lan","Rao Muhammad Umer","Christian Micheloni"],"abstract":"This paper reviews the AIM 2020 challenge on efficient single image super-resolution with focus on the proposed solutions and results. The challenge task was to super-resolve an input image with a magnification factor x4 based on a set of prior examples of low and corresponding high resolution images. The goal is to devise a network that reduces one or several aspects such as runtime, parameter count, FLOPs, activations, and memory consumption while at least maintaining PSNR of MSRResNet. The track had 150 registered participants, and 25 teams submitted the final results. They gauge the state-of-the-art in efficient single image super-resolution.","url_abs":"https://arxiv.org/abs/2009.06943v1","url_pdf":"https://arxiv.org/pdf/2009.06943v1.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":"aim-2020-challenge-on-efficient-super","repo_url":"https://github.com/cszn/KAIR","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"aim-2020-challenge-on-efficient-super","repo_url":"https://github.com/njulj/RFDN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"aim-2020-challenge-on-efficient-super","repo_url":"https://github.com/tuvovan/RFDNet-ImageSuperResolution","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"image-super-resolution","task_name":"Image Super-Resolution"},{"task_slug":"super-resolution","task_name":"Super-Resolution"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2009.06943","atlas_url":"https://app.syntology.ai/?focus=2009.06943","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":"2009.06943"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2009.06943\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2009.06943"},"call":"get_concepts_for_paper(arxiv_id=\"2009.06943\")"}],"by_repo":[{"repo":"cszn/KAIR","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"njulj/RFDN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2009.11551"],"harvested_for_calls":[{"arxiv_id":"2009.11551","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.11551"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.11551\")"}]},{"repo":"tuvovan/RFDNet-ImageSuperResolution","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2009.11551"],"harvested_for_calls":[{"arxiv_id":"2009.11551","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.11551"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.11551\")"}]}],"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":"625fc3a0fdf8a3a28ea98685cf66fa3348086cfbc0020bd663e1e3c0a77847c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}