{"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/k-sparse-autoencoders","title":"k-Sparse Autoencoders","arxiv_id":"1312.5663","date":"2013-12-19","proceeding":null,"authors":["Alireza Makhzani","Brendan Frey"],"abstract":"Recently, it has been observed that when representations are learnt in a way\nthat encourages sparsity, improved performance is obtained on classification\ntasks. These methods involve combinations of activation functions, sampling\nsteps and different kinds of penalties. To investigate the effectiveness of\nsparsity by itself, we propose the k-sparse autoencoder, which is an\nautoencoder with linear activation function, where in hidden layers only the k\nhighest activities are kept. When applied to the MNIST and NORB datasets, we\nfind that this method achieves better classification results than denoising\nautoencoders, networks trained with dropout, and RBMs. k-sparse autoencoders\nare simple to train and the encoding stage is very fast, making them\nwell-suited to large problem sizes, where conventional sparse coding algorithms\ncannot be applied.","url_abs":"http://arxiv.org/abs/1312.5663v2","url_pdf":"http://arxiv.org/pdf/1312.5663v2.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":"k-sparse-autoencoders","repo_url":"https://github.com/Sharda-Borse/AutoEncoders","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"gone","observed_at":"2026-09-18","how":"tree_404+repo_404"}},{"paper_slug":"k-sparse-autoencoders","repo_url":"https://github.com/kyeongry/Autoencoders","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"k-sparse-autoencoders","repo_url":"https://github.com/windowtodata/python-projects","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"k-sparse-autoencoder","method_name":"k-Sparse Autoencoder"}],"datasets_introduced":[],"methods_introduced":[{"slug":"k-sparse-autoencoder","name":"k-Sparse Autoencoder","full_name":"k-Sparse Autoencoder"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1312.5663","atlas_url":"https://app.syntology.ai/?focus=1312.5663","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":"1312.5663"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1312.5663\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1312.5663"},"call":"get_concepts_for_paper(arxiv_id=\"1312.5663\")"}],"by_repo":[{"repo":"Sharda-Borse/AutoEncoders","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kyeongry/Autoencoders","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"windowtodata/python-projects","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":"f4e8c2ba0893f05a38be35ecc3cb27c7dbc8aa6954db6d9905e9b9c2a9af7609","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}