{"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/deep-tile-coder-an-efficient-sparse","title":"Fuzzy Tiling Activations: A Simple Approach to Learning Sparse Representations Online","arxiv_id":"1911.08068","date":"2019-11-19","proceeding":"ICLR 2021 1","authors":["Yangchen Pan","Kirby Banman","Martha White"],"abstract":"Recent work has shown that sparse representations -- where only a small percentage of units are active -- can significantly reduce interference. Those works, however, relied on relatively complex regularization or meta-learning approaches, that have only been used offline in a pre-training phase. In this work, we pursue a direction that achieves sparsity by design, rather than by learning. Specifically, we design an activation function that produces sparse representations deterministically by construction, and so is more amenable to online training. The idea relies on the simple approach of binning, but overcomes the two key limitations of binning: zero gradients for the flat regions almost everywhere, and lost precision -- reduced discrimination -- due to coarse aggregation. We introduce a Fuzzy Tiling Activation (FTA) that provides non-negligible gradients and produces overlap between bins that improves discrimination. We first show that FTA is robust under covariate shift in a synthetic online supervised learning problem, where we can vary the level of correlation and drift. Then we move to the deep reinforcement learning setting and investigate both value-based and policy gradient algorithms that use neural networks with FTAs, in classic discrete control and Mujoco continuous control environments. We show that algorithms equipped with FTAs are able to learn a stable policy faster without needing target networks on most domains.","url_abs":"https://arxiv.org/abs/1911.08068v3","url_pdf":"https://arxiv.org/pdf/1911.08068v3.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":"deep-tile-coder-an-efficient-sparse","repo_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"mujoco","task_name":"MuJoCo"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"continuous-control","task_name":"continuous-control"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1911.08068","atlas_url":"https://app.syntology.ai/?focus=1911.08068","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":"1911.08068"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1911.08068\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1911.08068"},"call":"get_concepts_for_paper(arxiv_id=\"1911.08068\")"}],"by_repo":[{"repo":"labmlai/annotated_deep_learning_paper_implementations","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":15,"harvested_for":["1312.5602","1412.6980","1502.03167","1505.04597","1511.05952","1511.06434","1710.10903","1803.08494","1904.09751","2104.09864","2105.14491","2106.09685","2112.04426","2112.10752","2305.14342"],"harvested_for_calls":[{"arxiv_id":"1312.5602","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1312.5602"},"call":"get_harvested_code_for_paper(arxiv_id=\"1312.5602\")"},{"arxiv_id":"1412.6980","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1412.6980"},"call":"get_harvested_code_for_paper(arxiv_id=\"1412.6980\")"},{"arxiv_id":"1502.03167","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.03167"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.03167\")"},{"arxiv_id":"1505.04597","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.04597"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.04597\")"},{"arxiv_id":"1511.05952","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1511.05952"},"call":"get_harvested_code_for_paper(arxiv_id=\"1511.05952\")"},{"arxiv_id":"1511.06434","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1511.06434"},"call":"get_harvested_code_for_paper(arxiv_id=\"1511.06434\")"},{"arxiv_id":"1710.10903","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1710.10903"},"call":"get_harvested_code_for_paper(arxiv_id=\"1710.10903\")"},{"arxiv_id":"1803.08494","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.08494"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.08494\")"},{"arxiv_id":"1904.09751","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.09751"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.09751\")"},{"arxiv_id":"2104.09864","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.09864"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.09864\")"},{"arxiv_id":"2105.14491","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14491"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14491\")"},{"arxiv_id":"2106.09685","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.09685"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.09685\")"},{"arxiv_id":"2112.04426","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2112.04426"},"call":"get_harvested_code_for_paper(arxiv_id=\"2112.04426\")"},{"arxiv_id":"2112.10752","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2112.10752"},"call":"get_harvested_code_for_paper(arxiv_id=\"2112.10752\")"},{"arxiv_id":"2305.14342","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.14342"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.14342\")"}]}],"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":"0fc40d16af6a5f6e15f9183f323313ddf5deebbae165da53e6dc8457399cce38","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}