{"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/progressive-random-convolutions-for-single","title":"Progressive Random Convolutions for Single Domain Generalization","arxiv_id":"2304.00424","date":"2023-04-02","proceeding":"CVPR 2023 1","authors":["Seokeon Choi","Debasmit Das","Sungha Choi","Seunghan Yang","Hyunsin Park","Sungrack Yun"],"abstract":"Single domain generalization aims to train a generalizable model with only one source domain to perform well on arbitrary unseen target domains. Image augmentation based on Random Convolutions (RandConv), consisting of one convolution layer randomly initialized for each mini-batch, enables the model to learn generalizable visual representations by distorting local textures despite its simple and lightweight structure. However, RandConv has structural limitations in that the generated image easily loses semantics as the kernel size increases, and lacks the inherent diversity of a single convolution operation. To solve the problem, we propose a Progressive Random Convolution (Pro-RandConv) method that recursively stacks random convolution layers with a small kernel size instead of increasing the kernel size. This progressive approach can not only mitigate semantic distortions by reducing the influence of pixels away from the center in the theoretical receptive field, but also create more effective virtual domains by gradually increasing the style diversity. In addition, we develop a basic random convolution layer into a random convolution block including deformable offsets and affine transformation to support texture and contrast diversification, both of which are also randomly initialized. Without complex generators or adversarial learning, we demonstrate that our simple yet effective augmentation strategy outperforms state-of-the-art methods on single domain generalization benchmarks.","url_abs":"https://arxiv.org/abs/2304.00424v1","url_pdf":"https://arxiv.org/pdf/2304.00424v1.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":[],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"domain-generalization","task_name":"Domain Generalization"},{"task_slug":"image-augmentation","task_name":"Image Augmentation"},{"task_slug":"image-to-sketch-recognition","task_name":"Image to sketch recognition"},{"task_slug":"photo-to-rest-generalization","task_name":"Photo to Rest Generalization"},{"task_slug":"single-source-domain-generalization","task_name":"Single-Source Domain Generalization"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/photo-to-rest-generalization-on-pacs","task":"Photo to Rest Generalization","dataset":"PACS","model":"ProRandConv (ResNet18)","rank_in_archive_order":2,"of":8,"metrics":{"Accuracy":"62.89"},"uses_additional_data":false},{"leaderboard":"/sota/single-source-domain-generalization-on-digits","task":"Single-Source Domain Generalization","dataset":"Digits-five","model":"ProRandConv (LeNet)","rank_in_archive_order":2,"of":7,"metrics":{"Accuracy":"81.35"},"uses_additional_data":false},{"leaderboard":"/sota/single-source-domain-generalization-on-pacs","task":"Single-Source Domain Generalization","dataset":"PACS","model":"ProRandConv (ResNet18)","rank_in_archive_order":3,"of":10,"metrics":{"Accuracy":"68.88"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2304.00424","atlas_url":"https://app.syntology.ai/?focus=2304.00424","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":"2304.00424"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2304.00424\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2304.00424"},"call":"get_concepts_for_paper(arxiv_id=\"2304.00424\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b917b696d2b6c47d6502618b9994b601e6656b8cad9548230f667c3cc28cfcbf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}