{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HHS44OWKH7OAQIYELJBRGPSHCU","short_pith_number":"pith:HHS44OWK","schema_version":"1.0","canonical_sha256":"39e5ce3aca3fdc0823045a43133e47150a3f7263aebb5a5755c0721a29f5d24a","source":{"kind":"arxiv","id":"2410.09239","version":1},"attestation_state":"computed","paper":{"title":"Scaling Gaussian Processes for Learning Curve Prediction via Latent Kronecker Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eytan Bakshy, Jihao Andreas Lin, Maximilian Balandat, Sebastian Ament","submitted_at":"2024-10-11T20:24:33Z","abstract_excerpt":"A key task in AutoML is to model learning curves of machine learning models jointly as a function of model hyper-parameters and training progression. While Gaussian processes (GPs) are suitable for this task, na\\\"ive GPs require $\\mathcal{O}(n^3m^3)$ time and $\\mathcal{O}(n^2 m^2)$ space for $n$ hyper-parameter configurations and $\\mathcal{O}(m)$ learning curve observations per hyper-parameter. Efficient inference via Kronecker structure is typically incompatible with early-stopping due to missing learning curve values. We impose $\\textit{latent Kronecker structure}$ to leverage efficient prod"},"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":"2410.09239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-11T20:24:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a948edd73bda04f1d32db704e0ffc76c3403144afce4431618d17a1dfa51cd45","abstract_canon_sha256":"bf8246f4ceacc334f8bd344576a380d3f7a6660f1930920ef8b5ea32a2835975"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:36.235244Z","signature_b64":"dV7jMSlzNB5wONP9Zk2+eiZ9XieXJZryCUmWkJ/CrgVCFHkZPWOLGCZAOYVLPg7axAQBpvbXqxfYttsI8nEhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39e5ce3aca3fdc0823045a43133e47150a3f7263aebb5a5755c0721a29f5d24a","last_reissued_at":"2026-07-05T09:19:36.234701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:36.234701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Gaussian Processes for Learning Curve Prediction via Latent Kronecker Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eytan Bakshy, Jihao Andreas Lin, Maximilian Balandat, Sebastian Ament","submitted_at":"2024-10-11T20:24:33Z","abstract_excerpt":"A key task in AutoML is to model learning curves of machine learning models jointly as a function of model hyper-parameters and training progression. While Gaussian processes (GPs) are suitable for this task, na\\\"ive GPs require $\\mathcal{O}(n^3m^3)$ time and $\\mathcal{O}(n^2 m^2)$ space for $n$ hyper-parameter configurations and $\\mathcal{O}(m)$ learning curve observations per hyper-parameter. Efficient inference via Kronecker structure is typically incompatible with early-stopping due to missing learning curve values. We impose $\\textit{latent Kronecker structure}$ to leverage efficient prod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09239","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.09239/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.09239","created_at":"2026-07-05T09:19:36.234760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.09239v1","created_at":"2026-07-05T09:19:36.234760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09239","created_at":"2026-07-05T09:19:36.234760+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHS44OWKH7OA","created_at":"2026-07-05T09:19:36.234760+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHS44OWKH7OAQIYE","created_at":"2026-07-05T09:19:36.234760+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHS44OWK","created_at":"2026-07-05T09:19:36.234760+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.07964","citing_title":"Derivation of Output Correlation Inferences for Multi-Output (aka Multi-Task) Gaussian Process","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU","json":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU.json","graph_json":"https://pith.science/api/pith-number/HHS44OWKH7OAQIYELJBRGPSHCU/graph.json","events_json":"https://pith.science/api/pith-number/HHS44OWKH7OAQIYELJBRGPSHCU/events.json","paper":"https://pith.science/paper/HHS44OWK"},"agent_actions":{"view_html":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU","download_json":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU.json","view_paper":"https://pith.science/paper/HHS44OWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.09239&json=true","fetch_graph":"https://pith.science/api/pith-number/HHS44OWKH7OAQIYELJBRGPSHCU/graph.json","fetch_events":"https://pith.science/api/pith-number/HHS44OWKH7OAQIYELJBRGPSHCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU/action/storage_attestation","attest_author":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU/action/author_attestation","sign_citation":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU/action/citation_signature","submit_replication":"https://pith.science/pith/HHS44OWKH7OAQIYELJBRGPSHCU/action/replication_record"}},"created_at":"2026-07-05T09:19:36.234760+00:00","updated_at":"2026-07-05T09:19:36.234760+00:00"}