{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F6JUYVTM7GVZOKOACRIQORMSQJ","short_pith_number":"pith:F6JUYVTM","schema_version":"1.0","canonical_sha256":"2f934c566cf9ab9729c01451074592824815880ac43c4497b3553f52dbe8fa5d","source":{"kind":"arxiv","id":"2410.12457","version":1},"attestation_state":"computed","paper":{"title":"Sharpness-Aware Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Feiyang Ye, Ivor Tsang, Masashi Sugiyama, Xuehao Wang, Yueming Lyu, Yu Zhang","submitted_at":"2024-10-16T11:08:06Z","abstract_excerpt":"Black-box optimization algorithms have been widely used in various machine learning problems, including reinforcement learning and prompt fine-tuning. However, directly optimizing the training loss value, as commonly done in existing black-box optimization methods, could lead to suboptimal model quality and generalization performance. To address those problems in black-box optimization, we propose a novel Sharpness-Aware Black-box Optimization (SABO) algorithm, which applies a sharpness-aware minimization strategy to improve the model generalization. Specifically, the proposed SABO method firs"},"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":"2410.12457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-16T11:08:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"041967e2da98940b584208e290f8bf3e6a3ed92f75de9e9c8b39e9ed499779ff","abstract_canon_sha256":"257e385d9079e47a672c9974d4a76e252b92b9df56162806291d82d9a2cb5de0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:29.250195Z","signature_b64":"rdjppWaH+6NkoTN3QIs5EOGH1zjZc4Z/ftvGMmRzwfka6/bKCjAtwTVCNJ7bN2O6E29s4fs4K9iG0Aiswc9QDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f934c566cf9ab9729c01451074592824815880ac43c4497b3553f52dbe8fa5d","last_reissued_at":"2026-07-05T09:21:29.249790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:29.249790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharpness-Aware Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Feiyang Ye, Ivor Tsang, Masashi Sugiyama, Xuehao Wang, Yueming Lyu, Yu Zhang","submitted_at":"2024-10-16T11:08:06Z","abstract_excerpt":"Black-box optimization algorithms have been widely used in various machine learning problems, including reinforcement learning and prompt fine-tuning. However, directly optimizing the training loss value, as commonly done in existing black-box optimization methods, could lead to suboptimal model quality and generalization performance. To address those problems in black-box optimization, we propose a novel Sharpness-Aware Black-box Optimization (SABO) algorithm, which applies a sharpness-aware minimization strategy to improve the model generalization. Specifically, the proposed SABO method firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12457","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/2410.12457/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":"2410.12457","created_at":"2026-07-05T09:21:29.249836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.12457v1","created_at":"2026-07-05T09:21:29.249836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12457","created_at":"2026-07-05T09:21:29.249836+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6JUYVTM7GVZ","created_at":"2026-07-05T09:21:29.249836+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6JUYVTM7GVZOKOA","created_at":"2026-07-05T09:21:29.249836+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6JUYVTM","created_at":"2026-07-05T09:21:29.249836+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.01003","citing_title":"ESSAM: A Novel Competitive Evolution Strategies Approach to Reinforcement Learning for Memory Efficient LLMs Fine-Tuning","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ","json":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ.json","graph_json":"https://pith.science/api/pith-number/F6JUYVTM7GVZOKOACRIQORMSQJ/graph.json","events_json":"https://pith.science/api/pith-number/F6JUYVTM7GVZOKOACRIQORMSQJ/events.json","paper":"https://pith.science/paper/F6JUYVTM"},"agent_actions":{"view_html":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ","download_json":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ.json","view_paper":"https://pith.science/paper/F6JUYVTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.12457&json=true","fetch_graph":"https://pith.science/api/pith-number/F6JUYVTM7GVZOKOACRIQORMSQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/F6JUYVTM7GVZOKOACRIQORMSQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ/action/storage_attestation","attest_author":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ/action/author_attestation","sign_citation":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ/action/citation_signature","submit_replication":"https://pith.science/pith/F6JUYVTM7GVZOKOACRIQORMSQJ/action/replication_record"}},"created_at":"2026-07-05T09:21:29.249836+00:00","updated_at":"2026-07-05T09:21:29.249836+00:00"}