{"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/candidate-set-re-ranking-for-composed-image","title":"Candidate Set Re-ranking for Composed Image Retrieval with Dual Multi-modal Encoder","arxiv_id":"2305.16304","date":"2023-05-25","proceeding":null,"authors":["Zheyuan Liu","Weixuan Sun","Damien Teney","Stephen Gould"],"abstract":"Composed image retrieval aims to find an image that best matches a given multi-modal user query consisting of a reference image and text pair. Existing methods commonly pre-compute image embeddings over the entire corpus and compare these to a reference image embedding modified by the query text at test time. Such a pipeline is very efficient at test time since fast vector distances can be used to evaluate candidates, but modifying the reference image embedding guided only by a short textual description can be difficult, especially independent of potential candidates. An alternative approach is to allow interactions between the query and every possible candidate, i.e., reference-text-candidate triplets, and pick the best from the entire set. Though this approach is more discriminative, for large-scale datasets the computational cost is prohibitive since pre-computation of candidate embeddings is no longer possible. We propose to combine the merits of both schemes using a two-stage model. Our first stage adopts the conventional vector distancing metric and performs a fast pruning among candidates. Meanwhile, our second stage employs a dual-encoder architecture, which effectively attends to the input triplet of reference-text-candidate and re-ranks the candidates. Both stages utilize a vision-and-language pre-trained network, which has proven beneficial for various downstream tasks. Our method consistently outperforms state-of-the-art approaches on standard benchmarks for the task. Our implementation is available at https://github.com/Cuberick-Orion/Candidate-Reranking-CIR.","url_abs":"https://arxiv.org/abs/2305.16304v3","url_pdf":"https://arxiv.org/pdf/2305.16304v3.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":"candidate-set-re-ranking-for-composed-image","repo_url":"https://github.com/Cuberick-Orion/Candidate-Reranking-CIR","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"candidate-set-re-ranking-for-composed-image","repo_url":"https://github.com/Cuberick-Orion/Bi-Blip4CIR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"composed-image-retrieval","task_name":"Composed Image Retrieval (CoIR)"},{"task_slug":"image-retrieval","task_name":"Image Retrieval"},{"task_slug":"re-ranking","task_name":"Re-Ranking"},{"task_slug":"reranking","task_name":"Reranking"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":null,"task_name":"Triplet"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"},{"method_slug":"test","method_name":"Test"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-retrieval-on-cirr","task":"Image Retrieval","dataset":"CIRR","model":"Candidate Set Re-ranking","rank_in_archive_order":5,"of":17,"metrics":{"(Recall@5+Recall_subset@1)/2":"80.9","Recall@10":"89.78"},"uses_additional_data":false},{"leaderboard":"/sota/image-retrieval-on-fashion-iq","task":"Image Retrieval","dataset":"Fashion IQ","model":"Candidate Set Re-ranking","rank_in_archive_order":5,"of":22,"metrics":{"(Recall@10+Recall@50)/2":"62.15","Recall@10":"51.17"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.16304","atlas_url":"https://app.syntology.ai/?focus=2305.16304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16304"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.16304"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.16304"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.16304\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2305.16304"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.16304\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.16304"},"call":"get_concepts_for_paper(arxiv_id=\"2305.16304\")"}],"by_repo":[{"repo":"Cuberick-Orion/Candidate-Reranking-CIR","kind":"official","samples":5,"ran":4,"instrument":2,"unverified":1},{"repo":"Cuberick-Orion/Bi-Blip4CIR","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2305.16304.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2305.16304.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Cuberick-Orion/Bi-Blip4CIR","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Cuberick-Orion/Candidate-Reranking-CIR","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":1,"ran_violates":1,"ran_draft_wrong":2,"unverified":2},"n_samples":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"official":{"samples":5,"ran":4,"n_ran_checked":2,"n_instrument":2,"repositories":1},"listed":{"samples":1,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":1,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":4,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"17a33f0b1f407e2a","code_sha256_prefix":"17a33f0b1f407e2a","entry":"generate_randomized_fiq_caption","repo":"Cuberick-Orion/Candidate-Reranking-CIR","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/Cuberick-Orion/Candidate-Reranking-CIR/blob/HEAD/src/utils.py","link_basis":"plan_row","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"flattened_captions:list/1/str","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"17a33f0b1f407e2a"}},{"code_sha256":"4d1d9c47619920ba","code_sha256_prefix":"4d1d9c47619920ba","entry":"is_url","repo":"Cuberick-Orion/Candidate-Reranking-CIR","repo_kind":"official","path":"src/med.py","file_url":"https://github.com/Cuberick-Orion/Candidate-Reranking-CIR/blob/HEAD/src/med.py","link_basis":"harvester_set","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"url_or_filename:str/0/str","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/is-url","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from jylins/videoxum, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"4d1d9c47619920ba"}},{"code_sha256":"a1580dd1883758f6","code_sha256_prefix":"a1580dd1883758f6","entry":"squarepad_transform","repo":"Cuberick-Orion/Candidate-Reranking-CIR","repo_kind":"official","path":"src/data_utils.py","file_url":"https://github.com/Cuberick-Orion/Candidate-Reranking-CIR/blob/HEAD/src/data_utils.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dim:int/0/int","fixture_out_type":"Compose","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/squarepad-transform","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a1580dd1883758f6"}},{"code_sha256":"9e2b18431cf6776f","code_sha256_prefix":"9e2b18431cf6776f","entry":"targetpad_transform","repo":"Cuberick-Orion/Candidate-Reranking-CIR","repo_kind":"official","path":"src/data_utils.py","file_url":"https://github.com/Cuberick-Orion/Candidate-Reranking-CIR/blob/HEAD/src/data_utils.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"target_ratio:float/0/float, dim:int/0/int","fixture_out_type":"Compose","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/targetpad-transform","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9e2b18431cf6776f"}},{"code_sha256":"d12ba8b8f88ca00d","code_sha256_prefix":"d12ba8b8f88ca00d","entry":"collate_fn","repo":"Cuberick-Orion/Candidate-Reranking-CIR","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/Cuberick-Orion/Candidate-Reranking-CIR/blob/HEAD/src/utils.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/collate-fn","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d12ba8b8f88ca00d"}},{"code_sha256":"f837c334ddfa8af4","code_sha256_prefix":"f837c334ddfa8af4","entry":"create_vit","repo":"Cuberick-Orion/Bi-Blip4CIR","repo_kind":"listed","path":"src/blip_modules/blip.py","file_url":"https://github.com/Cuberick-Orion/Bi-Blip4CIR/blob/HEAD/src/blip_modules/blip.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/create-vit","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f837c334ddfa8af4"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"db2da292b260d91a188e826f2153a9119e12ef0215dd555f3751fd54c857415a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}