{"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/auto-reid-searching-for-a-part-aware-convnet","title":"Auto-ReID: Searching for a Part-aware ConvNet for Person Re-Identification","arxiv_id":"1903.09776","date":"2019-03-23","proceeding":"ICCV 2019 10","authors":["Ruijie Quan","Xuanyi Dong","Yu Wu","Linchao Zhu","Yi Yang"],"abstract":"Prevailing deep convolutional neural networks (CNNs) for person re-IDentification (reID) are usually built upon ResNet or VGG backbones, which were originally designed for classification. Because reID is different from classification, the architecture should be modified accordingly. We propose to automatically search for a CNN architecture that is specifically suitable for the reID task. There are three aspects to be tackled. First, body structural information plays an important role in reID but it is not encoded in backbones. Second, Neural Architecture Search (NAS) automates the process of architecture design without human effort, but no existing NAS methods incorporate the structure information of input images. Third, reID is essentially a retrieval task but current NAS algorithms are merely designed for classification. To solve these problems, we propose a retrieval-based search algorithm over a specifically designed reID search space, named Auto-ReID. Our Auto-ReID enables the automated approach to find an efficient and effective CNN architecture for reID. Extensive experiments demonstrate that the searched architecture achieves state-of-the-art performance while reducing 50% parameters and 53% FLOPs compared to others.","url_abs":"https://arxiv.org/abs/1903.09776v4","url_pdf":"https://arxiv.org/pdf/1903.09776v4.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":"auto-reid-searching-for-a-part-aware-convnet","repo_url":"https://github.com/D-X-Y/GDAS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"auto-reid-searching-for-a-part-aware-convnet","repo_url":"https://github.com/D-X-Y/NAS-Projects","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"auto-reid-searching-for-a-part-aware-convnet","repo_url":"https://github.com/DuanYiqun/Auto-ReID-Fast","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"architecture-search","task_name":"Neural Architecture Search"},{"task_slug":"person-re-identification","task_name":"Person Re-Identification"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/person-re-identification-on-cuhk03-detected","task":"Person Re-Identification","dataset":"CUHK03 detected","model":"Auto-ReID  (ICCV'19)","rank_in_archive_order":9,"of":19,"metrics":{"MAP":"69.3","Rank-1":"73.3"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-labeled","task":"Person Re-Identification","dataset":"CUHK03 labeled","model":"Auto-ReID  (ICCV'19)","rank_in_archive_order":12,"of":21,"metrics":{"MAP":"73.0","Rank-1":"77.9"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-dukemtmc-reid","task":"Person Re-Identification","dataset":"DukeMTMC-reID","model":"Auto-ReID(RK)","rank_in_archive_order":13,"of":94,"metrics":{"Rank-1":"91.4","mAP":"89.2"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-market-1501","task":"Person Re-Identification","dataset":"Market-1501","model":"Auto-ReID(RK)","rank_in_archive_order":58,"of":135,"metrics":{"Rank-1":"95.4","mAP":"94.2"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.09776","atlas_url":"https://app.syntology.ai/?focus=1903.09776","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":"1903.09776"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.09776\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.09776"},"call":"get_concepts_for_paper(arxiv_id=\"1903.09776\")"}],"by_repo":[{"repo":"D-X-Y/GDAS","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1910.05733"],"harvested_for_calls":[{"arxiv_id":"1910.05733","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.05733"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.05733\")"}]},{"repo":"D-X-Y/NAS-Projects","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2001.00326"],"harvested_for_calls":[{"arxiv_id":"2001.00326","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.00326"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.00326\")"}]},{"repo":"DuanYiqun/Auto-ReID-Fast","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"0c90b0620a51a47082508a544c2844ca1b94dfc5310c36ae5c7eb4f595dd15a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}