{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TUFINT4LA2SRFAX3XUUQSWALAN","short_pith_number":"pith:TUFINT4L","schema_version":"1.0","canonical_sha256":"9d0a86cf8b06a51282fbbd2909580b037e29bb2b5094e6d3f9e8a28b9fb7f920","source":{"kind":"arxiv","id":"1501.07242","version":2},"attestation_state":"computed","paper":{"title":"Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Alexander Rakhlin, Alexandre Belloni, Hariharan Narayanan, Tengyuan Liang","submitted_at":"2015-01-28T19:12:40Z","abstract_excerpt":"We consider the problem of optimizing an approximately convex function over a bounded convex set in $\\mathbb{R}^n$ using only function evaluations. The problem is reduced to sampling from an \\emph{approximately} log-concave distribution using the Hit-and-Run method, which is shown to have the same $\\mathcal{O}^*$ complexity as sampling from log-concave distributions. In addition to extend the analysis for log-concave distributions to approximate log-concave distributions, the implementation of the 1-dimensional sampler of the Hit-and-Run walk requires new methods and analysis. The algorithm th"},"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":"1501.07242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-01-28T19:12:40Z","cross_cats_sorted":["cs.LG","cs.NA","math.OC"],"title_canon_sha256":"cb8c47d43f6742cade2b45509429fe2701c95924084571150506d8727a995542","abstract_canon_sha256":"116266b81d04f388342e800d1c667dc91bec7c7a41e42aeaaee028302a072acf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T17:09:00.860015Z","signature_b64":"JT6Pu+qU5Y62GD5WJT3tvT9cyr1WvvD/hO1C2SiIlTuVIE8tOVr8ONMuN2GHQ+gUNIEABfcqQz5uTLKYHe33Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d0a86cf8b06a51282fbbd2909580b037e29bb2b5094e6d3f9e8a28b9fb7f920","last_reissued_at":"2026-06-04T17:09:00.859534Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T17:09:00.859534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Alexander Rakhlin, Alexandre Belloni, Hariharan Narayanan, Tengyuan Liang","submitted_at":"2015-01-28T19:12:40Z","abstract_excerpt":"We consider the problem of optimizing an approximately convex function over a bounded convex set in $\\mathbb{R}^n$ using only function evaluations. The problem is reduced to sampling from an \\emph{approximately} log-concave distribution using the Hit-and-Run method, which is shown to have the same $\\mathcal{O}^*$ complexity as sampling from log-concave distributions. In addition to extend the analysis for log-concave distributions to approximate log-concave distributions, the implementation of the 1-dimensional sampler of the Hit-and-Run walk requires new methods and analysis. The algorithm th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07242","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1501.07242/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":"1501.07242","created_at":"2026-06-04T17:09:00.859589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07242v2","created_at":"2026-06-04T17:09:00.859589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07242","created_at":"2026-06-04T17:09:00.859589+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUFINT4LA2SR","created_at":"2026-06-04T17:09:00.859589+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUFINT4LA2SRFAX3","created_at":"2026-06-04T17:09:00.859589+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUFINT4L","created_at":"2026-06-04T17:09:00.859589+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2410.15272","citing_title":"Performance-Driven QUBO for Recommender Systems on Quantum Annealers","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN","json":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN.json","graph_json":"https://pith.science/api/pith-number/TUFINT4LA2SRFAX3XUUQSWALAN/graph.json","events_json":"https://pith.science/api/pith-number/TUFINT4LA2SRFAX3XUUQSWALAN/events.json","paper":"https://pith.science/paper/TUFINT4L"},"agent_actions":{"view_html":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN","download_json":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN.json","view_paper":"https://pith.science/paper/TUFINT4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07242&json=true","fetch_graph":"https://pith.science/api/pith-number/TUFINT4LA2SRFAX3XUUQSWALAN/graph.json","fetch_events":"https://pith.science/api/pith-number/TUFINT4LA2SRFAX3XUUQSWALAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN/action/storage_attestation","attest_author":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN/action/author_attestation","sign_citation":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN/action/citation_signature","submit_replication":"https://pith.science/pith/TUFINT4LA2SRFAX3XUUQSWALAN/action/replication_record"}},"created_at":"2026-06-04T17:09:00.859589+00:00","updated_at":"2026-06-04T17:09:00.859589+00:00"}