{"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/the-self-optimal-transport-feature-transform","title":"The Self-Optimal-Transport Feature Transform","arxiv_id":"2204.03065","date":"2022-04-06","proceeding":null,"authors":["Daniel Shalam","Simon Korman"],"abstract":"The Self-Optimal-Transport (SOT) feature transform is designed to upgrade the set of features of a data instance to facilitate downstream matching or grouping related tasks. The transformed set encodes a rich representation of high order relations between the instance features. Distances between transformed features capture their direct original similarity and their third party agreement regarding similarity to other features in the set. A particular min-cost-max-flow fractional matching problem, whose entropy regularized version can be approximated by an optimal transport (OT) optimization, results in our transductive transform which is efficient, differentiable, equivariant, parameterless and probabilistically interpretable. Empirically, the transform is highly effective and flexible in its use, consistently improving networks it is inserted into, in a variety of tasks and training schemes. We demonstrate its merits through the problem of unsupervised clustering and its efficiency and wide applicability for few-shot-classification, with state-of-the-art results, and large-scale person re-identification.","url_abs":"https://arxiv.org/abs/2204.03065v1","url_pdf":"https://arxiv.org/pdf/2204.03065v1.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":"the-self-optimal-transport-feature-transform","repo_url":"https://github.com/danielshalam/bpa","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"few-shot-image-classification","task_name":"Few-Shot Image Classification"},{"task_slug":"large-scale-person-re-identification","task_name":"Large-Scale Person Re-Identification"},{"task_slug":"person-re-identification","task_name":"Person Re-Identification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/few-shot-image-classification-on-cifar-fs-5","task":"Few-Shot Image Classification","dataset":"CIFAR-FS 5-way (1-shot)","model":"PT+MAP+SF+SOT (transductive)","rank_in_archive_order":1,"of":38,"metrics":{"Accuracy":"89.94 "},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-cifar-fs-5-1","task":"Few-Shot Image Classification","dataset":"CIFAR-FS 5-way (5-shot)","model":"PT+MAP+SF+SOT (transductive)","rank_in_archive_order":2,"of":39,"metrics":{"Accuracy":"92.83"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-cub-200-5-1","task":"Few-Shot Image Classification","dataset":"CUB 200 5-way 1-shot","model":"PT+MAP+SF+SOT (transductive)","rank_in_archive_order":1,"of":36,"metrics":{"Accuracy":"95.80"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-cub-200-5","task":"Few-Shot Image Classification","dataset":"CUB 200 5-way 5-shot","model":"PT+MAP+SF+SOT (transductive)","rank_in_archive_order":2,"of":32,"metrics":{"Accuracy":"97.12"},"uses_additional_data":true},{"leaderboard":"/sota/few-shot-image-classification-on-mini-2","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 5-way (1-shot)","model":"PT+MAP+SF+SOT (transductive)","rank_in_archive_order":5,"of":105,"metrics":{"Accuracy":"85.59"},"uses_additional_data":false},{"leaderboard":"/sota/few-shot-image-classification-on-mini-3","task":"Few-Shot Image Classification","dataset":"Mini-Imagenet 5-way (5-shot)","model":"PT+MAP+SF+SOT (transductive)","rank_in_archive_order":8,"of":95,"metrics":{"Accuracy":"91.34"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2204.03065","atlas_url":"https://app.syntology.ai/?focus=2204.03065","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":"2204.03065"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2204.03065\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2204.03065"},"call":"get_concepts_for_paper(arxiv_id=\"2204.03065\")"}],"by_repo":[{"repo":"danielshalam/bpa","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"24f50fd92f3e2abacb02bd9ec7bdd387b59236975e319ddb5d19aa59559e63a5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}