{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QUFGRPE2LOX7PXNWHQHJKMB6S6","short_pith_number":"pith:QUFGRPE2","schema_version":"1.0","canonical_sha256":"850a68bc9a5baff7ddb63c0e95303e97a8ca013ea1d170c192c7fa8ab2535510","source":{"kind":"arxiv","id":"1703.02628","version":3},"attestation_state":"computed","paper":{"title":"Global optimization of Lipschitz functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"C\\'edric Malherbe, Nicolas Vayatis","submitted_at":"2017-03-07T22:29:54Z","abstract_excerpt":"The goal of the paper is to design sequential strategies which lead to efficient optimization of an unknown function under the only assumption that it has a finite Lipschitz constant. We first identify sufficient conditions for the consistency of generic sequential algorithms and formulate the expected minimax rate for their performance. We introduce and analyze a first algorithm called LIPO which assumes the Lipschitz constant to be known. Consistency, minimax rates for LIPO are proved, as well as fast rates under an additional H\\\"older like condition. An adaptive version of LIPO is also intr"},"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":"1703.02628","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-07T22:29:54Z","cross_cats_sorted":[],"title_canon_sha256":"7c8b9ab821aff8d63c37bd2a9d7bc832ced78d06b082d28abe8c13b739aef39e","abstract_canon_sha256":"6c7a43a91919154602c2e12fee51599a7684346de2b7f26272aa140292b05e1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:17.298928Z","signature_b64":"lyGHMTK1y61z63mYcWwujxAAvMcSWosRIgU8Lz+Lct/ikWheGfryboMCsOfEOXZBbCHYsaXavGDD66TnCKOVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"850a68bc9a5baff7ddb63c0e95303e97a8ca013ea1d170c192c7fa8ab2535510","last_reissued_at":"2026-05-18T00:42:17.298253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:17.298253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global optimization of Lipschitz functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"C\\'edric Malherbe, Nicolas Vayatis","submitted_at":"2017-03-07T22:29:54Z","abstract_excerpt":"The goal of the paper is to design sequential strategies which lead to efficient optimization of an unknown function under the only assumption that it has a finite Lipschitz constant. We first identify sufficient conditions for the consistency of generic sequential algorithms and formulate the expected minimax rate for their performance. We introduce and analyze a first algorithm called LIPO which assumes the Lipschitz constant to be known. Consistency, minimax rates for LIPO are proved, as well as fast rates under an additional H\\\"older like condition. An adaptive version of LIPO is also intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02628","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":""},"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":"1703.02628","created_at":"2026-05-18T00:42:17.298359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02628v3","created_at":"2026-05-18T00:42:17.298359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02628","created_at":"2026-05-18T00:42:17.298359+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUFGRPE2LOX7","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUFGRPE2LOX7PXNW","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUFGRPE2","created_at":"2026-05-18T12:31:39.905425+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/QUFGRPE2LOX7PXNWHQHJKMB6S6","json":"https://pith.science/pith/QUFGRPE2LOX7PXNWHQHJKMB6S6.json","graph_json":"https://pith.science/api/pith-number/QUFGRPE2LOX7PXNWHQHJKMB6S6/graph.json","events_json":"https://pith.science/api/pith-number/QUFGRPE2LOX7PXNWHQHJKMB6S6/events.json","paper":"https://pith.science/paper/QUFGRPE2"},"agent_actions":{"view_html":"https://pith.science/pith/QUFGRPE2LOX7PXNWHQHJKMB6S6","download_json":"https://pith.science/pith/QUFGRPE2LOX7PXNWHQHJKMB6S6.json","view_paper":"https://pith.science/paper/QUFGRPE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02628&json=true","fetch_graph":"https://pith.science/api/pith-number/QUFGRPE2LOX7PXNWHQHJKMB6S6/graph.json","fetch_events":"https://pith.science/api/pith-number/QUFGRPE2LOX7PXNWHQHJKMB6S6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUFGRPE2LOX7PXNWHQHJKMB6S6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUFGRPE2LOX7PXNWHQHJKMB6S6/action/storage_attestation","attest_author":"https://pith.science/pith/QUFGRPE2LOX7PXNWHQHJKMB6S6/action/author_attestation","sign_citation":"https://pith.science/pith/QUFGRPE2LOX7PXNWHQHJKMB6S6/action/citation_signature","submit_replication":"https://pith.science/pith/QUFGRPE2LOX7PXNWHQHJKMB6S6/action/replication_record"}},"created_at":"2026-05-18T00:42:17.298359+00:00","updated_at":"2026-05-18T00:42:17.298359+00:00"}