{"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/tuning-computer-vision-models-with-task","title":"Tuning computer vision models with task rewards","arxiv_id":"2302.08242","date":"2023-02-16","proceeding":null,"authors":["André Susano Pinto","Alexander Kolesnikov","Yuge Shi","Lucas Beyer","Xiaohua Zhai"],"abstract":"Misalignment between model predictions and intended usage can be detrimental for the deployment of computer vision models. The issue is exacerbated when the task involves complex structured outputs, as it becomes harder to design procedures which address this misalignment. In natural language processing, this is often addressed using reinforcement learning techniques that align models with a task reward. We adopt this approach and show its surprising effectiveness across multiple computer vision tasks, such as object detection, panoptic segmentation, colorization and image captioning. We believe this approach has the potential to be widely useful for better aligning models with a diverse range of computer vision tasks.","url_abs":"https://arxiv.org/abs/2302.08242v1","url_pdf":"https://arxiv.org/pdf/2302.08242v1.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":"tuning-computer-vision-models-with-task","repo_url":"https://github.com/google-research/big_vision","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"jax","reach":null}],"tasks":[{"task_slug":"colorization","task_name":"Colorization"},{"task_slug":"image-captioning","task_name":"Image Captioning"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"panoptic-segmentation","task_name":"Panoptic Segmentation"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"object-detection-1","task_name":"object-detection"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[{"method_slug":"align","method_name":"ALIGN"},{"method_slug":"colorization","method_name":"Colorization"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2302.08242","atlas_url":"https://app.syntology.ai/?focus=2302.08242","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":"2302.08242"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2302.08242\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2302.08242"},"call":"get_concepts_for_paper(arxiv_id=\"2302.08242\")"}],"by_repo":[{"repo":"google-research/big_vision","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":7,"harvested_for":["2106.10270","2205.10337","2209.06794","2305.16999","2306.07915","2407.07726","2411.19722"],"harvested_for_calls":[{"arxiv_id":"2106.10270","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.10270"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.10270\")"},{"arxiv_id":"2205.10337","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2205.10337"},"call":"get_harvested_code_for_paper(arxiv_id=\"2205.10337\")"},{"arxiv_id":"2209.06794","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.06794"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.06794\")"},{"arxiv_id":"2305.16999","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.16999"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.16999\")"},{"arxiv_id":"2306.07915","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.07915"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.07915\")"},{"arxiv_id":"2407.07726","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.07726"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.07726\")"},{"arxiv_id":"2411.19722","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2411.19722"},"call":"get_harvested_code_for_paper(arxiv_id=\"2411.19722\")"}]}],"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":"144a4a463cd4d8d20c62c4746d39cd0418e271115663515709d70d5b9f00c497","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}