{"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/cross-modal-retrieval-with-noisy","name":"Cross-modal retrieval with noisy correspondence","slug":"cross-modal-retrieval-with-noisy","description_markdown":"Noisy correspondence learning aims to eliminate the negative impact of the mismatched pairs (e.g., false positives/negatives) instead of annotation errors in several tasks.","categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"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":20,"papers_with_code":14,"benchmarks":3,"benchmark_tables_in_archive":3,"benchmark_tables_shown":3,"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":5,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/cross-modal-retrieval-with-noisy-3","slug":"cross-modal-retrieval-with-noisy-3","dataset":"COCO-Noisy","dataset_url":"/dataset/coco-noisy","rows_in_archive":17,"metrics":["R-Sum","Image-to-text R@1","Image-to-text R@5","Image-to-text R@10","Text-to-image R@1","Text-to-image R@5","Text-to-image R@10"],"first_row_in_archive_order":{"model":"ReCon","paper_title":"ReCon: Enhancing True Correspondence Discrimination through Relation Consistency for Robust Noisy Correspondence Learning","paper_url":"/paper/recon-enhancing-true-correspondence-1","paper_date":"2025-02-27","arxiv_id":"2502.19962","code_links":[{"title":"qxzha/ReCon","url":"https://github.com/qxzha/ReCon"}],"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 1 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) · 2 unverified","sample_list":"/paper/recon-enhancing-true-correspondence-1#ran","syntology_url":"https://syntology.ai/paper/2502.19962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19962"}},"official":{"repos":["qxzha/ReCon"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/cross-modal-retrieval-with-noisy-2","slug":"cross-modal-retrieval-with-noisy-2","dataset":"Flickr30K-Noisy","dataset_url":"/dataset/flickr30k-20-nc-1k-test","rows_in_archive":16,"metrics":["R-Sum","Image-to-text R@1","Image-to-text R@5","Image-to-text R@10","Text-to-image R@1","Text-to-image R@5","Text-to-image R@10"],"first_row_in_archive_order":{"model":"ReCon","paper_title":"ReCon: Enhancing True Correspondence Discrimination through Relation Consistency for Robust Noisy Correspondence Learning","paper_url":"/paper/recon-enhancing-true-correspondence-1","paper_date":"2025-02-27","arxiv_id":"2502.19962","code_links":[{"title":"qxzha/ReCon","url":"https://github.com/qxzha/ReCon"}],"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 1 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) · 2 unverified","sample_list":"/paper/recon-enhancing-true-correspondence-1#ran","syntology_url":"https://syntology.ai/paper/2502.19962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19962"}},"official":{"repos":["qxzha/ReCon"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/cross-modal-retrieval-with-noisy-1","slug":"cross-modal-retrieval-with-noisy-1","dataset":"CC152K","dataset_url":"/dataset/cc152k","rows_in_archive":15,"metrics":["R-Sum","Image-to-text R@1","Image-to-text R@5","Image-to-text R@10","Text-to-image R@1","Text-to-image R@5","Text-to-image R@10"],"first_row_in_archive_order":{"model":"ReCon","paper_title":"ReCon: Enhancing True Correspondence Discrimination through Relation Consistency for Robust Noisy Correspondence Learning","paper_url":"/paper/recon-enhancing-true-correspondence-1","paper_date":"2025-02-27","arxiv_id":"2502.19962","code_links":[{"title":"qxzha/ReCon","url":"https://github.com/qxzha/ReCon"}],"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 1 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) · 2 unverified","sample_list":"/paper/recon-enhancing-true-correspondence-1#ran","syntology_url":"https://syntology.ai/paper/2502.19962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19962"}},"official":{"repos":["qxzha/ReCon"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/cc152k","name":"CC152K","full_name":"Conceptual Captions 152K","num_papers_in_archive":17},{"url":"/dataset/coco-noisy","name":"COCO-Noisy","full_name":"Microsoft Common Objects in Context with 20% of Noisy Correspondence and 1K test data","num_papers_in_archive":17},{"url":"/dataset/flickr30k-20-nc-1k-test","name":"Flickr30K-Noisy","full_name":"Flickr-30K with 20% of Noisy Correspondence","num_papers_in_archive":16},{"url":"/dataset/now","name":"NoW","full_name":"Noise of Web","num_papers_in_archive":2},{"url":"/dataset/noise-of-web-now","name":"Noise of Web","full_name":"NoW","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/cross-modal-retrieval","name":"Cross-Modal Retrieval"}],"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":20,"of":20,"of_with_code":14,"tagged_in_all":20,"counts":{"archive_papers_tagged":20,"with_a_code_link":14,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":20,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/negative-pre-aware-for-noisy-cross-modal","slug":"negative-pre-aware-for-noisy-cross-modal","title":"Negative Pre-aware for Noisy Cross-modal Matching","date":"2023-12-10","arxiv_id":"2312.05777","repositories_listed":2,"syntology":null},{"url":"/paper/recon-enhancing-true-correspondence-1","slug":"recon-enhancing-true-correspondence-1","title":"ReCon: Enhancing True Correspondence Discrimination through Relation Consistency for Robust Noisy Correspondence Learning","date":"2025-02-27","arxiv_id":"2502.19962","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 1 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) · 2 unverified","sample_list":"/paper/recon-enhancing-true-correspondence-1#ran","syntology_url":"https://syntology.ai/paper/2502.19962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19962"}},"official":{"repos":["qxzha/ReCon"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pc-2-pseudo-classification-based-pseudo","slug":"pc-2-pseudo-classification-based-pseudo","title":"PC$^2$: Pseudo-Classification Based Pseudo-Captioning for Noisy Correspondence Learning in Cross-Modal Retrieval","date":"2024-08-02","arxiv_id":"2408.01349","repositories_listed":1,"syntology":null},{"url":"/paper/ugncl-uncertainty-guided-noisy-correspondence","slug":"ugncl-uncertainty-guided-noisy-correspondence","title":"UGNCL: Uncertainty-Guided Noisy Correspondence Learning for Efficient Cross-Modal Matching","date":"2024-07-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-noisy-correspondence-by","slug":"mitigating-noisy-correspondence-by","title":"Mitigating Noisy Correspondence by Geometrical Structure Consistency Learning","date":"2024-05-27","arxiv_id":"2405.16996","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"4 ran (of which 2 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) · 2 unverified","sample_list":"/paper/mitigating-noisy-correspondence-by#ran","syntology_url":"https://syntology.ai/paper/2405.16996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16996"}},"official":{"repos":["MediaBrain-SJTU/GSC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-modal-retrieval-with-noisy","slug":"cross-modal-retrieval-with-noisy","title":"Cross-modal Retrieval with Noisy Correspondence via Consistency Refining and Mining","date":"2024-03-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rematch-mismatched-pairs-for","slug":"learning-to-rematch-mismatched-pairs-for","title":"Learning to Rematch Mismatched Pairs for Robust Cross-Modal Retrieval","date":"2024-03-08","arxiv_id":"2403.05105","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":6,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"8 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-rematch-mismatched-pairs-for#ran","syntology_url":"https://syntology.ai/paper/2403.05105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.05105"}},"official":{"repos":["hhc1997/l2rm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":6,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-modal-active-complementary-learning-1","slug":"cross-modal-active-complementary-learning-1","title":"Cross-modal Active Complementary Learning with Self-refining Correspondence","date":"2023-10-26","arxiv_id":"2310.17468","repositories_listed":1,"syntology":{"n":28,"n_ran":23,"n_constructed":8,"n_ran_checked":17,"n_instrument":6,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":15,"n_pointer_only":28,"phrase":"23 ran (of which 8 constructed an object rather than computing a result; 17 with no instrument failure: 2 honoured, 0 violated, 15 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/cross-modal-active-complementary-learning-1#ran","syntology_url":"https://syntology.ai/paper/2310.17468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17468"}},"official":{"repos":["qinyang79/crcl"],"state":"official (archive's flag): 22 ran","n_ran":22,"n_constructed":8,"n_ran_no_instrument_failure":17,"n_unverified":5,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/noisy-correspondence-learning-with-meta","slug":"noisy-correspondence-learning-with-meta","title":"Noisy Correspondence Learning with Meta Similarity Correction","date":"2023-04-13","arxiv_id":"2304.06275","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/noisy-correspondence-learning-with-meta#ran","syntology_url":"https://syntology.ai/paper/2304.06275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.06275"}},"official":{"repos":["hhc1997/mscn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/integrating-language-guidance-into-image-text","slug":"integrating-language-guidance-into-image-text","title":"Integrating Language Guidance Into Image-Text Matching for Correcting False Negatives","date":"2023-03-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bicro-noisy-correspondence-rectification-for","slug":"bicro-noisy-correspondence-rectification-for","title":"BiCro: Noisy Correspondence Rectification for Multi-modality Data via Bi-directional Cross-modal Similarity Consistency","date":"2023-03-22","arxiv_id":"2303.12419","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":5,"n_ran_checked":6,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bicro-noisy-correspondence-rectification-for#ran","syntology_url":"https://syntology.ai/paper/2303.12419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12419"}},"official":{"repos":["xu5zhao/bicro"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-modal-retrieval-with-partially","slug":"cross-modal-retrieval-with-partially","title":"Cross-Modal Retrieval with Partially Mismatched Pairs","date":"2023-02-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-evidential-learning-with-noisy","slug":"deep-evidential-learning-with-noisy","title":"Deep Evidential Learning with Noisy Correspondence for Cross-Modal Retrieval","date":"2022-10-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-with-noisy-correspondence-for-cross","slug":"learning-with-noisy-correspondence-for-cross","title":"Learning with Noisy Correspondence for Cross-modal Matching","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"breaking-through-the-noisy-correspondence-a","title":"Breaking Through the Noisy Correspondence: A Robust Model for Image-Text Matching","date":"2024-04-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/learning-with-noisy-correspondence","slug":"learning-with-noisy-correspondence","title":"Learning with Noisy Correspondence","date":"2024-04-13","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/nac-mitigating-noisy-correspondence-in-cross","slug":"nac-mitigating-noisy-correspondence-in-cross","title":"NAC: Mitigating Noisy Correspondence in Cross-Modal Matching Via Neighbor Auxiliary Corrector","date":"2024-03-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/repair-rank-correlation-and-noisy-pair-half","slug":"repair-rank-correlation-and-noisy-pair-half","title":"REPAIR: Rank Correlation and Noisy Pair Half-replacing with Memory for Noisy Correspondence","date":"2024-03-13","arxiv_id":"2403.08224","repositories_listed":0,"syntology":null},{"url":"/paper/noisy-correspondence-learning-with-self","slug":"noisy-correspondence-learning-with-self","title":"Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation","date":"2023-12-27","arxiv_id":"2312.16478","repositories_listed":0,"syntology":null},{"url":"/paper/learning-from-noisy-correspondence-with-tri","slug":"learning-from-noisy-correspondence-with-tri","title":"Learning From Noisy Correspondence With Tri-Partition for Cross-Modal Matching","date":"2023-09-22","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":6,"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":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/cross-modal-retrieval-with-noisy-1","since_archive":"/sota/cross-modal-retrieval-with-noisy-1#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/task/cross-modal-retrieval-with-noisy/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/cross-modal-retrieval-with-noisy/papers/ran/1","json":"/task/cross-modal-retrieval-with-noisy/papers/ran/1.json","rows":6}],"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":"0a32cce736da312fb0c3cc0818b27bd339317b18dfbc1fff6ab2d1e22795ca29","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}