{"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/stochastic-adaptive-neural-architecture","title":"Stochastic Adaptive Neural Architecture Search for Keyword Spotting","arxiv_id":"1811.06753","date":"2018-11-16","proceeding":null,"authors":["Tom Véniat","Olivier Schwander","Ludovic Denoyer"],"abstract":"The problem of keyword spotting i.e. identifying keywords in a real-time\naudio stream is mainly solved by applying a neural network over successive\nsliding windows. Due to the difficulty of the task, baseline models are usually\nlarge, resulting in a high computational cost and energy consumption level. We\npropose a new method called SANAS (Stochastic Adaptive Neural Architecture\nSearch) which is able to adapt the architecture of the neural network\non-the-fly at inference time such that small architectures will be used when\nthe stream is easy to process (silence, low noise, ...) and bigger networks\nwill be used when the task becomes more difficult. We show that this adaptive\nmodel can be learned end-to-end by optimizing a trade-off between the\nprediction performance and the average computational cost per unit of time.\nExperiments on the Speech Commands dataset show that this approach leads to a\nhigh recognition level while being much faster (and/or energy saving) than\nclassical approaches where the network architecture is static.","url_abs":"http://arxiv.org/abs/1811.06753v1","url_pdf":"http://arxiv.org/pdf/1811.06753v1.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":"stochastic-adaptive-neural-architecture","repo_url":"https://github.com/TomVeniat/SANAS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"keyword-spotting","task_name":"Keyword Spotting"},{"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":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"TomVeniat/SANAS","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"b526d58404c5551a958d2885ad2ad5fa804d1da7bf841b7e87ae13b61aeadd0a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}