{"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":"/method/paa","slug":"paa","name":"PAA","full_name":"Patch AutoAugment","full_name_withheld":false,"description_markdown":"**Patch AutoAugment** is a patch-level automatic data augmentation algorithm that automatically searches for the optimal augmentation policies for the patches of an image. Specifically, PAA allows each patch DA operation to be controlled by an agent and models it as a Multi-Agent Reinforcement Learning (MARL) problem. At each step, PAA samples the most effective operation for each patch based on its content and the semantics of the whole image. The agents cooperate as a team and share a unified team reward for achieving the joint optimal DA policy of the whole image. PAA is co-trained with a target network through adversarial training. At each step, the policy network samples the most effective operation for each patch based on its content and the semantics of the image.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Local Patch AutoAugment with Multi-Agent Collaboration","paper":"/paper/patch-autoaugment","first_author":"Shiqi Lin","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/patch-autoaugment"},"source":{"url":"https://arxiv.org/abs/2103.11099v2","title":"Local Patch AutoAugment with Multi-Agent Collaboration","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Image Data Augmentation","url":"/methods/category/image-data-augmentation","pwc_aliases":[]}],"n_papers_tagged":10,"archive_num_papers":10,"papers_newest_first":[{"paper":null,"slug":"rethinking-personalized-aesthetics-assessment","title":"Rethinking Personalized Aesthetics Assessment: Employing Physique Aesthetics Assessment as An Exemplification","date":"2025-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/political-actor-agent-simulating-legislative","slug":"political-actor-agent-simulating-legislative","title":"Political Actor Agent: Simulating Legislative System for Roll Call Votes Prediction with Large Language Models","date":"2024-12-10","arxiv_id":"2412.07144","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-algorithms-for-recognizing-weighted","title":"Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages","date":"2023-10-23","arxiv_id":"2310.15276","n_code_links":0,"syntology":null},{"paper":null,"slug":"aphid-cluster-recognition-and-detection-in","title":"Aphid Cluster Recognition and Detection in the Wild Using Deep Learning Models","date":"2023-08-10","arxiv_id":"2308.05881","n_code_links":0,"syntology":null},{"paper":null,"slug":"impact-of-sensing-range-on-real-time-adaptive","title":"Impact of Sensing Range on Real-Time Adaptive Control of Signalized Intersections Using Vehicle Trajectory Information","date":"2023-08-03","arxiv_id":"2308.01646","n_code_links":0,"syntology":null},{"paper":"/paper/self-similarity-based-super-resolution-of","slug":"self-similarity-based-super-resolution-of","title":"Self-similarity-based super-resolution of photoacoustic angiography from hand-drawn doodles","date":"2023-05-02","arxiv_id":"2305.01165","n_code_links":1,"syntology":null},{"paper":"/paper/personalized-dialogue-generation-with-persona","slug":"personalized-dialogue-generation-with-persona","title":"Personalized Dialogue Generation with Persona-Adaptive Attention","date":"2022-10-27","arxiv_id":"2210.15088","n_code_links":1,"syntology":null},{"paper":null,"slug":"fracture-detection-in-wrist-x-ray-images","title":"Fracture Detection in Wrist X-ray Images Using Deep Learning-Based Object Detection Models","date":"2021-11-14","arxiv_id":"2111.07355","n_code_links":0,"syntology":null},{"paper":"/paper/tood-task-aligned-one-stage-object-detection","slug":"tood-task-aligned-one-stage-object-detection","title":"TOOD: Task-aligned One-stage Object Detection","date":"2021-08-17","arxiv_id":"2108.07755","n_code_links":6,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["fcjian/TOOD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/patch-autoaugment","slug":"patch-autoaugment","title":"Local Patch AutoAugment with Multi-Agent Collaboration","date":"2021-03-20","arxiv_id":"2103.11099","n_code_links":2,"syntology":null}],"papers_shown":10,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":10,"with_a_code_link":5,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":10,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/paa/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/paa/papers/ran/1","json":"/method/paa/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/object-detection","name":"Object Detection","papers":3},{"task":"/task/object-detection-1","name":"object-detection","papers":3},{"task":"/task/2d-object-detection","name":"2D Object Detection","papers":1},{"task":"/task/continual-learning","name":"Continual Learning","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/dialogue-generation","name":"Dialogue Generation","papers":1},{"task":"/task/diversity","name":"Diversity","papers":1},{"task":"/task/ensemble-learning","name":"Ensemble Learning","papers":1},{"task":"/task/fine-grained-image-recognition","name":"Fine-Grained Image Recognition","papers":1},{"task":"/task/fracture-detection","name":"Fracture detection","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/image-generation","name":"Image Generation","papers":1},{"task":"/task/medical-object-detection","name":"Medical Object Detection","papers":1},{"task":"/task/multi-agent-reinforcement-learning","name":"Multi-agent Reinforcement Learning","papers":1},{"task":"/task/object","name":"Object","papers":1},{"task":"/task/super-resolution","name":"Super-Resolution","papers":1},{"task":"/task/tag","name":"TAG","papers":1},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":1},{"task":"/task/zero-shot-learning","name":"Zero-Shot Learning","papers":1}],"tasks_shown":20,"n_tasks":21,"usage_by_year":[{"year":"2021","papers":3},{"year":"2022","papers":1},{"year":"2023","papers":4},{"year":"2024","papers":1},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/paa"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=PAA","read_at":"2026-10-05T00:59:57+00:00","query":"PAA","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"PAA","origin_arxiv_id":"2609.20634"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2103.11099","repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":false,"bearers_found":3,"served":{"arxiv_id":"2609.20634","citations":null},"leading_other_bearer":{"arxiv_id":"2601.06884","title":"Paraphrasing Adversarial Attack on LLM-as-a-Reviewer","citations":3,"named_by":["acronym_expansion"],"bearer_name":"Paraphrasing Adversarial Attack (PAA)","ask_with":"have('2601.06884')"},"n_other_bearers_listed":2,"note":"'PAA' is ALSO the name of 'Paraphrasing Adversarial Attack (PAA)', a method in 'Paraphrasing Adversarial Attack on LLM-as-a-Reviewer' (arXiv:2601.06884, 3 citations), which is cited more than the paper this answer is about (citations not recorded). The margin is narrow, so this is not a claim that the other one is what you meant -- check `served.arxiv_id` against the paper you had in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2609.20634","page":null,"syntology_url":"https://syntology.ai/paper/2609.20634","in_graph_layer":false,"samples":0},"line":"about another paper, arXiv:2609.20634: no code under this exact name (no_code; paper_only). About another paper: this answer is about arXiv:2609.20634, while the archive credits arXiv:2103.11099, so it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"6f6960a3e827d1f0a94297a2a0dd6498b995518efd343cc3e832f4dd3a0fffd6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}