{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CGSFIZZYCQXIBEDKN7A5G3UH27","short_pith_number":"pith:CGSFIZZY","schema_version":"1.0","canonical_sha256":"11a4546738142e80906a6fc1d36e87d7cec64f24f7ac90a091da989caf4a3005","source":{"kind":"arxiv","id":"1705.04405","version":2},"attestation_state":"computed","paper":{"title":"Practical Bayesian Optimization for Model Fitting with Bayesian Adaptive Direct Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.NC","q-bio.QM"],"primary_cat":"stat.ML","authors_text":"Luigi Acerbi, Wei Ji Ma","submitted_at":"2017-05-11T23:53:13Z","abstract_excerpt":"Computational models in fields such as computational neuroscience are often evaluated via stochastic simulation or numerical approximation. Fitting these models implies a difficult optimization problem over complex, possibly noisy parameter landscapes. Bayesian optimization (BO) has been successfully applied to solving expensive black-box problems in engineering and machine learning. Here we explore whether BO can be applied as a general tool for model fitting. First, we present a novel hybrid BO algorithm, Bayesian adaptive direct search (BADS), that achieves competitive performance with an a"},"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":"1705.04405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-11T23:53:13Z","cross_cats_sorted":["q-bio.NC","q-bio.QM"],"title_canon_sha256":"f2a29e3fba7d9e2363b386216191f59a8e57afdabc67e681ed8a8340a4d81750","abstract_canon_sha256":"f52e8eedc0737b2275b0f882c6e982be36e5d435e5cb05f63b917115787b2dac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:31.151658Z","signature_b64":"iwo1bDmEnk04xEfcGjU5ij/8iFh/e0ZRSatbr1idgCPgH4Y+9Fx1HJXCbvCScLizQzuZO6vyXHWJdjnKFD+BCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11a4546738142e80906a6fc1d36e87d7cec64f24f7ac90a091da989caf4a3005","last_reissued_at":"2026-05-18T00:31:31.151022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:31.151022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Bayesian Optimization for Model Fitting with Bayesian Adaptive Direct Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.NC","q-bio.QM"],"primary_cat":"stat.ML","authors_text":"Luigi Acerbi, Wei Ji Ma","submitted_at":"2017-05-11T23:53:13Z","abstract_excerpt":"Computational models in fields such as computational neuroscience are often evaluated via stochastic simulation or numerical approximation. Fitting these models implies a difficult optimization problem over complex, possibly noisy parameter landscapes. Bayesian optimization (BO) has been successfully applied to solving expensive black-box problems in engineering and machine learning. Here we explore whether BO can be applied as a general tool for model fitting. First, we present a novel hybrid BO algorithm, Bayesian adaptive direct search (BADS), that achieves competitive performance with an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04405","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":"1705.04405","created_at":"2026-05-18T00:31:31.151131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04405v2","created_at":"2026-05-18T00:31:31.151131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04405","created_at":"2026-05-18T00:31:31.151131+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGSFIZZYCQXI","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGSFIZZYCQXIBEDK","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGSFIZZY","created_at":"2026-05-18T12:31:10.602751+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/CGSFIZZYCQXIBEDKN7A5G3UH27","json":"https://pith.science/pith/CGSFIZZYCQXIBEDKN7A5G3UH27.json","graph_json":"https://pith.science/api/pith-number/CGSFIZZYCQXIBEDKN7A5G3UH27/graph.json","events_json":"https://pith.science/api/pith-number/CGSFIZZYCQXIBEDKN7A5G3UH27/events.json","paper":"https://pith.science/paper/CGSFIZZY"},"agent_actions":{"view_html":"https://pith.science/pith/CGSFIZZYCQXIBEDKN7A5G3UH27","download_json":"https://pith.science/pith/CGSFIZZYCQXIBEDKN7A5G3UH27.json","view_paper":"https://pith.science/paper/CGSFIZZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04405&json=true","fetch_graph":"https://pith.science/api/pith-number/CGSFIZZYCQXIBEDKN7A5G3UH27/graph.json","fetch_events":"https://pith.science/api/pith-number/CGSFIZZYCQXIBEDKN7A5G3UH27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGSFIZZYCQXIBEDKN7A5G3UH27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGSFIZZYCQXIBEDKN7A5G3UH27/action/storage_attestation","attest_author":"https://pith.science/pith/CGSFIZZYCQXIBEDKN7A5G3UH27/action/author_attestation","sign_citation":"https://pith.science/pith/CGSFIZZYCQXIBEDKN7A5G3UH27/action/citation_signature","submit_replication":"https://pith.science/pith/CGSFIZZYCQXIBEDKN7A5G3UH27/action/replication_record"}},"created_at":"2026-05-18T00:31:31.151131+00:00","updated_at":"2026-05-18T00:31:31.151131+00:00"}