{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ESL4W6JULBAIESV76ROV6SDHJU","short_pith_number":"pith:ESL4W6JU","schema_version":"1.0","canonical_sha256":"2497cb79345840824abff45d5f48674d0b140221a90c43e378b7d20cfdd56820","source":{"kind":"arxiv","id":"1706.02524","version":2},"attestation_state":"computed","paper":{"title":"Scaling up the Automatic Statistician: Scalable Structure Discovery using Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hyunjik Kim, Yee Whye Teh","submitted_at":"2017-06-08T11:41:51Z","abstract_excerpt":"Automating statistical modelling is a challenging problem in artificial intelligence. The Automatic Statistician takes a first step in this direction, by employing a kernel search algorithm with Gaussian Processes (GP) to provide interpretable statistical models for regression problems. However this does not scale due to its $O(N^3)$ running time for the model selection. We propose Scalable Kernel Composition (SKC), a scalable kernel search algorithm that extends the Automatic Statistician to bigger data sets. In doing so, we derive a cheap upper bound on the GP marginal likelihood that sandwi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.02524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-08T11:41:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a8b99c209106135ef60a2cdea676927c75cc555870c4afb0547d424bd34cff75","abstract_canon_sha256":"b05c1343b133ff9e16a28cf7ea4cda7312e2eb22eadb5f32351ddc33c421d139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:21.353930Z","signature_b64":"tzLb7E3ayoCRYCrPfP4yEsflag16i1QrEQlbJaLGsPHuwYFopBaU2eVKySq4KlD8d4B4tMBvmhTFcEa0SRIeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2497cb79345840824abff45d5f48674d0b140221a90c43e378b7d20cfdd56820","last_reissued_at":"2026-05-18T00:23:21.353192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:21.353192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling up the Automatic Statistician: Scalable Structure Discovery using Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hyunjik Kim, Yee Whye Teh","submitted_at":"2017-06-08T11:41:51Z","abstract_excerpt":"Automating statistical modelling is a challenging problem in artificial intelligence. The Automatic Statistician takes a first step in this direction, by employing a kernel search algorithm with Gaussian Processes (GP) to provide interpretable statistical models for regression problems. However this does not scale due to its $O(N^3)$ running time for the model selection. We propose Scalable Kernel Composition (SKC), a scalable kernel search algorithm that extends the Automatic Statistician to bigger data sets. In doing so, we derive a cheap upper bound on the GP marginal likelihood that sandwi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02524","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.02524","created_at":"2026-05-18T00:23:21.353327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02524v2","created_at":"2026-05-18T00:23:21.353327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02524","created_at":"2026-05-18T00:23:21.353327+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESL4W6JULBAI","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESL4W6JULBAIESV7","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESL4W6JU","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU","json":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU.json","graph_json":"https://pith.science/api/pith-number/ESL4W6JULBAIESV76ROV6SDHJU/graph.json","events_json":"https://pith.science/api/pith-number/ESL4W6JULBAIESV76ROV6SDHJU/events.json","paper":"https://pith.science/paper/ESL4W6JU"},"agent_actions":{"view_html":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU","download_json":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU.json","view_paper":"https://pith.science/paper/ESL4W6JU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02524&json=true","fetch_graph":"https://pith.science/api/pith-number/ESL4W6JULBAIESV76ROV6SDHJU/graph.json","fetch_events":"https://pith.science/api/pith-number/ESL4W6JULBAIESV76ROV6SDHJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU/action/storage_attestation","attest_author":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU/action/author_attestation","sign_citation":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU/action/citation_signature","submit_replication":"https://pith.science/pith/ESL4W6JULBAIESV76ROV6SDHJU/action/replication_record"}},"created_at":"2026-05-18T00:23:21.353327+00:00","updated_at":"2026-05-18T00:23:21.353327+00:00"}