{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:66HI76S3UNFW4MH56Y34L3WF5W","short_pith_number":"pith:66HI76S3","schema_version":"1.0","canonical_sha256":"f78e8ffa5ba34b6e30fdf637c5eec5ed9fdc723bf9f60b4966a775b574d1c04d","source":{"kind":"arxiv","id":"2411.02158","version":2},"attestation_state":"computed","paper":{"title":"Learning Multiple Initial Solutions to Optimization Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Elad Sharony, Heng Yang, Marco Pavone, Peter Karkus, Shie Mannor, Tong Che","submitted_at":"2024-11-04T15:17:19Z","abstract_excerpt":"Sequentially solving similar optimization problems under strict runtime constraints is essential for many applications, such as robot control, autonomous driving, and portfolio management. The performance of local optimization methods in these settings is sensitive to the initial solution: poor initialization can lead to slow convergence or suboptimal solutions. To address this challenge, we propose learning to predict \\emph{multiple} diverse initial solutions given parameters that define the problem instance. We introduce two strategies for utilizing multiple initial solutions: (i) a single-o"},"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":"2411.02158","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-04T15:17:19Z","cross_cats_sorted":["cs.AI","cs.RO","cs.SY","eess.SY"],"title_canon_sha256":"f217fd4559bb2ef8904b1d37d997ab52b75ae330717d39f1b746acf1120a2e20","abstract_canon_sha256":"3ca221795359db2d745f02334550405142a89a5be0f630534a2c40347bfef98a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:24.221639Z","signature_b64":"IntLL3OJ8C77BBDWhjpCJqhR4YQ3tR6XLSUBWZvqemhD1kCmgEV9JwnDrIX7zyafXLFwyo26sAcFZOEjSnvvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78e8ffa5ba34b6e30fdf637c5eec5ed9fdc723bf9f60b4966a775b574d1c04d","last_reissued_at":"2026-07-05T10:08:24.221183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:24.221183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Multiple Initial Solutions to Optimization Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Elad Sharony, Heng Yang, Marco Pavone, Peter Karkus, Shie Mannor, Tong Che","submitted_at":"2024-11-04T15:17:19Z","abstract_excerpt":"Sequentially solving similar optimization problems under strict runtime constraints is essential for many applications, such as robot control, autonomous driving, and portfolio management. The performance of local optimization methods in these settings is sensitive to the initial solution: poor initialization can lead to slow convergence or suboptimal solutions. To address this challenge, we propose learning to predict \\emph{multiple} diverse initial solutions given parameters that define the problem instance. We introduce two strategies for utilizing multiple initial solutions: (i) a single-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02158","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/2411.02158/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":"2411.02158","created_at":"2026-07-05T10:08:24.221240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02158v2","created_at":"2026-07-05T10:08:24.221240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02158","created_at":"2026-07-05T10:08:24.221240+00:00"},{"alias_kind":"pith_short_12","alias_value":"66HI76S3UNFW","created_at":"2026-07-05T10:08:24.221240+00:00"},{"alias_kind":"pith_short_16","alias_value":"66HI76S3UNFW4MH5","created_at":"2026-07-05T10:08:24.221240+00:00"},{"alias_kind":"pith_short_8","alias_value":"66HI76S3","created_at":"2026-07-05T10:08:24.221240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00366","citing_title":"GLENS: Global Search via Learning from Solver Iterates with Diffusion Models","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W","json":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W.json","graph_json":"https://pith.science/api/pith-number/66HI76S3UNFW4MH56Y34L3WF5W/graph.json","events_json":"https://pith.science/api/pith-number/66HI76S3UNFW4MH56Y34L3WF5W/events.json","paper":"https://pith.science/paper/66HI76S3"},"agent_actions":{"view_html":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W","download_json":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W.json","view_paper":"https://pith.science/paper/66HI76S3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02158&json=true","fetch_graph":"https://pith.science/api/pith-number/66HI76S3UNFW4MH56Y34L3WF5W/graph.json","fetch_events":"https://pith.science/api/pith-number/66HI76S3UNFW4MH56Y34L3WF5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W/action/storage_attestation","attest_author":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W/action/author_attestation","sign_citation":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W/action/citation_signature","submit_replication":"https://pith.science/pith/66HI76S3UNFW4MH56Y34L3WF5W/action/replication_record"}},"created_at":"2026-07-05T10:08:24.221240+00:00","updated_at":"2026-07-05T10:08:24.221240+00:00"}