{"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/scalable-learning-of-non-decomposable","title":"Scalable Learning of Non-Decomposable Objectives","arxiv_id":"1608.04802","date":"2016-08-16","proceeding":null,"authors":["Elad ET. Eban","Mariano Schain","Alan Mackey","Ariel Gordon","Rif A. Saurous","Gal Elidan"],"abstract":"Modern retrieval systems are often driven by an underlying machine learning\nmodel. The goal of such systems is to identify and possibly rank the few most\nrelevant items for a given query or context. Thus, such systems are typically\nevaluated using a ranking-based performance metric such as the area under the\nprecision-recall curve, the $F_\\beta$ score, precision at fixed recall, etc.\nObviously, it is desirable to train such systems to optimize the metric of\ninterest.\n  In practice, due to the scalability limitations of existing approaches for\noptimizing such objectives, large-scale retrieval systems are instead trained\nto maximize classification accuracy, in the hope that performance as measured\nvia the true objective will also be favorable. In this work we present a\nunified framework that, using straightforward building block bounds, allows for\nhighly scalable optimization of a wide range of ranking-based objectives. We\ndemonstrate the advantage of our approach on several real-life retrieval\nproblems that are significantly larger than those considered in the literature,\nwhile achieving substantial improvement in performance over the\naccuracy-objective baseline.","url_abs":"http://arxiv.org/abs/1608.04802v2","url_pdf":"http://arxiv.org/pdf/1608.04802v2.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":"scalable-learning-of-non-decomposable","repo_url":"https://github.com/tensorflow/models","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"scalable-learning-of-non-decomposable","repo_url":"https://github.com/tensorflow/models/tree/master/research/global_objectives","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1608.04802","atlas_url":"https://app.syntology.ai/?focus=1608.04802","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":"1608.04802"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1608.04802\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1608.04802"},"call":"get_concepts_for_paper(arxiv_id=\"1608.04802\")"}],"by_repo":[{"repo":"tensorflow/models","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1502.03167","1512.03385","1605.07146","1704.04861"],"harvested_for_calls":[{"arxiv_id":"1502.03167","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.03167"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.03167\")"},{"arxiv_id":"1512.03385","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1512.03385"},"call":"get_harvested_code_for_paper(arxiv_id=\"1512.03385\")"},{"arxiv_id":"1605.07146","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1605.07146"},"call":"get_harvested_code_for_paper(arxiv_id=\"1605.07146\")"},{"arxiv_id":"1704.04861","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.04861"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.04861\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"f9eaa66505c7be6ebdd6ec512b318e32d56db68d2616a039012deda6597da8af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}