{"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/projective-inference-in-high-dimensional","title":"Projective Inference in High-dimensional Problems: Prediction and Feature Selection","arxiv_id":"1810.02406","date":"2018-10-04","proceeding":null,"authors":["Juho Piironen","Markus Paasiniemi","Aki Vehtari"],"abstract":"This paper discusses predictive inference and feature selection for\ngeneralized linear models with scarce but high-dimensional data. We argue that\nin many cases one can benefit from a decision theoretically justified two-stage\napproach: first, construct a possibly non-sparse model that predicts well, and\nthen find a minimal subset of features that characterize the predictions. The\nmodel built in the first step is referred to as the \\emph{reference model} and\nthe operation during the latter step as predictive \\emph{projection}. The key\ncharacteristic of this approach is that it finds an excellent tradeoff between\nsparsity and predictive accuracy, and the gain comes from utilizing all\navailable information including prior and that coming from the left out\nfeatures. We review several methods that follow this principle and provide\nnovel methodological contributions. We present a new projection technique that\nunifies two existing techniques and is both accurate and fast to compute. We\nalso propose a way of evaluating the feature selection process using fast\nleave-one-out cross-validation that allows for easy and intuitive model size\nselection. Furthermore, we prove a theorem that helps to understand the\nconditions under which the projective approach could be beneficial. The\nbenefits are illustrated via several simulated and real world examples.","url_abs":"http://arxiv.org/abs/1810.02406v1","url_pdf":"http://arxiv.org/pdf/1810.02406v1.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":"projective-inference-in-high-dimensional","repo_url":"https://github.com/stan-dev/projpred","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"},{"task_slug":"feature-selection","task_name":"feature selection"}],"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":"stan-dev/projpred","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":"ef3b8f877f44ff26b4c85e05ec61071cb361bb2dbc981bd0fae470e74d181ac1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}