{"url":"/sota/image-classification-on-colored-mnist-with","task":{"name":"Image Classification","url":"/task/image-classification","note":null},"dataset":{"name":"Colored-MNIST(with spurious correlation)","url":"/dataset/colored-mnist-spurious-correlation"},"category":"Computer Vision","categories":["Adversarial","Computer Vision"],"category_note":null,"description":"**Image Classification** is a fundamental task in vision recognition that aims to understand and categorize an image as a whole under a specific label. Unlike [object detection](/task/object-detection), which involves classification and location of multiple objects within an image, image classification typically pertains to single-object images. When the classification becomes highly detailed or reaches instance-level, it is often referred to as [image retrieval](/task/image-retrieval), which also involves finding similar images in a large database.\r\n\r\n\r\n<span class=\"description-source\">Source: [Metamorphic Testing for Object Detection Systems ](https://arxiv.org/abs/1912.12162)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy "],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy ":"higher"}},"counts":{"rows":6,"rows_with_code":5,"rows_with_paper_page":6,"rows_dated":6,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"MLP-DecAug","metrics":{"Accuracy ":"69.60"},"uses_additional_data":false,"paper_date":"2020-12-17","paper":"/paper/decaug-out-of-distribution-generalization-via","paper_url":"https://arxiv.org/abs/2012.09382v1","paper_title":"DecAug: Out-of-Distribution Generalization via Decomposed Feature Representation and Semantic Augmentation","code":"https://github.com/HaoyueBaiZJU/DecAug","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"MLP-REx","metrics":{"Accuracy ":"68.70"},"uses_additional_data":false,"paper_date":"2020-03-02","paper":"/paper/out-of-distribution-generalization-via-risk","paper_url":"https://arxiv.org/abs/2003.00688v5","paper_title":"Out-of-Distribution Generalization via Risk Extrapolation (REx)","code":"https://github.com/thuml/Transfer-Learning-Library","n_code_links":4,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":3}},{"rank_in_archive_order":3,"model":"MLP-IRM","metrics":{"Accuracy ":"66.9"},"uses_additional_data":false,"paper_date":"2019-07-05","paper":"/paper/invariant-risk-minimization","paper_url":"https://arxiv.org/abs/1907.02893v3","paper_title":"Invariant Risk Minimization","code":"https://github.com/thuml/Transfer-Learning-Library","n_code_links":18,"syntology":{"n_ran":18,"n_unverified":12,"n_samples":30,"n_pointer_only_licence":10}},{"rank_in_archive_order":4,"model":"F-IRMGames","metrics":{"Accuracy ":"59.91"},"uses_additional_data":false,"paper_date":"2020-02-11","paper":"/paper/invariant-risk-minimization-games","paper_url":"https://arxiv.org/abs/2002.04692v2","paper_title":"Invariant Risk Minimization Games","code":"https://github.com/IBM/OoD","n_code_links":3,"syntology":null},{"rank_in_archive_order":5,"model":"MLP-ERM","metrics":{"Accuracy ":"17.10"},"uses_additional_data":false,"paper_date":"2017-02-07","paper":"/paper/empirical-risk-minimization-for-stochastic","paper_url":"http://arxiv.org/abs/1702.02030v1","paper_title":"Empirical Risk Minimization for Stochastic Convex Optimization: $O(1/n)$- and $O(1/n^2)$-type of Risk Bounds","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"JiGen","metrics":{"Accuracy ":"11.91"},"uses_additional_data":false,"paper_date":"2019-03-16","paper":"/paper/domain-generalization-by-solving-jigsaw","paper_url":"http://arxiv.org/abs/1903.06864v2","paper_title":"Domain Generalization by Solving Jigsaw Puzzles","code":"https://github.com/fmcarlucci/JigenDG","n_code_links":2,"syntology":null}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":2,"rows_with_any_sample_ran":2,"distinct_papers_with_graph_line":2,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":21,"n_unverified":13,"n_samples":34,"n_pointer_only_licence":13,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":21,"n_unverified":13,"n_samples":34,"n_pointer_only_licence":13,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}