{"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-pca-like-autoencoder","title":"A PCA-like Autoencoder","arxiv_id":"1904.01277","date":"2019-04-02","proceeding":null,"authors":["Saïd Ladjal","Alasdair Newson","Chi-Hieu Pham"],"abstract":"An autoencoder is a neural network which data projects to and from a lower\ndimensional latent space, where this data is easier to understand and model.\nThe autoencoder consists of two sub-networks, the encoder and the decoder,\nwhich carry out these transformations. The neural network is trained such that\nthe output is as close to the input as possible, the data having gone through\nan information bottleneck : the latent space. This tool bears significant\nressemblance to Principal Component Analysis (PCA), with two main differences.\nFirstly, the autoencoder is a non-linear transformation, contrary to PCA, which\nmakes the autoencoder more flexible and powerful. Secondly, the axes found by a\nPCA are orthogonal, and are ordered in terms of the amount of variability which\nthe data presents along these axes. This makes the interpretability of the PCA\nmuch greater than that of the autoencoder, which does not have these\nattributes. Ideally, then, we would like an autoencoder whose latent space\nconsists of independent components, ordered by decreasing importance to the\ndata. In this paper, we propose an algorithm to create such a network. We\ncreate an iterative algorithm which progressively increases the size of the\nlatent space, learning a new dimension at each step. Secondly, we propose a\ncovariance loss term to add to the standard autoencoder loss function, as well\nas a normalisation layer just before the latent space, which encourages the\nlatent space components to be statistically independent. We demonstrate the\nresults of this autoencoder on simple geometric shapes, and find that the\nalgorithm indeed finds a meaningful representation in the latent space. This\nmeans that subsequent interpolation in the latent space has meaning with\nrespect to the geometric properties of the images.","url_abs":"http://arxiv.org/abs/1904.01277v1","url_pdf":"http://arxiv.org/pdf/1904.01277v1.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-pca-like-autoencoder","repo_url":"https://github.com/chieupham/PCAAE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[{"method_slug":"interpretability","method_name":"Interpretability"},{"method_slug":"pca","method_name":"PCA"}],"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":"chieupham/PCAAE","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":"11bf68f51bbb63ae9274f036b81d090d03d450661ebbd8fe956eeb9e2e5ad645","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}