{"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/linear-dimensionality-reduction-survey","title":"Linear Dimensionality Reduction: Survey, Insights, and Generalizations","arxiv_id":"1406.0873","date":"2014-06-03","proceeding":null,"authors":["John P. Cunningham","Zoubin Ghahramani"],"abstract":"Linear dimensionality reduction methods are a cornerstone of analyzing high\ndimensional data, due to their simple geometric interpretations and typically\nattractive computational properties. These methods capture many data features\nof interest, such as covariance, dynamical structure, correlation between data\nsets, input-output relationships, and margin between data classes. Methods have\nbeen developed with a variety of names and motivations in many fields, and\nperhaps as a result the connections between all these methods have not been\nhighlighted. Here we survey methods from this disparate literature as\noptimization programs over matrix manifolds. We discuss principal component\nanalysis, factor analysis, linear multidimensional scaling, Fisher's linear\ndiscriminant analysis, canonical correlations analysis, maximum autocorrelation\nfactors, slow feature analysis, sufficient dimensionality reduction,\nundercomplete independent component analysis, linear regression, distance\nmetric learning, and more. This optimization framework gives insight to some\nrarely discussed shortcomings of well-known methods, such as the suboptimality\nof certain eigenvector solutions. Modern techniques for optimization over\nmatrix manifolds enable a generic linear dimensionality reduction solver, which\naccepts as input data and an objective to be optimized, and returns, as output,\nan optimal low-dimensional projection of the data. This simple optimization\nframework further allows straightforward generalizations and novel variants of\nclassical methods, which we demonstrate here by creating an\northogonal-projection canonical correlations analysis. More broadly, this\nsurvey and generic solver suggest that linear dimensionality reduction can move\ntoward becoming a blackbox, objective-agnostic numerical technology.","url_abs":"http://arxiv.org/abs/1406.0873v2","url_pdf":"http://arxiv.org/pdf/1406.0873v2.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":"linear-dimensionality-reduction-survey","repo_url":"https://github.com/cunni/ldr","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"survey","task_name":"Survey"}],"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":"cunni/ldr","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":"4ceec8e515c763e3707b8afc9ad90c56b558db3c13d3d199a1a1bccf72f19462","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}