{"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/sodeep-a-sorting-deep-net-to-learn-ranking","title":"SoDeep: a Sorting Deep net to learn ranking loss surrogates","arxiv_id":"1904.04272","date":"2019-04-08","proceeding":"CVPR 2019 6","authors":["Martin Engilberge","Louis Chevallier","Patrick Pérez","Matthieu Cord"],"abstract":"Several tasks in machine learning are evaluated using non-differentiable\nmetrics such as mean average precision or Spearman correlation. However, their\nnon-differentiability prevents from using them as objective functions in a\nlearning framework. Surrogate and relaxation methods exist but tend to be\nspecific to a given metric.\n  In the present work, we introduce a new method to learn approximations of\nsuch non-differentiable objective functions. Our approach is based on a deep\narchitecture that approximates the sorting of arbitrary sets of scores. It is\ntrained virtually for free using synthetic data. This sorting deep (SoDeep) net\ncan then be combined in a plug-and-play manner with existing deep\narchitectures. We demonstrate the interest of our approach in three different\ntasks that require ranking: Cross-modal text-image retrieval, multi-label image\nclassification and visual memorability ranking. Our approach yields very\ncompetitive results on these three tasks, which validates the merit and the\nflexibility of SoDeep as a proxy for sorting operation in ranking-based losses.","url_abs":"http://arxiv.org/abs/1904.04272v1","url_pdf":"http://arxiv.org/pdf/1904.04272v1.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":"sodeep-a-sorting-deep-net-to-learn-ranking","repo_url":"https://github.com/technicolor-research/sodeep","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"BSD-3-Clause-Clear"}}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-retrieval","task_name":"Image Retrieval"},{"task_slug":"multi-label-image-classification","task_name":"Multi-Label Image Classification"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.04272","atlas_url":"https://app.syntology.ai/?focus=1904.04272","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":"1904.04272"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.04272\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.04272"},"call":"get_concepts_for_paper(arxiv_id=\"1904.04272\")"}],"by_repo":[{"repo":"technicolor-research/sodeep","kind":"listed","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":"805e2f2749ca61dff7db1de0d28329f9b6d7b2be6391d9a440ffd1f4e21568b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}