{"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-unified-parallel-algorithm-for-regularized","title":"A Unified Parallel Algorithm for Regularized Group PLS Scalable to Big Data","arxiv_id":"1702.07066","date":"2017-02-23","proceeding":null,"authors":["Pierre Lafaye de Micheaux","Benoit Liquet","Matthew Sutton"],"abstract":"Partial Least Squares (PLS) methods have been heavily exploited to analyse\nthe association between two blocs of data. These powerful approaches can be\napplied to data sets where the number of variables is greater than the number\nof observations and in presence of high collinearity between variables.\nDifferent sparse versions of PLS have been developed to integrate multiple data\nsets while simultaneously selecting the contributing variables. Sparse\nmodelling is a key factor in obtaining better estimators and identifying\nassociations between multiple data sets. The cornerstone of the sparsity\nversion of PLS methods is the link between the SVD of a matrix (constructed\nfrom deflated versions of the original matrices of data) and least squares\nminimisation in linear regression. We present here an accurate description of\nthe most popular PLS methods, alongside their mathematical proofs. A unified\nalgorithm is proposed to perform all four types of PLS including their\nregularised versions. Various approaches to decrease the computation time are\noffered, and we show how the whole procedure can be scalable to big data sets.","url_abs":"http://arxiv.org/abs/1702.07066v1","url_pdf":"http://arxiv.org/pdf/1702.07066v1.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-unified-parallel-algorithm-for-regularized","repo_url":"https://github.com/matt-sutton/bigsgPLS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"mathematical-proofs","task_name":"Mathematical Proofs"}],"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":"matt-sutton/bigsgPLS","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":"7d0759e7c1b002d47ac1e150a809654f520b69cb6fb230ecf27b7c7035c859e3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}