{"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":"/method/contractive-autoencoder","slug":"contractive-autoencoder","name":"Contractive Autoencoder","full_name":"Contractive Autoencoder","full_name_withheld":false,"description_markdown":"A **Contractive Autoencoder** is an autoencoder that adds a penalty term to the classical reconstruction cost function. This penalty term corresponds to the Frobenius norm of the Jacobian matrix of the encoder activations with respect to the input. This penalty term results in a localized space contraction which in turn yields robust features on the activation layer. The penalty helps to carve a representation that better captures the local directions of variation dictated by the data, corresponding to a lower-dimensional non-linear manifold, while being more invariant to the vast majority of directions orthogonal to the manifold.","description_state":"present","introduced_year":2011,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Generative Models","url":"/methods/category/generative-models","pwc_aliases":[]}],"n_papers_tagged":5,"archive_num_papers":5,"papers_newest_first":[{"paper":null,"slug":"scalable-self-supervised-representation","title":"Scalable Self-Supervised Representation Learning from Spatiotemporal Motion Trajectories for Multimodal Computer Vision","date":"2022-10-07","arxiv_id":"2210.03289","n_code_links":0,"syntology":null},{"paper":null,"slug":"reachability-embeddings-scalable-self","title":"Reachability Embeddings: Scalable Self-Supervised Representation Learning from Mobility Trajectories for Multimodal Geospatial Computer Vision","date":"2021-10-24","arxiv_id":"2110.12521","n_code_links":0,"syntology":null},{"paper":null,"slug":"predicting-sample-collision-with-neural","title":"Predicting Sample Collision with Neural Networks","date":"2020-06-30","arxiv_id":"2006.16868","n_code_links":0,"syntology":null},{"paper":null,"slug":"majorization-minimization-technique-for","title":"Majorization Minimization Technique for Optimally Solving Deep Dictionary Learning","date":"2019-12-11","arxiv_id":"1912.10801","n_code_links":0,"syntology":null},{"paper":"/paper/towards-deep-neural-network-architectures","slug":"towards-deep-neural-network-architectures","title":"Towards Deep Neural Network Architectures Robust to Adversarial Examples","date":"2014-12-11","arxiv_id":"1412.5068","n_code_links":2,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":null}}],"papers_shown":5,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":5,"with_a_code_link":1,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":5,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/contractive-autoencoder/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/contractive-autoencoder/papers/ran/1","json":"/method/contractive-autoencoder/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/denoising","name":"Denoising","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":2},{"task":"/task/dictionary-learning","name":"Dictionary Learning","papers":1},{"task":"/task/motion-planning","name":"Motion Planning","papers":1}],"tasks_shown":5,"n_tasks":5,"usage_by_year":[{"year":"2014","papers":1},{"year":"2019","papers":1},{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/contractive-autoencoder"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Contractive%20Autoencoder","read_at":"2026-10-05T00:53:58+00:00","query":"Contractive Autoencoder","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Contractive Autoencoder' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["LSTM Autoencoder","Video Autoencoder","Hybrid Autoencoder","Hybrid Autoencoder","Soft TPR Autoencoder","Swapping Autoencoder","Informed Autoencoder","Geometric Autoencoder"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"b555cf2bb6df7c25010866b5226fae922fc814affa46eccef10f6e3e0601adb0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}