{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JVNRAWW2LECMEIXMF3M5V4NUEM","short_pith_number":"pith:JVNRAWW2","schema_version":"1.0","canonical_sha256":"4d5b105ada5904c222ec2ed9daf1b423164443fe47fd740c76fa76f2fcb1ebe2","source":{"kind":"arxiv","id":"2009.13828","version":1},"attestation_state":"computed","paper":{"title":"Neural Model-based Optimization with Right-Censored Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Frank Hutter, Kai Haase, Katharina Eggensperger, Marius Lindauer, Philipp M\\\"uller","submitted_at":"2020-09-29T07:32:30Z","abstract_excerpt":"In many fields of study, we only observe lower bounds on the true response value of some experiments. When fitting a regression model to predict the distribution of the outcomes, we cannot simply drop these right-censored observations, but need to properly model them. In this work, we focus on the concept of censored data in the light of model-based optimization where prematurely terminating evaluations (and thus generating right-censored data) is a key factor for efficiency, e.g., when searching for an algorithm configuration that minimizes runtime of the algorithm at hand. Neural networks (N"},"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":"2009.13828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-29T07:32:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"073a0bdc492f3e298c2a2fbe8c0250f52d6ff124d8827f8c00a90ad124ca55e3","abstract_canon_sha256":"168753f4b5b76b852fee0f2fcb8ed57cbff597333699146ce942ed681320c061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:45.437452Z","signature_b64":"7/rEp5JUTH4al6uEKp/FGIcq3XBARPuUaXQtfurNZEWn9AZiCZp0RT8IA9rlBdH2koDx155/0izlJi3pv4BRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d5b105ada5904c222ec2ed9daf1b423164443fe47fd740c76fa76f2fcb1ebe2","last_reissued_at":"2026-07-05T01:38:45.437111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:45.437111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Model-based Optimization with Right-Censored Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Frank Hutter, Kai Haase, Katharina Eggensperger, Marius Lindauer, Philipp M\\\"uller","submitted_at":"2020-09-29T07:32:30Z","abstract_excerpt":"In many fields of study, we only observe lower bounds on the true response value of some experiments. When fitting a regression model to predict the distribution of the outcomes, we cannot simply drop these right-censored observations, but need to properly model them. In this work, we focus on the concept of censored data in the light of model-based optimization where prematurely terminating evaluations (and thus generating right-censored data) is a key factor for efficiency, e.g., when searching for an algorithm configuration that minimizes runtime of the algorithm at hand. Neural networks (N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.13828","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/2009.13828/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":"2009.13828","created_at":"2026-07-05T01:38:45.437163+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.13828v1","created_at":"2026-07-05T01:38:45.437163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.13828","created_at":"2026-07-05T01:38:45.437163+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVNRAWW2LECM","created_at":"2026-07-05T01:38:45.437163+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVNRAWW2LECMEIXM","created_at":"2026-07-05T01:38:45.437163+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVNRAWW2","created_at":"2026-07-05T01:38:45.437163+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05256","citing_title":"Learned Offline Query Planning via Bayesian Optimization","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM","json":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM.json","graph_json":"https://pith.science/api/pith-number/JVNRAWW2LECMEIXMF3M5V4NUEM/graph.json","events_json":"https://pith.science/api/pith-number/JVNRAWW2LECMEIXMF3M5V4NUEM/events.json","paper":"https://pith.science/paper/JVNRAWW2"},"agent_actions":{"view_html":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM","download_json":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM.json","view_paper":"https://pith.science/paper/JVNRAWW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.13828&json=true","fetch_graph":"https://pith.science/api/pith-number/JVNRAWW2LECMEIXMF3M5V4NUEM/graph.json","fetch_events":"https://pith.science/api/pith-number/JVNRAWW2LECMEIXMF3M5V4NUEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM/action/storage_attestation","attest_author":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM/action/author_attestation","sign_citation":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM/action/citation_signature","submit_replication":"https://pith.science/pith/JVNRAWW2LECMEIXMF3M5V4NUEM/action/replication_record"}},"created_at":"2026-07-05T01:38:45.437163+00:00","updated_at":"2026-07-05T01:38:45.437163+00:00"}