{"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/sifting-common-information-from-many","title":"Sifting Common Information from Many Variables","arxiv_id":"1606.02307","date":"2016-06-07","proceeding":null,"authors":["Greg Ver Steeg","Shuyang Gao","Kyle Reing","Aram Galstyan"],"abstract":"Measuring the relationship between any pair of variables is a rich and active\narea of research that is central to scientific practice. In contrast,\ncharacterizing the common information among any group of variables is typically\na theoretical exercise with few practical methods for high-dimensional data. A\npromising solution would be a multivariate generalization of the famous Wyner\ncommon information, but this approach relies on solving an apparently\nintractable optimization problem. We leverage the recently introduced\ninformation sieve decomposition to formulate an incremental version of the\ncommon information problem that admits a simple fixed point solution, fast\nconvergence, and complexity that is linear in the number of variables. This\nscalable approach allows us to demonstrate the usefulness of common information\nin high-dimensional learning problems. The sieve outperforms standard methods\non dimensionality reduction tasks, solves a blind source separation problem\nthat cannot be solved with ICA, and accurately recovers structure in brain\nimaging data.","url_abs":"http://arxiv.org/abs/1606.02307v4","url_pdf":"http://arxiv.org/pdf/1606.02307v4.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":"sifting-common-information-from-many","repo_url":"https://github.com/gregversteeg/LinearSieve","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"blind-source-separation","task_name":"blind source separation"}],"methods":[{"method_slug":"ica","method_name":"ICA"}],"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":"gregversteeg/LinearSieve","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":"747b8b91b061ac1f0300a346b86ea9e15db67b694e71d44a596d0a12dc705612","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}