{"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/saliency-aware-neural-architecture-search","title":"Saliency-Aware Neural Architecture Search","arxiv_id":null,"date":"2022-11-01","proceeding":"NIPS 2022 11","authors":["Ramtin Hosseini","Pengtao Xie"],"abstract":"Recently a wide variety of NAS methods have been proposed and achieved con\u0002siderable success in automatically identifying highly-performing architectures of\r\nneural networks for the sake of reducing the reliance on human experts. Existing\r\nNAS methods ignore the fact that different input data elements (e.g., image pixels)\r\nhave different importance (or saliency) in determining the prediction outcome.\r\nThey treat all data elements as being equally important and therefore lead to subop\u0002timal performance. To address this problem, we propose an end-to-end framework\r\nwhich dynamically detects saliency of input data, reweights data using saliency\r\nmaps, and searches architectures on saliency-reweighted data. Our framework is\r\nbased on four-level optimization, which performs four learning stages in a unified\r\nway. At the first stage, a model is trained with its architecture tentatively fixed. At\r\nthe second stage, saliency maps are generated using the trained model. At the third\r\nstage, the model is retrained on saliency-reweighted data. At the fourth stage, the\r\nmodel is evaluated on a validation set and the architecture is updated by minimizing\r\nthe validation loss. Experiments on several datasets demonstrate the effectiveness\r\nof our framework","url_abs":"https://openreview.net/forum?id=Ho6oWAslz5L","url_pdf":"https://openreview.net/pdf?id=Ho6oWAslz5L","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":"saliency-aware-neural-architecture-search","repo_url":"https://github.com/leopard-ai/betty","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"architecture-search","task_name":"Neural Architecture Search"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"leopard-ai/betty","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1806.09055"],"harvested_for_calls":[{"arxiv_id":"1806.09055","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.09055"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.09055\")"}]}],"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":"b4593fe85ce4d0022005e41837cc4054bed9ea6f5863acd434f7ed74e0042a42","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}