{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GCBFE2MO4JLVR6Y7K7ZW4YTJHV","short_pith_number":"pith:GCBFE2MO","canonical_record":{"source":{"id":"1906.02387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-06T02:33:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5ad04aea8aa84cd4ee026efff4718bca5dcef28fd198942e985d10e79f08c689","abstract_canon_sha256":"5e59ca3a748afcc851d480739829f456d71dbe6be0061fe3d2c0dde1c70b2262"},"schema_version":"1.0"},"canonical_sha256":"308252698ee25758fb1f57f36e62693d7eef87ef5e770ef6af329ba47fe3da29","source":{"kind":"arxiv","id":"1906.02387","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02387","created_at":"2026-05-17T23:43:59Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02387v2","created_at":"2026-05-17T23:43:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02387","created_at":"2026-05-17T23:43:59Z"},{"alias_kind":"pith_short_12","alias_value":"GCBFE2MO4JLV","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GCBFE2MO4JLVR6Y7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GCBFE2MO","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GCBFE2MO4JLVR6Y7K7ZW4YTJHV","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-06T02:33:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5ad04aea8aa84cd4ee026efff4718bca5dcef28fd198942e985d10e79f08c689","abstract_canon_sha256":"5e59ca3a748afcc851d480739829f456d71dbe6be0061fe3d2c0dde1c70b2262"},"schema_version":"1.0"},"canonical_sha256":"308252698ee25758fb1f57f36e62693d7eef87ef5e770ef6af329ba47fe3da29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:59.884980Z","signature_b64":"XaA+HS0s3CvgevA849LZA9mHkOrYjiXQt9ZjVsDhREHG6VrXA2TiC+u74B9VDQUS4pA68B+3cQY6X3kWKNSFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"308252698ee25758fb1f57f36e62693d7eef87ef5e770ef6af329ba47fe3da29","last_reissued_at":"2026-05-17T23:43:59.884464Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:59.884464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02387","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVccGCKppCnXHhEMdhRiH5BbBuezu8xsiXDH80hsJqjUXAQ4PqdxiRLMDlU4792TT6U84gRiHHYXuYp/RGU4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:42:47.440634Z"},"content_sha256":"75985eef7626cd2c2628c586d24530efa3a021d515e430c43849e7718fcc7129","schema_version":"1.0","event_id":"sha256:75985eef7626cd2c2628c586d24530efa3a021d515e430c43849e7718fcc7129"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GCBFE2MO4JLVR6Y7K7ZW4YTJHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General $\\mathcal{O}(n^2)$ Hyper-Parameter Optimization for Gaussian Process Regression with Cross-Validation and Non-linearly Constrained ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Feng Yin, Jiawei Zhang, Linning Xu, Shuguang Cui, Zhi-Quan Luo","submitted_at":"2019-06-06T02:33:09Z","abstract_excerpt":"Hyper-parameter optimization remains as the core issue of Gaussian process (GP) for machine learning nowadays. The benchmark method using maximum likelihood (ML) estimation and gradient descent (GD) is impractical for processing big data due to its $O(n^3)$ complexity. Many sophisticated global or local approximation models, for instance, sparse GP, distributed GP, have been proposed to address such complexity issue. In this paper, we propose two novel and general-purpose GP hyper-parameter training schemes (GPCV-ADMM) by replacing ML with cross-validation (CV) as the fitting criterion and rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02387","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xrcgd6if2QlBpRoXDwGs9i8U76Lm8OG5/jOnn5XG6rwbI/0bqIAAWICVVn5EWNEoSk/Ae8qV52t/ObnrwhRZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:42:47.441247Z"},"content_sha256":"21c9301530d92adb226474f54952a83a358e985f34c373e65a4df365a0542bcd","schema_version":"1.0","event_id":"sha256:21c9301530d92adb226474f54952a83a358e985f34c373e65a4df365a0542bcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCBFE2MO4JLVR6Y7K7ZW4YTJHV/bundle.json","state_url":"https://pith.science/pith/GCBFE2MO4JLVR6Y7K7ZW4YTJHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCBFE2MO4JLVR6Y7K7ZW4YTJHV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T14:42:47Z","links":{"resolver":"https://pith.science/pith/GCBFE2MO4JLVR6Y7K7ZW4YTJHV","bundle":"https://pith.science/pith/GCBFE2MO4JLVR6Y7K7ZW4YTJHV/bundle.json","state":"https://pith.science/pith/GCBFE2MO4JLVR6Y7K7ZW4YTJHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCBFE2MO4JLVR6Y7K7ZW4YTJHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GCBFE2MO4JLVR6Y7K7ZW4YTJHV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5e59ca3a748afcc851d480739829f456d71dbe6be0061fe3d2c0dde1c70b2262","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-06T02:33:09Z","title_canon_sha256":"5ad04aea8aa84cd4ee026efff4718bca5dcef28fd198942e985d10e79f08c689"},"schema_version":"1.0","source":{"id":"1906.02387","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02387","created_at":"2026-05-17T23:43:59Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02387v2","created_at":"2026-05-17T23:43:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02387","created_at":"2026-05-17T23:43:59Z"},{"alias_kind":"pith_short_12","alias_value":"GCBFE2MO4JLV","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GCBFE2MO4JLVR6Y7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GCBFE2MO","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:21c9301530d92adb226474f54952a83a358e985f34c373e65a4df365a0542bcd","target":"graph","created_at":"2026-05-17T23:43:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Hyper-parameter optimization remains as the core issue of Gaussian process (GP) for machine learning nowadays. The benchmark method using maximum likelihood (ML) estimation and gradient descent (GD) is impractical for processing big data due to its $O(n^3)$ complexity. Many sophisticated global or local approximation models, for instance, sparse GP, distributed GP, have been proposed to address such complexity issue. In this paper, we propose two novel and general-purpose GP hyper-parameter training schemes (GPCV-ADMM) by replacing ML with cross-validation (CV) as the fitting criterion and rep","authors_text":"Feng Yin, Jiawei Zhang, Linning Xu, Shuguang Cui, Zhi-Quan Luo","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-06T02:33:09Z","title":"A General $\\mathcal{O}(n^2)$ Hyper-Parameter Optimization for Gaussian Process Regression with Cross-Validation and Non-linearly Constrained ADMM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02387","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:75985eef7626cd2c2628c586d24530efa3a021d515e430c43849e7718fcc7129","target":"record","created_at":"2026-05-17T23:43:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5e59ca3a748afcc851d480739829f456d71dbe6be0061fe3d2c0dde1c70b2262","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-06T02:33:09Z","title_canon_sha256":"5ad04aea8aa84cd4ee026efff4718bca5dcef28fd198942e985d10e79f08c689"},"schema_version":"1.0","source":{"id":"1906.02387","kind":"arxiv","version":2}},"canonical_sha256":"308252698ee25758fb1f57f36e62693d7eef87ef5e770ef6af329ba47fe3da29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"308252698ee25758fb1f57f36e62693d7eef87ef5e770ef6af329ba47fe3da29","first_computed_at":"2026-05-17T23:43:59.884464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:59.884464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XaA+HS0s3CvgevA849LZA9mHkOrYjiXQt9ZjVsDhREHG6VrXA2TiC+u74B9VDQUS4pA68B+3cQY6X3kWKNSFBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:59.884980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02387","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75985eef7626cd2c2628c586d24530efa3a021d515e430c43849e7718fcc7129","sha256:21c9301530d92adb226474f54952a83a358e985f34c373e65a4df365a0542bcd"],"state_sha256":"91b982363a1d5ffd38a9a3fbcaf53cde2298bf06f09b43671a7272e2625a14fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+vFaYF4WZxcuj9vib7frF7Ohb0iQaF98y3u2Yatqk9lYUSdqlY/qVpJ7VvlM8iahP75nAafqJZl5DFXaTFTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:42:47.444674Z","bundle_sha256":"5abe0de32c57e787b35ddf2b971c8c387bb06f9333a557ce1936b6e756737462"}}