{"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/boosting-discriminative-visual-representation","title":"Boosting Discriminative Visual Representation Learning with Scenario-Agnostic Mixup","arxiv_id":"2111.15454","date":"2021-11-30","proceeding":null,"authors":["Siyuan Li","Zicheng Liu","Zedong Wang","Di wu","Zihan Liu","Stan Z. Li"],"abstract":"Mixup is a well-known data-dependent augmentation technique for DNNs, consisting of two sub-tasks: mixup generation and classification. However, the recent dominant online training method confines mixup to supervised learning (SL), and the objective of the generation sub-task is limited to selected sample pairs instead of the whole data manifold, which might cause trivial solutions. To overcome such limitations, we comprehensively study the objective of mixup generation and propose \\textbf{S}cenario-\\textbf{A}gnostic \\textbf{Mix}up (SAMix) for both SL and Self-supervised Learning (SSL) scenarios. Specifically, we hypothesize and verify the objective function of mixup generation as optimizing local smoothness between two mixed classes subject to global discrimination from other classes. Accordingly, we propose $\\eta$-balanced mixup loss for complementary learning of the two sub-objectives. Meanwhile, a label-free generation sub-network is designed, which effectively provides non-trivial mixup samples and improves transferable abilities. Moreover, to reduce the computational cost of online training, we further introduce a pre-trained version, SAMix$^\\mathcal{P}$, achieving more favorable efficiency and generalizability. Extensive experiments on nine SL and SSL benchmarks demonstrate the consistent superiority and versatility of SAMix compared with existing methods.","url_abs":"https://arxiv.org/abs/2111.15454v3","url_pdf":"https://arxiv.org/pdf/2111.15454v3.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":"boosting-discriminative-visual-representation","repo_url":"https://github.com/Westlake-AI/openmixup","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"}],"methods":[{"method_slug":"attention","method_name":"Attention"},{"method_slug":"infonce","method_name":"InfoNCE"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"mixup","method_name":"Mixup"},{"method_slug":"moco","method_name":"MoCo"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"vision-transformer","method_name":"Vision Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-classification-on-cifar-100","task":"Image Classification","dataset":"CIFAR-100","model":"WRN-28-8 +SAMix","rank_in_archive_order":61,"of":211,"metrics":{"Percentage correct":"85.50"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-cifar-100","task":"Image Classification","dataset":"CIFAR-100","model":"ResNeXt-50(32x4d) + SAMix","rank_in_archive_order":76,"of":211,"metrics":{"Percentage correct":"84.42"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"ResNet-101 (SAMix)","rank_in_archive_order":668,"of":1060,"metrics":{"Number of params":"44.6M","Top 1 Accuracy":"81.08%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"ResNet-50 (SAMix)","rank_in_archive_order":753,"of":1060,"metrics":{"Number of params":"25.6M","Top 1 Accuracy":"79.41%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"ResNet-34 (SAMix)","rank_in_archive_order":915,"of":1060,"metrics":{"Number of params":"21.8M","Top 1 Accuracy":"76.35%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"ResNet-18 (SAMix)","rank_in_archive_order":999,"of":1060,"metrics":{"Number of params":"11.7M","Top 1 Accuracy":"72.33%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-places205","task":"Image Classification","dataset":"Places205","model":"SAMix (ResNet-50 Supervised)","rank_in_archive_order":7,"of":15,"metrics":{"Top 1 Accuracy":"64.3"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-tiny-imagenet-1","task":"Image Classification","dataset":"Tiny ImageNet Classification","model":"ResNeXt-50 (SAMix)","rank_in_archive_order":13,"of":23,"metrics":{"Validation Acc":"72.18%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-tiny-imagenet-1","task":"Image Classification","dataset":"Tiny ImageNet Classification","model":"ResNet18 (SAMix)","rank_in_archive_order":17,"of":23,"metrics":{"Validation Acc":"68.89%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-inaturalist-2018","task":"Image Classification","dataset":"iNaturalist 2018","model":"ResNeXt-101 (SAMix)","rank_in_archive_order":36,"of":60,"metrics":{"Top-1 Accuracy":"70.54%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-inaturalist-2018","task":"Image Classification","dataset":"iNaturalist 2018","model":"ResNet-50 (SAMix)","rank_in_archive_order":48,"of":60,"metrics":{"Top-1 Accuracy":"64.84%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2111.15454","atlas_url":"https://app.syntology.ai/?focus=2111.15454","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":"2111.15454"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2111.15454\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2111.15454"},"call":"get_concepts_for_paper(arxiv_id=\"2111.15454\")"}],"by_repo":[{"repo":"Westlake-AI/openmixup","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1710.09412","1712.09913","1905.04899","2312.11954"],"harvested_for_calls":[{"arxiv_id":"1710.09412","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1710.09412"},"call":"get_harvested_code_for_paper(arxiv_id=\"1710.09412\")"},{"arxiv_id":"1712.09913","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1712.09913"},"call":"get_harvested_code_for_paper(arxiv_id=\"1712.09913\")"},{"arxiv_id":"1905.04899","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.04899"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.04899\")"},{"arxiv_id":"2312.11954","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2312.11954"},"call":"get_harvested_code_for_paper(arxiv_id=\"2312.11954\")"}]}],"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":"26b6c4188a67d25114854428b8f15effaa1f28a87476d13ce73b7fe7ae22ce88","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}