{"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/temporally-efficient-deep-learning-with","title":"Temporally Efficient Deep Learning with Spikes","arxiv_id":"1706.04159","date":"2017-06-13","proceeding":"ICLR 2018 1","authors":["Peter O'Connor","Efstratios Gavves","Max Welling"],"abstract":"The vast majority of natural sensory data is temporally redundant. Video\nframes or audio samples which are sampled at nearby points in time tend to have\nsimilar values. Typically, deep learning algorithms take no advantage of this\nredundancy to reduce computation. This can be an obscene waste of energy. We\npresent a variant on backpropagation for neural networks in which computation\nscales with the rate of change of the data - not the rate at which we process\nthe data. We do this by having neurons communicate a combination of their\nstate, and their temporal change in state. Intriguingly, this simple\ncommunication rule give rise to units that resemble biologically-inspired leaky\nintegrate-and-fire neurons, and to a weight-update rule that is equivalent to a\nform of Spike-Timing Dependent Plasticity (STDP), a synaptic learning rule\nobserved in the brain. We demonstrate that on MNIST and a temporal variant of\nMNIST, our algorithm performs about as well as a Multilayer Perceptron trained\nwith backpropagation, despite only communicating discrete values between\nlayers.","url_abs":"http://arxiv.org/abs/1706.04159v1","url_pdf":"http://arxiv.org/pdf/1706.04159v1.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":"temporally-efficient-deep-learning-with","repo_url":"https://github.com/petered/pdnn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.04159","atlas_url":"https://app.syntology.ai/?focus=1706.04159","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":"1706.04159"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.04159\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.04159"},"call":"get_concepts_for_paper(arxiv_id=\"1706.04159\")"}],"by_repo":[{"repo":"petered/pdnn","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":"4d08741a395799c6a8f495b8e2b51697972b932cb8318effd3f656fde202bee9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}