{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/randomly-projected-additive-gaussian","title":"Randomly Projected Additive Gaussian Processes for Regression","arxiv_id":"1912.12834","date":"2019-12-30","proceeding":"ICML 2020 1","authors":["Ian A. Delbridge","David S. Bindel","Andrew Gordon Wilson"],"abstract":"Gaussian processes (GPs) provide flexible distributions over functions, with inductive biases controlled by a kernel. However, in many applications Gaussian processes can struggle with even moderate input dimensionality. Learning a low dimensional projection can help alleviate this curse of dimensionality, but introduces many trainable hyperparameters, which can be cumbersome, especially in the small data regime. We use additive sums of kernels for GP regression, where each kernel operates on a different random projection of its inputs. Surprisingly, we find that as the number of random projections increases, the predictive performance of this approach quickly converges to the performance of a kernel operating on the original full dimensional inputs, over a wide range of data sets, even if we are projecting into a single dimension. As a consequence, many problems can remarkably be reduced to one dimensional input spaces, without learning a transformation. We prove this convergence and its rate, and additionally propose a deterministic approach that converges more quickly than purely random projections. Moreover, we demonstrate our approach can achieve faster inference and improved predictive accuracy for high-dimensional inputs compared to kernels in the original input space.","url_abs":"https://arxiv.org/abs/1912.12834v1","url_pdf":"https://arxiv.org/pdf/1912.12834v1.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":"randomly-projected-additive-gaussian","repo_url":"https://github.com/idelbrid/Randomly-Projected-Additive-GPs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"},{"task_slug":"small-data","task_name":"Small Data Image Classification"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1912.12834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.12834"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/idelbrid/Randomly-Projected-Additive-GPs","reach":null}],"summary":{"ran_honours":3,"ran_draft_wrong":1},"by_repo_kind":{"official":{"samples":4,"ran":4,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"95239373d72a475e","entry":"bimodal_d_dim","repo":"idelbrid/Randomly-Projected-Additive-GPs","repo_kind":"official","path":"synthetic_test_script.py","file_url":"https://github.com/idelbrid/Randomly-Projected-Additive-GPs/blob/HEAD/synthetic_test_script.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"95239373d72a475e"}},{"code_sha256_prefix":"14ef17ce24d09e96","entry":"format_timedelta","repo":"idelbrid/Randomly-Projected-Additive-GPs","repo_kind":"official","path":"gp_experiment_runner.py","file_url":"https://github.com/idelbrid/Randomly-Projected-Additive-GPs/blob/HEAD/gp_experiment_runner.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"14ef17ce24d09e96"}},{"code_sha256_prefix":"57e9f5e08aac0164","entry":"multimodal_d_dim","repo":"idelbrid/Randomly-Projected-Additive-GPs","repo_kind":"official","path":"synthetic_test_script.py","file_url":"https://github.com/idelbrid/Randomly-Projected-Additive-GPs/blob/HEAD/synthetic_test_script.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"57e9f5e08aac0164"}},{"code_sha256_prefix":"bdf397df2657c3f9","entry":"unimodal_d_dim","repo":"idelbrid/Randomly-Projected-Additive-GPs","repo_kind":"official","path":"synthetic_test_script.py","file_url":"https://github.com/idelbrid/Randomly-Projected-Additive-GPs/blob/HEAD/synthetic_test_script.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"bdf397df2657c3f9"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}