{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JII5GCRKEMER6XJWEO5ZAHEBBR","short_pith_number":"pith:JII5GCRK","schema_version":"1.0","canonical_sha256":"4a11d30a2a23091f5d3623bb901c810c7b4bd807dcde7915e8c8551fbea15428","source":{"kind":"arxiv","id":"2012.04201","version":3},"attestation_state":"computed","paper":{"title":"GPU Accelerated Exhaustive Search for Optimal Ensemble of Black-Box Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bojan Tunguz, Gilberto Titericz, Jiwei Liu","submitted_at":"2020-12-08T04:10:35Z","abstract_excerpt":"Black-box optimization is essential for tuning complex machine learning algorithms which are easier to experiment with than to understand. In this paper, we show that a simple ensemble of black-box optimization algorithms can outperform any single one of them. However, searching for such an optimal ensemble requires a large number of experiments. We propose a Multi-GPU-optimized framework to accelerate a brute force search for the optimal ensemble of black-box optimization algorithms by running many experiments in parallel. The lightweight optimizations are performed by CPU while expensive mod"},"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":"2012.04201","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-08T04:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"41d8e74342de22d02c4442c702fa699be5587f2583eb19f5f1152b3950bac5b7","abstract_canon_sha256":"9833b028ddd4d6055f5045b36baca9979a4bc3bdce4ab7dc5de5a8b0e1d8779a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:33.276858Z","signature_b64":"OFeP9NagtYxKywNm7XemVCZ2HSbM51OHxT5irTu94bk4qs5yHwm3ebNkCQ/xzwhoqbIW4sIIpUumUNcyOMDzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a11d30a2a23091f5d3623bb901c810c7b4bd807dcde7915e8c8551fbea15428","last_reissued_at":"2026-07-05T03:02:33.276425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:33.276425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU Accelerated Exhaustive Search for Optimal Ensemble of Black-Box Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bojan Tunguz, Gilberto Titericz, Jiwei Liu","submitted_at":"2020-12-08T04:10:35Z","abstract_excerpt":"Black-box optimization is essential for tuning complex machine learning algorithms which are easier to experiment with than to understand. In this paper, we show that a simple ensemble of black-box optimization algorithms can outperform any single one of them. However, searching for such an optimal ensemble requires a large number of experiments. We propose a Multi-GPU-optimized framework to accelerate a brute force search for the optimal ensemble of black-box optimization algorithms by running many experiments in parallel. The lightweight optimizations are performed by CPU while expensive mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04201","kind":"arxiv","version":3},"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/2012.04201/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":"2012.04201","created_at":"2026-07-05T03:02:33.276481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.04201v3","created_at":"2026-07-05T03:02:33.276481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04201","created_at":"2026-07-05T03:02:33.276481+00:00"},{"alias_kind":"pith_short_12","alias_value":"JII5GCRKEMER","created_at":"2026-07-05T03:02:33.276481+00:00"},{"alias_kind":"pith_short_16","alias_value":"JII5GCRKEMER6XJW","created_at":"2026-07-05T03:02:33.276481+00:00"},{"alias_kind":"pith_short_8","alias_value":"JII5GCRK","created_at":"2026-07-05T03:02:33.276481+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/JII5GCRKEMER6XJWEO5ZAHEBBR","json":"https://pith.science/pith/JII5GCRKEMER6XJWEO5ZAHEBBR.json","graph_json":"https://pith.science/api/pith-number/JII5GCRKEMER6XJWEO5ZAHEBBR/graph.json","events_json":"https://pith.science/api/pith-number/JII5GCRKEMER6XJWEO5ZAHEBBR/events.json","paper":"https://pith.science/paper/JII5GCRK"},"agent_actions":{"view_html":"https://pith.science/pith/JII5GCRKEMER6XJWEO5ZAHEBBR","download_json":"https://pith.science/pith/JII5GCRKEMER6XJWEO5ZAHEBBR.json","view_paper":"https://pith.science/paper/JII5GCRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.04201&json=true","fetch_graph":"https://pith.science/api/pith-number/JII5GCRKEMER6XJWEO5ZAHEBBR/graph.json","fetch_events":"https://pith.science/api/pith-number/JII5GCRKEMER6XJWEO5ZAHEBBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JII5GCRKEMER6XJWEO5ZAHEBBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JII5GCRKEMER6XJWEO5ZAHEBBR/action/storage_attestation","attest_author":"https://pith.science/pith/JII5GCRKEMER6XJWEO5ZAHEBBR/action/author_attestation","sign_citation":"https://pith.science/pith/JII5GCRKEMER6XJWEO5ZAHEBBR/action/citation_signature","submit_replication":"https://pith.science/pith/JII5GCRKEMER6XJWEO5ZAHEBBR/action/replication_record"}},"created_at":"2026-07-05T03:02:33.276481+00:00","updated_at":"2026-07-05T03:02:33.276481+00:00"}