{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RIMF55KZA4OCXEYLZWVQFIF4ZF","short_pith_number":"pith:RIMF55KZ","schema_version":"1.0","canonical_sha256":"8a185ef559071c2b930bcdab02a0bcc95eb1ea3cbd5bc01a19b87c66e5f4456d","source":{"kind":"arxiv","id":"1206.3238","version":1},"attestation_state":"computed","paper":{"title":"Greedy Block Coordinate Descent for Large Scale Gaussian Process Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cristian Sminchisescu, Liefeng Bo","submitted_at":"2012-06-13T14:18:22Z","abstract_excerpt":"We propose a variable decomposition algorithm -greedy block coordinate descent (GBCD)- in order to make dense Gaussian process regression practical for large scale problems. GBCD breaks a large scale optimization into a series of small sub-problems. The challenge in variable decomposition algorithms is the identification of a subproblem (the active set of variables) that yields the largest improvement. We analyze the limitations of existing methods and cast the active set selection into a zero-norm constrained optimization problem that we solve using greedy methods. By directly estimating the "},"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":"1206.3238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:18:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"432e5053dd5c7bed9457fd882f447ce34b930ac4ceae6581f861edf35e62a9c3","abstract_canon_sha256":"91ba9b75bb9e37b46b1824cd5c90fc1cebec9eef21d5fed26bb48e5c514b22fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:31.124947Z","signature_b64":"kiS/BAg94ZR9Ql0E0++o7p6leh31kPtnr3jz9Qyg4o5CB1x7tVbJeRjtXor2eY6gbVFLHCcGpmPhvTb8cvqUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a185ef559071c2b930bcdab02a0bcc95eb1ea3cbd5bc01a19b87c66e5f4456d","last_reissued_at":"2026-05-18T03:53:31.124422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:31.124422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Block Coordinate Descent for Large Scale Gaussian Process Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cristian Sminchisescu, Liefeng Bo","submitted_at":"2012-06-13T14:18:22Z","abstract_excerpt":"We propose a variable decomposition algorithm -greedy block coordinate descent (GBCD)- in order to make dense Gaussian process regression practical for large scale problems. GBCD breaks a large scale optimization into a series of small sub-problems. The challenge in variable decomposition algorithms is the identification of a subproblem (the active set of variables) that yields the largest improvement. We analyze the limitations of existing methods and cast the active set selection into a zero-norm constrained optimization problem that we solve using greedy methods. By directly estimating the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3238","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":""},"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":"1206.3238","created_at":"2026-05-18T03:53:31.124500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3238v1","created_at":"2026-05-18T03:53:31.124500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3238","created_at":"2026-05-18T03:53:31.124500+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIMF55KZA4OC","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIMF55KZA4OCXEYL","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIMF55KZ","created_at":"2026-05-18T12:27:20.899486+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/RIMF55KZA4OCXEYLZWVQFIF4ZF","json":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF.json","graph_json":"https://pith.science/api/pith-number/RIMF55KZA4OCXEYLZWVQFIF4ZF/graph.json","events_json":"https://pith.science/api/pith-number/RIMF55KZA4OCXEYLZWVQFIF4ZF/events.json","paper":"https://pith.science/paper/RIMF55KZ"},"agent_actions":{"view_html":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF","download_json":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF.json","view_paper":"https://pith.science/paper/RIMF55KZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3238&json=true","fetch_graph":"https://pith.science/api/pith-number/RIMF55KZA4OCXEYLZWVQFIF4ZF/graph.json","fetch_events":"https://pith.science/api/pith-number/RIMF55KZA4OCXEYLZWVQFIF4ZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/action/storage_attestation","attest_author":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/action/author_attestation","sign_citation":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/action/citation_signature","submit_replication":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/action/replication_record"}},"created_at":"2026-05-18T03:53:31.124500+00:00","updated_at":"2026-05-18T03:53:31.124500+00:00"}