{"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":"/dataset/visual-domain-decathlon","name":"Visual Domain Decathlon","full_name":"Visual Domain Decathlon","description_markdown":"The goal of this challenge is to solve simultaneously ten image classification problems representative of very different visual domains. The data for each domain is obtained from the following image classification benchmarks:\r\n\r\nImageNet  \r\nCIFAR-100  \r\nAircraft  \r\nDaimler pedestrian classification  \r\nDescribable textures  \r\nGerman traffic signs  \r\nOmniglot  \r\nSVHN  \r\nUCF101 Dynamic Images  \r\nVGG-Flowers  \r\n\r\nThe union of the images from the ten datasets is split in training, validation, and test subsets. Different domains contain different image categories as well as a different number of images.\r\n\r\nThe task is to train the best possible classifier to address all ten classification tasks using the training and validation subsets, apply the classifier to the test set, and send us the resulting annotation file for assessment. The winner will be determined based on a weighted average of the classification performance on each domain, using the scoring scheme described below. At test time, your model is allowed to know the ground-truth domain of each test image (ImageNet, CIFAR-100, ...) but, of course, not its category.","description_withheld":null,"homepage":"https://www.robots.ox.ac.uk/~vgg/decathlon/","introduced_date":null,"introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[],"tasks":[{"name":"Continual Learning","url":"/task/continual-learning","datasets_with_task":"/datasets/task/continual-learning"}],"languages":[],"variants":["visual domain decathlon (10 tasks)","Visual Domain Decathlon"],"data_loaders":[{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/visual_domain_decathlon","frameworks":["tf","pytorch","jax"]}],"num_papers_in_archive":8,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/continual-learning-on-visual-domain-decathlon","task":"Continual Learning","dataset_variant":"visual domain decathlon (10 tasks)","rows":14,"metrics":["decathlon discipline (Score)","Avg. Accuracy"],"first_row_in_archive_order":{"model":"NetTailor","paper":"/paper/nettailor-tuning-the-architecture-not-just-1","metrics":{"Avg. Accuracy":"79.64","decathlon discipline (Score)":"3744"},"code_links":[{"title":"pedro-morgado/nettailor","url":"https://github.com/pedro-morgado/nettailor"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":8,"of":8,"counts":{"papers_with_a_benchmark_row":8,"with_a_code_link":6,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":8,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/nettailor-tuning-the-architecture-not-just-1","slug":"nettailor-tuning-the-architecture-not-just-1","title":"NetTailor: Tuning the Architecture, Not Just the Weights","date":"2019-06-29","arxiv_id":"1907.00274","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/depthwise-convolution-is-all-you-need-for","slug":"depthwise-convolution-is-all-you-need-for","title":"Depthwise Convolution is All You Need for Learning Multiple Visual Domains","date":"2019-02-03","arxiv_id":"1902.00927","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/efficient-parametrization-of-multi-domain","slug":"efficient-parametrization-of-multi-domain","title":"Efficient parametrization of multi-domain deep neural networks","date":"2018-03-27","arxiv_id":"1803.10082","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficient-parametrization-of-multi-domain#ran","syntology_url":"https://syntology.ai/paper/1803.10082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10082"}}}},{"paper":"/paper/piggyback-adapting-a-single-network-to","slug":"piggyback-adapting-a-single-network-to","title":"Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weights","date":"2018-01-19","arxiv_id":"1801.06519","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-multiple-visual-domains-with","slug":"learning-multiple-visual-domains-with","title":"Learning multiple visual domains with residual adapters","date":"2017-05-22","arxiv_id":"1705.08045","rows_on_this_dataset":5,"code_links":2,"syntology":null},{"paper":"/paper/incremental-learning-through-deep-adaptation","slug":"incremental-learning-through-deep-adaptation","title":"Incremental Learning Through Deep Adaptation","date":"2017-05-11","arxiv_id":"1705.04228","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/universal-representationsthe-missing-link","slug":"universal-representationsthe-missing-link","title":"Universal representations:The missing link between faces, text, planktons, and cat breeds","date":"2017-01-25","arxiv_id":"1701.07275","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-without-forgetting","slug":"learning-without-forgetting","title":"Learning without Forgetting","date":"2016-06-29","arxiv_id":"1606.09282","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":6,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-without-forgetting#ran","syntology_url":"https://syntology.ai/paper/1606.09282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.09282"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/nettailor-tuning-the-architecture-not-just-1","slug":"nettailor-tuning-the-architecture-not-just-1","title":"NetTailor: Tuning the Architecture, Not Just the Weights","date":"2019-06-29","arxiv_id":"1907.00274","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/depthwise-convolution-is-all-you-need-for","slug":"depthwise-convolution-is-all-you-need-for","title":"Depthwise Convolution is All You Need for Learning Multiple Visual Domains","date":"2019-02-03","arxiv_id":"1902.00927","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/efficient-parametrization-of-multi-domain","slug":"efficient-parametrization-of-multi-domain","title":"Efficient parametrization of multi-domain deep neural networks","date":"2018-03-27","arxiv_id":"1803.10082","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficient-parametrization-of-multi-domain#ran","syntology_url":"https://syntology.ai/paper/1803.10082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10082"}}}},{"paper":"/paper/piggyback-adapting-a-single-network-to","slug":"piggyback-adapting-a-single-network-to","title":"Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weights","date":"2018-01-19","arxiv_id":"1801.06519","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-multiple-visual-domains-with","slug":"learning-multiple-visual-domains-with","title":"Learning multiple visual domains with residual adapters","date":"2017-05-22","arxiv_id":"1705.08045","rows_on_this_dataset":5,"code_links":2,"syntology":null},{"paper":"/paper/incremental-learning-through-deep-adaptation","slug":"incremental-learning-through-deep-adaptation","title":"Incremental Learning Through Deep Adaptation","date":"2017-05-11","arxiv_id":"1705.04228","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/universal-representationsthe-missing-link","slug":"universal-representationsthe-missing-link","title":"Universal representations:The missing link between faces, text, planktons, and cat breeds","date":"2017-01-25","arxiv_id":"1701.07275","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-without-forgetting","slug":"learning-without-forgetting","title":"Learning without Forgetting","date":"2016-06-29","arxiv_id":"1606.09282","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":6,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-without-forgetting#ran","syntology_url":"https://syntology.ai/paper/1606.09282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.09282"}}}}],"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/dataset/visual-domain-decathlon/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/visual-domain-decathlon/papers/ran/1","json":"/dataset/visual-domain-decathlon/papers/ran/1.json","rows":2}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":2,"samples_harvested":18,"samples_ran":12,"samples_constructed":3,"samples_ran_checked":6,"samples_ran_instrument_failed":6,"samples_unverified":6,"pointer_only_for_licence":3,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":2,"papers_with_a_run_with_no_instrument_failure":2,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"f454e7b2136708292a95ab80485cff18b7b04f97552bf8512b5574f859917291","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}