{"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/a-mathematical-formalization-of-hierarchical","title":"A Mathematical Formalization of Hierarchical Temporal Memory's Spatial Pooler","arxiv_id":"1601.06116","date":"2016-01-22","proceeding":null,"authors":["James Mnatzaganian","Ernest Fokoué","Dhireesha Kudithipudi"],"abstract":"Hierarchical temporal memory (HTM) is an emerging machine learning algorithm,\nwith the potential to provide a means to perform predictions on spatiotemporal\ndata. The algorithm, inspired by the neocortex, currently does not have a\ncomprehensive mathematical framework. This work brings together all aspects of\nthe spatial pooler (SP), a critical learning component in HTM, under a single\nunifying framework. The primary learning mechanism is explored, where a maximum\nlikelihood estimator for determining the degree of permanence update is\nproposed. The boosting mechanisms are studied and found to be only relevant\nduring the initial few iterations of the network. Observations are made\nrelating HTM to well-known algorithms such as competitive learning and\nattribute bagging. Methods are provided for using the SP for classification as\nwell as dimensionality reduction. Empirical evidence verifies that given the\nproper parameterizations, the SP may be used for feature learning.","url_abs":"http://arxiv.org/abs/1601.06116v3","url_pdf":"http://arxiv.org/pdf/1601.06116v3.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":"a-mathematical-formalization-of-hierarchical","repo_url":"https://github.com/mrkrynmdsco/htm-python","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"}],"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":"mrkrynmdsco/htm-python","kind":"listed","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":"792c81069be2f979969c7c1e17ad1bdadd4e02b449cbeef64d5049fc2be1460d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}