{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QQKMMC5LGKNVQIENDR5OJSGXS4","short_pith_number":"pith:QQKMMC5L","schema_version":"1.0","canonical_sha256":"8414c60bab329b58208d1c7ae4c8d797348911943bba2a33e1a2c0eb9c39cee5","source":{"kind":"arxiv","id":"1810.00997","version":2},"attestation_state":"computed","paper":{"title":"A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michal Valko, Peter L. Bartlett, Victor Gabillon","submitted_at":"2018-10-01T22:14:43Z","abstract_excerpt":"We study the problem of optimizing a function under a \\emph{budgeted number of evaluations}. We only assume that the function is \\emph{locally} smooth around one of its global optima. The difficulty of optimization is measured in terms of 1) the amount of \\emph{noise} $b$ of the function evaluation and 2) the local smoothness, $d$, of the function. A smaller $d$ results in smaller optimization error. We come with a new, simple, and parameter-free approach. First, for all values of $b$ and $d$, this approach recovers at least the state-of-the-art regret guarantees. Second, our approach addition"},"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":"1810.00997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T22:14:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2dcac97f901e6b30823a6d6874c2fa8071a877bd7932c34320ca54ccf4a8e6df","abstract_canon_sha256":"665d8f6698c7e77e3cbb94f346aeb78a6c3820c73b079c22ee69fad8a49d69ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:52.069880Z","signature_b64":"ZS69Xc3PZs0qH/65GGSNCLWdwEA/5pOkfZa9MR4bGCqMOt9YfG0Clh45u4sLU7Um3CVp3u0uuq9yIzgBLLXHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8414c60bab329b58208d1c7ae4c8d797348911943bba2a33e1a2c0eb9c39cee5","last_reissued_at":"2026-05-17T23:52:52.069157Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:52.069157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michal Valko, Peter L. Bartlett, Victor Gabillon","submitted_at":"2018-10-01T22:14:43Z","abstract_excerpt":"We study the problem of optimizing a function under a \\emph{budgeted number of evaluations}. We only assume that the function is \\emph{locally} smooth around one of its global optima. The difficulty of optimization is measured in terms of 1) the amount of \\emph{noise} $b$ of the function evaluation and 2) the local smoothness, $d$, of the function. A smaller $d$ results in smaller optimization error. We come with a new, simple, and parameter-free approach. First, for all values of $b$ and $d$, this approach recovers at least the state-of-the-art regret guarantees. Second, our approach addition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00997","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":"1810.00997","created_at":"2026-05-17T23:52:52.069280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00997v2","created_at":"2026-05-17T23:52:52.069280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00997","created_at":"2026-05-17T23:52:52.069280+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQKMMC5LGKNV","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQKMMC5LGKNVQIEN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQKMMC5L","created_at":"2026-05-18T12:32:46.962924+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/QQKMMC5LGKNVQIENDR5OJSGXS4","json":"https://pith.science/pith/QQKMMC5LGKNVQIENDR5OJSGXS4.json","graph_json":"https://pith.science/api/pith-number/QQKMMC5LGKNVQIENDR5OJSGXS4/graph.json","events_json":"https://pith.science/api/pith-number/QQKMMC5LGKNVQIENDR5OJSGXS4/events.json","paper":"https://pith.science/paper/QQKMMC5L"},"agent_actions":{"view_html":"https://pith.science/pith/QQKMMC5LGKNVQIENDR5OJSGXS4","download_json":"https://pith.science/pith/QQKMMC5LGKNVQIENDR5OJSGXS4.json","view_paper":"https://pith.science/paper/QQKMMC5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00997&json=true","fetch_graph":"https://pith.science/api/pith-number/QQKMMC5LGKNVQIENDR5OJSGXS4/graph.json","fetch_events":"https://pith.science/api/pith-number/QQKMMC5LGKNVQIENDR5OJSGXS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQKMMC5LGKNVQIENDR5OJSGXS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQKMMC5LGKNVQIENDR5OJSGXS4/action/storage_attestation","attest_author":"https://pith.science/pith/QQKMMC5LGKNVQIENDR5OJSGXS4/action/author_attestation","sign_citation":"https://pith.science/pith/QQKMMC5LGKNVQIENDR5OJSGXS4/action/citation_signature","submit_replication":"https://pith.science/pith/QQKMMC5LGKNVQIENDR5OJSGXS4/action/replication_record"}},"created_at":"2026-05-17T23:52:52.069280+00:00","updated_at":"2026-05-17T23:52:52.069280+00:00"}