{"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":"/task/feature-upsampling","name":"Feature Upsampling","slug":"feature-upsampling","description_markdown":"Deep features are a cornerstone of computer vision research, capturing image semantics and enabling the community to solve downstream tasks even in the zero- or few-shot regime. However, these features often lack the spatial resolution to directly perform dense prediction tasks like segmentation and depth prediction because models aggressively pool information over large areas. Feature Upsampling aims to recover this missing spatial resolution without impacting the space of the original deep features.","categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Methodology","url":"/area/methodology"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":25,"papers_with_code":22,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":2,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/feature-upsampling-on-imagenet","slug":"feature-upsampling-on-imagenet","dataset":"ImageNet","dataset_url":"/dataset/imagenet","rows_in_archive":8,"metrics":["ADCC","Average Drop","Average Increase"],"first_row_in_archive_order":{"model":"JAFAR","paper_title":"JAFAR: Jack up Any Feature at Any Resolution","paper_url":"/paper/jafar-jack-up-any-feature-at-any-resolution-1","paper_date":"2025-06-10","arxiv_id":"2506.11136","code_links":[{"title":"PaulCouairon/JAFAR","url":"https://github.com/PaulCouairon/JAFAR"}],"syntology":null}}],"datasets":[{"url":"/dataset/imagenet","name":"ImageNet","full_name":"","num_papers_in_archive":15430},{"url":"/dataset/gensc-6g","name":"GenSC-6G","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/representation-learning","name":"Representation Learning"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":25,"of":25,"of_with_code":22,"tagged_in_all":25,"counts":{"archive_papers_tagged":25,"with_a_code_link":22,"where_syntology_ran_a_sample":10,"not_listed_spam_title":0,"listed":25,"listed_where_code_ran":10,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/deep-image-prior","slug":"deep-image-prior","title":"Deep Image Prior","date":"2017-11-29","arxiv_id":"1711.10925","repositories_listed":14,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-image-prior#ran","syntology_url":"https://syntology.ai/paper/1711.10925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.10925"}},"official":null}},{"url":"/paper/carafe-content-aware-reassembly-of-features","slug":"carafe-content-aware-reassembly-of-features","title":"CARAFE: Content-Aware ReAssembly of FEatures","date":"2019-05-06","arxiv_id":"1905.02188","repositories_listed":3,"syntology":null},{"url":"/paper/loftup-learning-a-coordinate-based-feature","slug":"loftup-learning-a-coordinate-based-feature","title":"LoftUp: Learning a Coordinate-Based Feature Upsampler for Vision Foundation Models","date":"2025-04-18","arxiv_id":"2504.14032","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/loftup-learning-a-coordinate-based-feature#ran","syntology_url":"https://syntology.ai/paper/2504.14032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.14032"}},"official":{"repos":["andrehuang/loftup"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/featup-a-model-agnostic-framework-for","slug":"featup-a-model-agnostic-framework-for","title":"FeatUp: A Model-Agnostic Framework for Features at Any Resolution","date":"2024-03-15","arxiv_id":"2403.10516","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/featup-a-model-agnostic-framework-for#ran","syntology_url":"https://syntology.ai/paper/2403.10516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10516"}},"official":{"repos":["mhamilton723/FeatUp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-point-affiliation-in-feature-upsampling","slug":"on-point-affiliation-in-feature-upsampling","title":"On Point Affiliation in Feature Upsampling","date":"2023-07-17","arxiv_id":"2307.08198","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-point-affiliation-in-feature-upsampling#ran","syntology_url":"https://syntology.ai/paper/2307.08198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08198"}},"official":{"repos":["tiny-smart/sapa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sapa-similarity-aware-point-affiliation-for","slug":"sapa-similarity-aware-point-affiliation-for","title":"SAPA: Similarity-Aware Point Affiliation for Feature Upsampling","date":"2022-09-26","arxiv_id":"2209.12866","repositories_listed":2,"syntology":null},{"url":"/paper/jafar-jack-up-any-feature-at-any-resolution-1","slug":"jafar-jack-up-any-feature-at-any-resolution-1","title":"JAFAR: Jack up Any Feature at Any Resolution","date":"2025-06-10","arxiv_id":"2506.11136","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-feature-upsampling-methods-for","slug":"benchmarking-feature-upsampling-methods-for","title":"Benchmarking Feature Upsampling Methods for Vision Foundation Models using Interactive Segmentation","date":"2025-05-04","arxiv_id":"2505.02075","repositories_listed":1,"syntology":null},{"url":"/paper/lda-aqu-adaptive-query-guided-upsampling-via","slug":"lda-aqu-adaptive-query-guided-upsampling-via","title":"LDA-AQU: Adaptive Query-guided Upsampling via Local Deformable Attention","date":"2024-11-29","arxiv_id":"2411.19585","repositories_listed":1,"syntology":null},{"url":"/paper/lighten-carafe-dynamic-lightweight-upsampling","slug":"lighten-carafe-dynamic-lightweight-upsampling","title":"Lighten CARAFE: Dynamic Lightweight Upsampling with Guided Reassemble Kernels","date":"2024-10-29","arxiv_id":"2410.22139","repositories_listed":1,"syntology":null},{"url":"/paper/efficientcd-a-new-strategy-for-change","slug":"efficientcd-a-new-strategy-for-change","title":"EfficientCD: A New Strategy For Change Detection Based With Bi-temporal Layers Exchanged","date":"2024-07-22","arxiv_id":"2407.15999","repositories_listed":1,"syntology":null},{"url":"/paper/fade-a-task-agnostic-upsampling-operator-for","slug":"fade-a-task-agnostic-upsampling-operator-for","title":"FADE: A Task-Agnostic Upsampling Operator for Encoder-Decoder Architectures","date":"2024-07-18","arxiv_id":"2407.13500","repositories_listed":1,"syntology":null},{"url":"/paper/a-refreshed-similarity-based-upsampler-for","slug":"a-refreshed-similarity-based-upsampler-for","title":"A Refreshed Similarity-based Upsampler for Direct High-Ratio Feature Upsampling","date":"2024-07-02","arxiv_id":"2407.02283","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-refreshed-similarity-based-upsampler-for#ran","syntology_url":"https://syntology.ai/paper/2407.02283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02283"}},"official":{"repos":["zmhhmz/resfu"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lift-a-surprisingly-simple-lightweight","slug":"lift-a-surprisingly-simple-lightweight","title":"LiFT: A Surprisingly Simple Lightweight Feature Transform for Dense ViT Descriptors","date":"2024-03-21","arxiv_id":"2403.14625","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lift-a-surprisingly-simple-lightweight#ran","syntology_url":"https://syntology.ai/paper/2403.14625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.14625"}},"official":null}},{"url":"/paper/arcnet-an-asymmetric-residual-wavelet-column","slug":"arcnet-an-asymmetric-residual-wavelet-column","title":"ASCNet: Asymmetric Sampling Correction Network for Infrared Image Destriping","date":"2024-01-28","arxiv_id":"2401.15578","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-upsample-by-learning-to-sample","slug":"learning-to-upsample-by-learning-to-sample","title":"Learning to Upsample by Learning to Sample","date":"2023-08-29","arxiv_id":"2308.15085","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-upsample-by-learning-to-sample#ran","syntology_url":"https://syntology.ai/paper/2308.15085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.15085"}},"official":{"repos":["tiny-smart/dysample"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/seaformer-squeeze-enhanced-axial-transformer","slug":"seaformer-squeeze-enhanced-axial-transformer","title":"SeaFormer++: Squeeze-enhanced Axial Transformer for Mobile Visual Recognition","date":"2023-01-30","arxiv_id":"2301.13156","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/seaformer-squeeze-enhanced-axial-transformer#ran","syntology_url":"https://syntology.ai/paper/2301.13156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13156"}},"official":{"repos":["fudan-zvg/seaformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fade-fusing-the-assets-of-decoder-and-encoder","slug":"fade-fusing-the-assets-of-decoder-and-encoder","title":"FADE: Fusing the Assets of Decoder and Encoder for Task-Agnostic Upsampling","date":"2022-07-21","arxiv_id":"2207.10392","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fade-fusing-the-assets-of-decoder-and-encoder#ran","syntology_url":"https://syntology.ai/paper/2207.10392","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10392"}},"official":null}},{"url":"/paper/local-and-global-gans-with-semantic-aware","slug":"local-and-global-gans-with-semantic-aware","title":"Local and Global GANs with Semantic-Aware Upsampling for Image Generation","date":"2022-02-28","arxiv_id":"2203.00047","repositories_listed":1,"syntology":null},{"url":"/paper/deep-vit-features-as-dense-visual-descriptors","slug":"deep-vit-features-as-dense-visual-descriptors","title":"Deep ViT Features as Dense Visual Descriptors","date":"2021-12-10","arxiv_id":"2112.05814","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-vit-features-as-dense-visual-descriptors#ran","syntology_url":"https://syntology.ai/paper/2112.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.05814"}},"official":null}},{"url":"/paper/joint-denoising-and-demosaicking-with-green","slug":"joint-denoising-and-demosaicking-with-green","title":"Joint Denoising and Demosaicking with Green Channel Prior for Real-world Burst Images","date":"2021-01-25","arxiv_id":"2101.09870","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-multi-scale-deep-convolutional","slug":"a-unified-multi-scale-deep-convolutional","title":"A Unified Multi-scale Deep Convolutional Neural Network for Fast Object Detection","date":"2016-07-25","arxiv_id":"1607.07155","repositories_listed":1,"syntology":null},{"url":null,"slug":"improving-depth-completion-via-depth-feature","title":"Improving Depth Completion via Depth Feature Upsampling","date":"2024-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-branch-convolutional-neural-network-for","title":"Multi-branch Convolutional Neural Network for Multiple Sclerosis Lesion Segmentation","date":"2018-11-07","arxiv_id":"1811.02942","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-segmentation-via-highly-fused","title":"Semantic Segmentation via Highly Fused Convolutional Network with Multiple Soft Cost Functions","date":"2018-01-04","arxiv_id":"1801.01317","repositories_listed":0,"syntology":null}],"syntology_records":10,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":10,"papers_where_code_ran_first_page":"/task/feature-upsampling/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/feature-upsampling/papers/ran/1","json":"/task/feature-upsampling/papers/ran/1.json","rows":10}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"31c09da779b9d14914d3559c0f82364feb950f641c3338490b8bb6d5b48e1bcd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}