{"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/scalable-convolutional-dictionary-learning","title":"Scalable Convolutional Dictionary Learning with Constrained Recurrent Sparse Auto-encoders","arxiv_id":"1807.04734","date":"2018-07-12","proceeding":null,"authors":["Bahareh Tolooshams","Sourav Dey","Demba Ba"],"abstract":"Given a convolutional dictionary underlying a set of observed signals, can a\ncarefully designed auto-encoder recover the dictionary in the presence of\nnoise? We introduce an auto-encoder architecture, termed constrained recurrent\nsparse auto-encoder (CRsAE), that answers this question in the affirmative.\nGiven an input signal and an approximate dictionary, the encoder finds a sparse\napproximation using FISTA. The decoder reconstructs the signal by applying the\ndictionary to the output of the encoder. The encoder and decoder in CRsAE\nparallel the sparse-coding and dictionary update steps in optimization-based\nalternating-minimization schemes for dictionary learning. As such, the\nparameters of the encoder and decoder are not independent, a constraint which\nwe enforce for the first time. We derive the back-propagation algorithm for\nCRsAE. CRsAE is a framework for blind source separation that, only knowing the\nnumber of sources (dictionary elements), and assuming sparsely-many can\noverlap, is able to separate them. We demonstrate its utility in the context of\nspike sorting, a source separation problem in computational neuroscience. We\ndemonstrate the ability of CRsAE to recover the underlying dictionary and\ncharacterize its sensitivity as a function of SNR.","url_abs":"http://arxiv.org/abs/1807.04734v1","url_pdf":"http://arxiv.org/pdf/1807.04734v1.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":"scalable-convolutional-dictionary-learning","repo_url":"https://github.com/ds2p/crsae","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"dictionary-learning","task_name":"Dictionary Learning"},{"task_slug":"spike-sorting","task_name":"Spike Sorting"},{"task_slug":"blind-source-separation","task_name":"blind source separation"}],"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":"ds2p/crsae","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":"5598dd83880b18df83d777e0a580aefa9a2eb5b46bd19f17507ede84fc280fcb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}