{"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/conditional-computation-in-neural-networks","title":"Conditional Computation in Neural Networks for faster models","arxiv_id":"1511.06297","date":"2015-11-19","proceeding":null,"authors":["Emmanuel Bengio","Pierre-Luc Bacon","Joelle Pineau","Doina Precup"],"abstract":"Deep learning has become the state-of-art tool in many applications, but the\nevaluation and training of deep models can be time-consuming and\ncomputationally expensive. The conditional computation approach has been\nproposed to tackle this problem (Bengio et al., 2013; Davis & Arel, 2013). It\noperates by selectively activating only parts of the network at a time. In this\npaper, we use reinforcement learning as a tool to optimize conditional\ncomputation policies. More specifically, we cast the problem of learning\nactivation-dependent policies for dropping out blocks of units as a\nreinforcement learning problem. We propose a learning scheme motivated by\ncomputation speed, capturing the idea of wanting to have parsimonious\nactivations while maintaining prediction accuracy. We apply a policy gradient\nalgorithm for learning policies that optimize this loss function and propose a\nregularization mechanism that encourages diversification of the dropout policy.\nWe present encouraging empirical results showing that this approach improves\nthe speed of computation without impacting the quality of the approximation.","url_abs":"http://arxiv.org/abs/1511.06297v2","url_pdf":"http://arxiv.org/pdf/1511.06297v2.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":"conditional-computation-in-neural-networks","repo_url":"https://github.com/bengioe/condnet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.06297","atlas_url":"https://app.syntology.ai/?focus=1511.06297","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":"1511.06297"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.06297\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.06297"},"call":"get_concepts_for_paper(arxiv_id=\"1511.06297\")"}],"by_repo":[{"repo":"bengioe/condnet","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":"0490cae4fdf3ec6729dc374e52abd94ee8640be27e6963e9669454c5925e1f8c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}