{"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/unsupervised-embedding-learning-via-invariant","title":"Unsupervised Embedding Learning via Invariant and Spreading Instance Feature","arxiv_id":"1904.03436","date":"2019-04-06","proceeding":"CVPR 2019 6","authors":["Mang Ye","Xu Zhang","Pong C. Yuen","Shih-Fu Chang"],"abstract":"This paper studies the unsupervised embedding learning problem, which\nrequires an effective similarity measurement between samples in low-dimensional\nembedding space. Motivated by the positive concentrated and negative separated\nproperties observed from category-wise supervised learning, we propose to\nutilize the instance-wise supervision to approximate these properties, which\naims at learning data augmentation invariant and instance spread-out features.\nTo achieve this goal, we propose a novel instance based softmax embedding\nmethod, which directly optimizes the `real' instance features on top of the\nsoftmax function. It achieves significantly faster learning speed and higher\naccuracy than all existing methods. The proposed method performs well for both\nseen and unseen testing categories with cosine similarity. It also achieves\ncompetitive performance even without pre-trained network over samples from\nfine-grained categories.","url_abs":"http://arxiv.org/abs/1904.03436v1","url_pdf":"http://arxiv.org/pdf/1904.03436v1.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":"unsupervised-embedding-learning-via-invariant","repo_url":"https://github.com/mangye16/Unsupervised_Embedding_Learning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"data-augmentation","task_name":"Data Augmentation"}],"methods":[{"method_slug":"speed","method_name":"SPEED"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.03436","atlas_url":"https://app.syntology.ai/?focus=1904.03436","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":"1904.03436"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.03436\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.03436"},"call":"get_concepts_for_paper(arxiv_id=\"1904.03436\")"}],"by_repo":[{"repo":"mangye16/Unsupervised_Embedding_Learning","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1805.01978"],"harvested_for_calls":[{"arxiv_id":"1805.01978","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1805.01978"},"call":"get_harvested_code_for_paper(arxiv_id=\"1805.01978\")"}]}],"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":"576372f9f9e82a22a1c83dced2fbcc9565aafa0053ac91cb33933e06dac71a79","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}